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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 6.0K Feb 26 15:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 26 15:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 15:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 15:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 15:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 26 15:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 15:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K Feb 26 15:37 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-d1m09-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d1m09-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678244791726

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-d1m09
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-08 03:06:33] [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 03:06:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 03:06:33] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2023-03-08 03:06:33] [INFO ] Transformed 1440 places.
[2023-03-08 03:06:33] [INFO ] Transformed 672 transitions.
[2023-03-08 03:06:33] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 162 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 1093 places in 6 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 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 83 places :
Symmetric choice reduction at 1 with 83 rule applications. Total rules 184 place count 243 transition count 412
Iterating global reduction 1 with 83 rules applied. Total rules applied 267 place count 243 transition count 412
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 279 place count 243 transition count 400
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 341 place count 181 transition count 338
Iterating global reduction 2 with 62 rules applied. Total rules applied 403 place count 181 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 406 place count 181 transition count 335
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 436 place count 151 transition count 287
Iterating global reduction 3 with 30 rules applied. Total rules applied 466 place count 151 transition count 287
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 3 with 27 rules applied. Total rules applied 493 place count 151 transition count 260
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 499 place count 145 transition count 252
Iterating global reduction 4 with 6 rules applied. Total rules applied 505 place count 145 transition count 252
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 510 place count 140 transition count 247
Iterating global reduction 4 with 5 rules applied. Total rules applied 515 place count 140 transition count 247
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 517 place count 140 transition count 245
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 520 place count 137 transition count 242
Iterating global reduction 5 with 3 rules applied. Total rules applied 523 place count 137 transition count 242
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 524 place count 136 transition count 240
Iterating global reduction 5 with 1 rules applied. Total rules applied 525 place count 136 transition count 240
Applied a total of 525 rules in 72 ms. Remains 136 /347 variables (removed 211) and now considering 240/672 (removed 432) transitions.
// Phase 1: matrix 240 rows 136 cols
[2023-03-08 03:06:33] [INFO ] Computed 2 place invariants in 21 ms
[2023-03-08 03:06:33] [INFO ] Implicit Places using invariants in 234 ms returned []
[2023-03-08 03:06:33] [INFO ] Invariant cache hit.
[2023-03-08 03:06:33] [INFO ] State equation strengthened by 121 read => feed constraints.
[2023-03-08 03:06:34] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 561 ms to find 0 implicit places.
[2023-03-08 03:06:34] [INFO ] Invariant cache hit.
[2023-03-08 03:06:34] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 136/347 places, 240/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 740 ms. Remains : 136/347 places, 240/672 transitions.
Support contains 29 out of 136 places after structural reductions.
[2023-03-08 03:06:34] [INFO ] Flatten gal took : 37 ms
[2023-03-08 03:06:34] [INFO ] Flatten gal took : 16 ms
[2023-03-08 03:06:34] [INFO ] Input system was already deterministic with 240 transitions.
Incomplete random walk after 10000 steps, including 2276 resets, run finished after 519 ms. (steps per millisecond=19 ) properties (out of 26) seen :4
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 41 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 200 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 37 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :1
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 62 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 97 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 43 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Running SMT prover for 21 properties.
[2023-03-08 03:06:35] [INFO ] Invariant cache hit.
[2023-03-08 03:06:39] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 03:06:39] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-08 03:06:40] [INFO ] After 2559ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:19
[2023-03-08 03:06:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-08 03:06:40] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 03:06:40] [INFO ] After 469ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :19
[2023-03-08 03:06:40] [INFO ] State equation strengthened by 121 read => feed constraints.
[2023-03-08 03:06:41] [INFO ] After 669ms SMT Verify possible using 121 Read/Feed constraints in natural domain returned unsat :2 sat :19
[2023-03-08 03:06:42] [INFO ] After 1256ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :19
Attempting to minimize the solution found.
Minimization took 757 ms.
[2023-03-08 03:06:43] [INFO ] After 2629ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :19
Fused 21 Parikh solutions to 19 different solutions.
Parikh walk visited 0 properties in 138 ms.
Support contains 23 out of 136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 240/240 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 131 transition count 227
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 131 transition count 227
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 131 transition count 226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 130 transition count 225
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 130 transition count 225
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 129 transition count 224
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 129 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 129 transition count 223
Applied a total of 16 rules in 29 ms. Remains 129 /136 variables (removed 7) and now considering 223/240 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 129/136 places, 223/240 transitions.
Incomplete random walk after 10000 steps, including 2293 resets, run finished after 321 ms. (steps per millisecond=31 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 41 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 58 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 200 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 41 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) 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 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 88 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) 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 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 98 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 58 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Finished probabilistic random walk after 7618 steps, run visited all 19 properties in 80 ms. (steps per millisecond=95 )
Probabilistic random walk after 7618 steps, saw 3499 distinct states, run finished after 80 ms. (steps per millisecond=95 ) properties seen :19
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
Computed a total of 5 stabilizing places and 24 stable transitions
Graph (complete) has 509 edges and 136 vertex of which 135 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(X(G((F(p1)&&p0)))))'
Support contains 2 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 240/240 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 116 transition count 168
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 116 transition count 168
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 116 transition count 165
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 54 place count 105 transition count 154
Iterating global reduction 1 with 11 rules applied. Total rules applied 65 place count 105 transition count 154
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 69 place count 105 transition count 150
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 79 place count 95 transition count 135
Iterating global reduction 2 with 10 rules applied. Total rules applied 89 place count 95 transition count 135
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 95 place count 95 transition count 129
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 100 place count 90 transition count 118
Iterating global reduction 3 with 5 rules applied. Total rules applied 105 place count 90 transition count 118
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 107 place count 90 transition count 116
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 110 place count 87 transition count 113
Iterating global reduction 4 with 3 rules applied. Total rules applied 113 place count 87 transition count 113
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 115 place count 85 transition count 111
Iterating global reduction 4 with 2 rules applied. Total rules applied 117 place count 85 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 119 place count 85 transition count 109
Applied a total of 119 rules in 22 ms. Remains 85 /136 variables (removed 51) and now considering 109/240 (removed 131) transitions.
// Phase 1: matrix 109 rows 85 cols
[2023-03-08 03:06:44] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 03:06:44] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-08 03:06:44] [INFO ] Invariant cache hit.
[2023-03-08 03:06:44] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-08 03:06:44] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
[2023-03-08 03:06:44] [INFO ] Invariant cache hit.
[2023-03-08 03:06:44] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 85/136 places, 109/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 374 ms. Remains : 85/136 places, 109/240 transitions.
Stuttering acceptance computed with spot in 925 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s42 1)), p1:(AND (GEQ s1 1) (GEQ s42 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 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-00 finished in 1356 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 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 240/240 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 116 transition count 172
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 116 transition count 172
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 44 place count 116 transition count 168
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 54 place count 106 transition count 158
Iterating global reduction 1 with 10 rules applied. Total rules applied 64 place count 106 transition count 158
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 67 place count 106 transition count 155
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 76 place count 97 transition count 141
Iterating global reduction 2 with 9 rules applied. Total rules applied 85 place count 97 transition count 141
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 91 place count 97 transition count 135
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 96 place count 92 transition count 120
Iterating global reduction 3 with 5 rules applied. Total rules applied 101 place count 92 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 102 place count 92 transition count 119
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 105 place count 89 transition count 116
Iterating global reduction 4 with 3 rules applied. Total rules applied 108 place count 89 transition count 116
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 110 place count 87 transition count 114
Iterating global reduction 4 with 2 rules applied. Total rules applied 112 place count 87 transition count 114
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 114 place count 87 transition count 112
Applied a total of 114 rules in 29 ms. Remains 87 /136 variables (removed 49) and now considering 112/240 (removed 128) transitions.
// Phase 1: matrix 112 rows 87 cols
[2023-03-08 03:06:45] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 03:06:45] [INFO ] Implicit Places using invariants in 133 ms returned []
[2023-03-08 03:06:45] [INFO ] Invariant cache hit.
[2023-03-08 03:06:45] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-08 03:06:45] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
[2023-03-08 03:06:45] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 03:06:45] [INFO ] Invariant cache hit.
[2023-03-08 03:06:45] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/136 places, 112/240 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 355 ms. Remains : 87/136 places, 112/240 transitions.
Stuttering acceptance computed with spot in 365 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s79 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-01 finished in 732 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((G(p1) U p2))&&F(p1)&&p0)))'
Support contains 4 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 240/240 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 117 transition count 173
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 117 transition count 173
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 42 place count 117 transition count 169
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 52 place count 107 transition count 159
Iterating global reduction 1 with 10 rules applied. Total rules applied 62 place count 107 transition count 159
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 66 place count 107 transition count 155
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 75 place count 98 transition count 142
Iterating global reduction 2 with 9 rules applied. Total rules applied 84 place count 98 transition count 142
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 89 place count 98 transition count 137
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 94 place count 93 transition count 121
Iterating global reduction 3 with 5 rules applied. Total rules applied 99 place count 93 transition count 121
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 103 place count 93 transition count 117
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 105 place count 91 transition count 115
Iterating global reduction 4 with 2 rules applied. Total rules applied 107 place count 91 transition count 115
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 109 place count 89 transition count 113
Iterating global reduction 4 with 2 rules applied. Total rules applied 111 place count 89 transition count 113
Applied a total of 111 rules in 18 ms. Remains 89 /136 variables (removed 47) and now considering 113/240 (removed 127) transitions.
// Phase 1: matrix 113 rows 89 cols
[2023-03-08 03:06:46] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-08 03:06:46] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-08 03:06:46] [INFO ] Invariant cache hit.
[2023-03-08 03:06:46] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-08 03:06:46] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2023-03-08 03:06:46] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 03:06:46] [INFO ] Invariant cache hit.
[2023-03-08 03:06:46] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/136 places, 113/240 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 381 ms. Remains : 89/136 places, 113/240 transitions.
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=0 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0, 1} source=0 dest: 2}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={0} source=0 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))), acceptance={0, 1} source=1 dest: 0}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p2) p1)), acceptance={1} source=1 dest: 1}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=1 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND p0 p2 p1), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={1} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0, 1} source=3 dest: 2}, { cond=(OR p2 p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0, 1} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=5 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={1} source=5 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND p2 p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s84 1)), p2:(AND (GEQ s26 1) (GEQ s35 1)), p1:(AND (GEQ s1 1) (GEQ s84 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-02 finished in 643 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 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 240/240 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 116 transition count 171
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 116 transition count 171
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 44 place count 116 transition count 167
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 54 place count 106 transition count 157
Iterating global reduction 1 with 10 rules applied. Total rules applied 64 place count 106 transition count 157
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 68 place count 106 transition count 153
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 77 place count 97 transition count 139
Iterating global reduction 2 with 9 rules applied. Total rules applied 86 place count 97 transition count 139
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 91 place count 97 transition count 134
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 97 place count 91 transition count 117
Iterating global reduction 3 with 6 rules applied. Total rules applied 103 place count 91 transition count 117
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 105 place count 91 transition count 115
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 108 place count 88 transition count 112
Iterating global reduction 4 with 3 rules applied. Total rules applied 111 place count 88 transition count 112
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 113 place count 86 transition count 110
Iterating global reduction 4 with 2 rules applied. Total rules applied 115 place count 86 transition count 110
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 117 place count 86 transition count 108
Applied a total of 117 rules in 29 ms. Remains 86 /136 variables (removed 50) and now considering 108/240 (removed 132) transitions.
// Phase 1: matrix 108 rows 86 cols
[2023-03-08 03:06:46] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-08 03:06:46] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-08 03:06:46] [INFO ] Invariant cache hit.
[2023-03-08 03:06:46] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-08 03:06:46] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2023-03-08 03:06:46] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 03:06:46] [INFO ] Invariant cache hit.
[2023-03-08 03:06:47] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 86/136 places, 108/240 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 239 ms. Remains : 86/136 places, 108/240 transitions.
Stuttering acceptance computed with spot in 691 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s84 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 3 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-03 finished in 941 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(F(p0))||(p0&&X(X(p1)))))))'
Support contains 4 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 240/240 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 117 transition count 174
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 117 transition count 174
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 117 transition count 171
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 52 place count 106 transition count 160
Iterating global reduction 1 with 11 rules applied. Total rules applied 63 place count 106 transition count 160
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 67 place count 106 transition count 156
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 77 place count 96 transition count 141
Iterating global reduction 2 with 10 rules applied. Total rules applied 87 place count 96 transition count 141
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 93 place count 96 transition count 135
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 99 place count 90 transition count 118
Iterating global reduction 3 with 6 rules applied. Total rules applied 105 place count 90 transition count 118
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 107 place count 90 transition count 116
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 110 place count 87 transition count 113
Iterating global reduction 4 with 3 rules applied. Total rules applied 113 place count 87 transition count 113
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 115 place count 85 transition count 111
Iterating global reduction 4 with 2 rules applied. Total rules applied 117 place count 85 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 119 place count 85 transition count 109
Applied a total of 119 rules in 11 ms. Remains 85 /136 variables (removed 51) and now considering 109/240 (removed 131) transitions.
// Phase 1: matrix 109 rows 85 cols
[2023-03-08 03:06:47] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 03:06:47] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-08 03:06:47] [INFO ] Invariant cache hit.
[2023-03-08 03:06:47] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-08 03:06:47] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
[2023-03-08 03:06:47] [INFO ] Invariant cache hit.
[2023-03-08 03:06:47] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 85/136 places, 109/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 220 ms. Remains : 85/136 places, 109/240 transitions.
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(OR (LT s2 1) (LT s82 1)), p1:(AND (GEQ s1 1) (GEQ s37 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 28579 reset in 193 ms.
Product exploration explored 100000 steps with 28592 reset in 156 ms.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 290 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2292 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2000 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2000 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Finished probabilistic random walk after 3346 steps, run visited all 2 properties in 26 ms. (steps per millisecond=128 )
Probabilistic random walk after 3346 steps, saw 1646 distinct states, run finished after 26 ms. (steps per millisecond=128 ) properties seen :2
Knowledge obtained : [(AND p0 (NOT p1)), (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 128 ms. Reduced automaton from 6 states, 6 edges and 2 AP (stutter sensitive) to 6 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 85 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 85/85 places, 109/109 transitions.
Applied a total of 0 rules in 1 ms. Remains 85 /85 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2023-03-08 03:06:49] [INFO ] Invariant cache hit.
[2023-03-08 03:06:49] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-08 03:06:49] [INFO ] Invariant cache hit.
[2023-03-08 03:06:49] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-08 03:06:49] [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 03:06:49] [INFO ] Invariant cache hit.
[2023-03-08 03:06:49] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 224 ms. Remains : 85/85 places, 109/109 transitions.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 290 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 6 states, 6 edges and 2 AP (stutter sensitive) to 6 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2299 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2000 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2000 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) seen :0
Finished probabilistic random walk after 3346 steps, run visited all 2 properties in 21 ms. (steps per millisecond=159 )
Probabilistic random walk after 3346 steps, saw 1646 distinct states, run finished after 22 ms. (steps per millisecond=152 ) properties seen :2
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 119 ms. Reduced automaton from 6 states, 6 edges and 2 AP (stutter sensitive) to 6 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 494 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 220 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 28535 reset in 186 ms.
Product exploration explored 100000 steps with 28616 reset in 147 ms.
Applying partial POR strategy [true, false, true, false, false, false]
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 109/109 transitions.
Applied a total of 0 rules in 4 ms. Remains 85 /85 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2023-03-08 03:06:53] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 03:06:53] [INFO ] Invariant cache hit.
[2023-03-08 03:06:53] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62 ms. Remains : 85/85 places, 109/109 transitions.
Built C files in :
/tmp/ltsmin18190290496696173981
[2023-03-08 03:06:53] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18190290496696173981
Running compilation step : cd /tmp/ltsmin18190290496696173981;'/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 278 ms.
Running link step : cd /tmp/ltsmin18190290496696173981;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin18190290496696173981;'/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/stateBased10375899960314464387.hoa' '--buchi-type=spotba'
LTSmin run took 277 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-04 finished in 6455 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 240/240 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 117 transition count 180
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 117 transition count 180
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 44 place count 117 transition count 174
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 54 place count 107 transition count 164
Iterating global reduction 1 with 10 rules applied. Total rules applied 64 place count 107 transition count 164
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 68 place count 107 transition count 160
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 77 place count 98 transition count 147
Iterating global reduction 2 with 9 rules applied. Total rules applied 86 place count 98 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 92 place count 98 transition count 141
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 97 place count 93 transition count 125
Iterating global reduction 3 with 5 rules applied. Total rules applied 102 place count 93 transition count 125
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 106 place count 93 transition count 121
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 108 place count 91 transition count 119
Iterating global reduction 4 with 2 rules applied. Total rules applied 110 place count 91 transition count 119
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 112 place count 89 transition count 117
Iterating global reduction 4 with 2 rules applied. Total rules applied 114 place count 89 transition count 117
Applied a total of 114 rules in 16 ms. Remains 89 /136 variables (removed 47) and now considering 117/240 (removed 123) transitions.
// Phase 1: matrix 117 rows 89 cols
[2023-03-08 03:06:54] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 03:06:54] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-08 03:06:54] [INFO ] Invariant cache hit.
[2023-03-08 03:06:54] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-08 03:06:54] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2023-03-08 03:06:54] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 03:06:54] [INFO ] Invariant cache hit.
[2023-03-08 03:06:54] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/136 places, 117/240 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 268 ms. Remains : 89/136 places, 117/240 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s84 1) (AND (GEQ s1 1) (GEQ s62 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 22870 reset in 106 ms.
Product exploration explored 100000 steps with 22984 reset in 120 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 304 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 128 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2286 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 478 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4849 steps, run visited all 1 properties in 9 ms. (steps per millisecond=538 )
Probabilistic random walk after 4849 steps, saw 2265 distinct states, run finished after 10 ms. (steps per millisecond=484 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 123 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 53 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 117/117 transitions.
Applied a total of 0 rules in 3 ms. Remains 89 /89 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2023-03-08 03:06:55] [INFO ] Invariant cache hit.
[2023-03-08 03:06:55] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-08 03:06:55] [INFO ] Invariant cache hit.
[2023-03-08 03:06:55] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-08 03:06:55] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2023-03-08 03:06:55] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 03:06:55] [INFO ] Invariant cache hit.
[2023-03-08 03:06:55] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 289 ms. Remains : 89/89 places, 117/117 transitions.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 304 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 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 213 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2328 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 484 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4849 steps, run visited all 1 properties in 12 ms. (steps per millisecond=404 )
Probabilistic random walk after 4849 steps, saw 2265 distinct states, run finished after 13 ms. (steps per millisecond=373 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22976 reset in 107 ms.
Product exploration explored 100000 steps with 22899 reset in 109 ms.
Built C files in :
/tmp/ltsmin10036479522171341946
[2023-03-08 03:06:56] [INFO ] Computing symmetric may disable matrix : 117 transitions.
[2023-03-08 03:06:56] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 03:06:56] [INFO ] Computing symmetric may enable matrix : 117 transitions.
[2023-03-08 03:06:56] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 03:06:56] [INFO ] Computing Do-Not-Accords matrix : 117 transitions.
[2023-03-08 03:06:56] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 03:06:56] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10036479522171341946
Running compilation step : cd /tmp/ltsmin10036479522171341946;'/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 225 ms.
Running link step : cd /tmp/ltsmin10036479522171341946;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin10036479522171341946;'/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/stateBased449742537716931629.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 117/117 transitions.
Applied a total of 0 rules in 8 ms. Remains 89 /89 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2023-03-08 03:07:11] [INFO ] Invariant cache hit.
[2023-03-08 03:07:11] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-08 03:07:11] [INFO ] Invariant cache hit.
[2023-03-08 03:07:11] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-08 03:07:11] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2023-03-08 03:07:11] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 03:07:11] [INFO ] Invariant cache hit.
[2023-03-08 03:07:11] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 276 ms. Remains : 89/89 places, 117/117 transitions.
Built C files in :
/tmp/ltsmin12651836925995574780
[2023-03-08 03:07:11] [INFO ] Computing symmetric may disable matrix : 117 transitions.
[2023-03-08 03:07:11] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 03:07:11] [INFO ] Computing symmetric may enable matrix : 117 transitions.
[2023-03-08 03:07:11] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 03:07:11] [INFO ] Computing Do-Not-Accords matrix : 117 transitions.
[2023-03-08 03:07:11] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 03:07:11] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12651836925995574780
Running compilation step : cd /tmp/ltsmin12651836925995574780;'/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 247 ms.
Running link step : cd /tmp/ltsmin12651836925995574780;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin12651836925995574780;'/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/stateBased9990134513617671737.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-08 03:07:27] [INFO ] Flatten gal took : 7 ms
[2023-03-08 03:07:27] [INFO ] Flatten gal took : 7 ms
[2023-03-08 03:07:27] [INFO ] Time to serialize gal into /tmp/LTL12890945020519294464.gal : 2 ms
[2023-03-08 03:07:27] [INFO ] Time to serialize properties into /tmp/LTL17134690776963298638.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12890945020519294464.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17339159927227244522.hoa' '-atoms' '/tmp/LTL17134690776963298638.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...320
Loading property file /tmp/LTL17134690776963298638.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17339159927227244522.hoa
Detected timeout of ITS tools.
[2023-03-08 03:07:42] [INFO ] Flatten gal took : 6 ms
[2023-03-08 03:07:42] [INFO ] Flatten gal took : 6 ms
[2023-03-08 03:07:42] [INFO ] Time to serialize gal into /tmp/LTL15305250295827101179.gal : 2 ms
[2023-03-08 03:07:42] [INFO ] Time to serialize properties into /tmp/LTL3279811159931143793.ltl : 2 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/LTL15305250295827101179.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3279811159931143793.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("(((s1<1)||(l1224<1))||((s1>=1)&&(l610>=1)))"))))
Formula 0 simplified : FG!"(((s1<1)||(l1224<1))||((s1>=1)&&(l610>=1)))"
Detected timeout of ITS tools.
[2023-03-08 03:07:57] [INFO ] Flatten gal took : 11 ms
[2023-03-08 03:07:57] [INFO ] Applying decomposition
[2023-03-08 03:07:57] [INFO ] Flatten gal took : 12 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/graph13394555422362441886.txt' '-o' '/tmp/graph13394555422362441886.bin' '-w' '/tmp/graph13394555422362441886.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13394555422362441886.bin' '-l' '-1' '-v' '-w' '/tmp/graph13394555422362441886.weights' '-q' '0' '-e' '0.001'
[2023-03-08 03:07:57] [INFO ] Decomposing Gal with order
[2023-03-08 03:07:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 03:07:57] [INFO ] Removed a total of 100 redundant transitions.
[2023-03-08 03:07:57] [INFO ] Flatten gal took : 40 ms
[2023-03-08 03:07:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 7 ms.
[2023-03-08 03:07:57] [INFO ] Time to serialize gal into /tmp/LTL1419701097192970838.gal : 3 ms
[2023-03-08 03:07:57] [INFO ] Time to serialize properties into /tmp/LTL12752462301436262036.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/LTL1419701097192970838.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12752462301436262036.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("(((i1.u1.s1<1)||(i6.u13.l1224<1))||((i1.u1.s1>=1)&&(u0.l610>=1)))"))))
Formula 0 simplified : FG!"(((i1.u1.s1<1)||(i6.u13.l1224<1))||((i1.u1.s1>=1)&&(u0.l610>=1)))"
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t11, t47, t67, t68, t76, t88, t96, t106, t159, t189, t190, t194, t197, t201, t202, t2...429
Computing Next relation with stutter on 6.69212e+07 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin72683464782398585
[2023-03-08 03:08:12] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin72683464782398585
Running compilation step : cd /tmp/ltsmin72683464782398585;'/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 194 ms.
Running link step : cd /tmp/ltsmin72683464782398585;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin72683464782398585;'/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)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-05 finished in 93315 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0)||(p0&&F(p1))))))'
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 240/240 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 117 transition count 177
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 117 transition count 177
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 43 place count 117 transition count 172
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 54 place count 106 transition count 161
Iterating global reduction 1 with 11 rules applied. Total rules applied 65 place count 106 transition count 161
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 69 place count 106 transition count 157
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 79 place count 96 transition count 142
Iterating global reduction 2 with 10 rules applied. Total rules applied 89 place count 96 transition count 142
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 96 place count 96 transition count 135
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 102 place count 90 transition count 118
Iterating global reduction 3 with 6 rules applied. Total rules applied 108 place count 90 transition count 118
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 110 place count 90 transition count 116
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 113 place count 87 transition count 113
Iterating global reduction 4 with 3 rules applied. Total rules applied 116 place count 87 transition count 113
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 118 place count 85 transition count 111
Iterating global reduction 4 with 2 rules applied. Total rules applied 120 place count 85 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 122 place count 85 transition count 109
Applied a total of 122 rules in 15 ms. Remains 85 /136 variables (removed 51) and now considering 109/240 (removed 131) transitions.
// Phase 1: matrix 109 rows 85 cols
[2023-03-08 03:08:27] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 03:08:27] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-08 03:08:27] [INFO ] Invariant cache hit.
[2023-03-08 03:08:27] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-08 03:08:27] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2023-03-08 03:08:27] [INFO ] Invariant cache hit.
[2023-03-08 03:08:27] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 85/136 places, 109/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 278 ms. Remains : 85/136 places, 109/240 transitions.
Stuttering acceptance computed with spot in 1322 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s57 1)), p1:(OR (LT s1 1) (LT s61 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]]
Product exploration explored 100000 steps with 50000 reset in 201 ms.
Product exploration explored 100000 steps with 50000 reset in 170 ms.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 287 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p0 (NOT p1))))
Knowledge based reduction with 5 factoid took 81 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-06 finished in 2082 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 4 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 240/240 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 118 transition count 189
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 118 transition count 189
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 42 place count 118 transition count 183
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 52 place count 108 transition count 173
Iterating global reduction 1 with 10 rules applied. Total rules applied 62 place count 108 transition count 173
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 65 place count 108 transition count 170
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 74 place count 99 transition count 157
Iterating global reduction 2 with 9 rules applied. Total rules applied 83 place count 99 transition count 157
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 91 place count 99 transition count 149
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 96 place count 94 transition count 134
Iterating global reduction 3 with 5 rules applied. Total rules applied 101 place count 94 transition count 134
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 102 place count 94 transition count 133
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 105 place count 91 transition count 130
Iterating global reduction 4 with 3 rules applied. Total rules applied 108 place count 91 transition count 130
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 110 place count 89 transition count 128
Iterating global reduction 4 with 2 rules applied. Total rules applied 112 place count 89 transition count 128
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 114 place count 89 transition count 126
Applied a total of 114 rules in 21 ms. Remains 89 /136 variables (removed 47) and now considering 126/240 (removed 114) transitions.
// Phase 1: matrix 126 rows 89 cols
[2023-03-08 03:08:29] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 03:08:29] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-08 03:08:29] [INFO ] Invariant cache hit.
[2023-03-08 03:08:29] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-08 03:08:29] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2023-03-08 03:08:29] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 03:08:29] [INFO ] Invariant cache hit.
[2023-03-08 03:08:29] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/136 places, 126/240 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 271 ms. Remains : 89/136 places, 126/240 transitions.
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (LT s1 1) (LT s81 1)) (OR (LT s1 1) (LT s59 1))), p1:(AND (GEQ s1 1) (GEQ s62 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-07 finished in 376 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||(F(p1) U X(G(!p2))))))'
Support contains 5 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 240/240 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 117 transition count 169
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 117 transition count 169
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 117 transition count 166
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 50 place count 108 transition count 157
Iterating global reduction 1 with 9 rules applied. Total rules applied 59 place count 108 transition count 157
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 62 place count 108 transition count 154
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 70 place count 100 transition count 141
Iterating global reduction 2 with 8 rules applied. Total rules applied 78 place count 100 transition count 141
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 83 place count 100 transition count 136
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 87 place count 96 transition count 127
Iterating global reduction 3 with 4 rules applied. Total rules applied 91 place count 96 transition count 127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 92 place count 96 transition count 126
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 95 place count 93 transition count 123
Iterating global reduction 4 with 3 rules applied. Total rules applied 98 place count 93 transition count 123
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 100 place count 91 transition count 121
Iterating global reduction 4 with 2 rules applied. Total rules applied 102 place count 91 transition count 121
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 104 place count 91 transition count 119
Applied a total of 104 rules in 10 ms. Remains 91 /136 variables (removed 45) and now considering 119/240 (removed 121) transitions.
// Phase 1: matrix 119 rows 91 cols
[2023-03-08 03:08:29] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-08 03:08:30] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-08 03:08:30] [INFO ] Invariant cache hit.
[2023-03-08 03:08:30] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-08 03:08:30] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2023-03-08 03:08:30] [INFO ] Invariant cache hit.
[2023-03-08 03:08:30] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 91/136 places, 119/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 231 ms. Remains : 91/136 places, 119/240 transitions.
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) p2), (AND (NOT p1) p2), p2, (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=p2, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s59 1)), p1:(AND (GEQ s30 1) (GEQ s35 1)), p2:(AND (GEQ s27 1) (GEQ s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33756 reset in 183 ms.
Product exploration explored 100000 steps with 33900 reset in 194 ms.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 311 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 14 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT p1)), (X (NOT (AND (NOT p1) p2))), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 376 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[p2, (AND (NOT p1) p2), p2, (NOT p1)]
Incomplete random walk after 10000 steps, including 2325 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 492 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 912 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-08 03:08:31] [INFO ] Invariant cache hit.
[2023-03-08 03:08:31] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-08 03:08:31] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 03:08:31] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 03:08:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 03:08:31] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-08 03:08:31] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 03:08:31] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-08 03:08:31] [INFO ] After 22ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 03:08:31] [INFO ] After 49ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-08 03:08:31] [INFO ] After 144ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 119/119 transitions.
Graph (complete) has 286 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 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 90 transition count 116
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 89 transition count 115
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 89 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 7 place count 89 transition count 114
Applied a total of 7 rules in 9 ms. Remains 89 /91 variables (removed 2) and now considering 114/119 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 89/91 places, 114/119 transitions.
Incomplete random walk after 10000 steps, including 2292 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 499 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 947 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Finished probabilistic random walk after 15617 steps, run visited all 2 properties in 71 ms. (steps per millisecond=219 )
Probabilistic random walk after 15617 steps, saw 7442 distinct states, run finished after 71 ms. (steps per millisecond=219 ) properties seen :2
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT p1)), (X (NOT (AND (NOT p1) p2))), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : [(F p2), (F p0), (F p1), (F (AND (NOT p1) p2))]
Knowledge based reduction with 7 factoid took 1255 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[p2, (AND (NOT p1) p2), p2, (NOT p1)]
Stuttering acceptance computed with spot in 143 ms :[p2, (AND (NOT p1) p2), p2, (NOT p1)]
Support contains 3 out of 91 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 119/119 transitions.
Applied a total of 0 rules in 2 ms. Remains 91 /91 variables (removed 0) and now considering 119/119 (removed 0) transitions.
[2023-03-08 03:08:33] [INFO ] Invariant cache hit.
[2023-03-08 03:08:33] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-08 03:08:33] [INFO ] Invariant cache hit.
[2023-03-08 03:08:33] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-08 03:08:33] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2023-03-08 03:08:33] [INFO ] Invariant cache hit.
[2023-03-08 03:08:33] [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 : 91/91 places, 119/119 transitions.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 311 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 14 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 205 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[p2, (AND (NOT p1) p2), p2, (NOT p1)]
Incomplete random walk after 10000 steps, including 2304 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 974 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 03:08:34] [INFO ] Invariant cache hit.
[2023-03-08 03:08:34] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-08 03:08:34] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-08 03:08:34] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 03:08:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-08 03:08:34] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 03:08:34] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 03:08:34] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-08 03:08:34] [INFO ] After 12ms SMT Verify possible using 42 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 03:08:34] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-08 03:08:34] [INFO ] After 95ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 119/119 transitions.
Graph (complete) has 286 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 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 90 transition count 116
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 6 place count 88 transition count 114
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 88 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 9 place count 88 transition count 113
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 10 place count 87 transition count 112
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 87 transition count 112
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 86 transition count 111
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 86 transition count 111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 86 transition count 110
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 15 place count 85 transition count 104
Iterating global reduction 3 with 1 rules applied. Total rules applied 16 place count 85 transition count 104
Applied a total of 16 rules in 9 ms. Remains 85 /91 variables (removed 6) and now considering 104/119 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 85/91 places, 104/119 transitions.
Incomplete random walk after 10000 steps, including 2285 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 989 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 16047 steps, run visited all 1 properties in 27 ms. (steps per millisecond=594 )
Probabilistic random walk after 16047 steps, saw 7663 distinct states, run finished after 27 ms. (steps per millisecond=594 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : [(F (AND (NOT p1) p2)), (F p2), (F p1)]
Knowledge based reduction with 6 factoid took 231 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[p2, (AND (NOT p1) p2), p2, (NOT p1)]
Stuttering acceptance computed with spot in 134 ms :[p2, (AND (NOT p1) p2), p2, (NOT p1)]
Stuttering acceptance computed with spot in 137 ms :[p2, (AND (NOT p1) p2), p2, (NOT p1)]
Product exploration explored 100000 steps with 29793 reset in 133 ms.
Product exploration explored 100000 steps with 29769 reset in 133 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 161 ms :[p2, (AND (NOT p1) p2), p2, (NOT p1)]
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 119/119 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 90 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 90 transition count 118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 89 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 89 transition count 117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 88 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 88 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 88 transition count 115
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 87 transition count 109
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 87 transition count 109
Applied a total of 9 rules in 10 ms. Remains 87 /91 variables (removed 4) and now considering 109/119 (removed 10) transitions.
[2023-03-08 03:08:35] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 109 rows 87 cols
[2023-03-08 03:08:35] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 03:08:35] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/91 places, 109/119 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 76 ms. Remains : 87/91 places, 109/119 transitions.
Built C files in :
/tmp/ltsmin4608044374646155425
[2023-03-08 03:08:35] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4608044374646155425
Running compilation step : cd /tmp/ltsmin4608044374646155425;'/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 213 ms.
Running link step : cd /tmp/ltsmin4608044374646155425;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin4608044374646155425;'/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/stateBased6694942967723085595.hoa' '--buchi-type=spotba'
LTSmin run took 77 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-08 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-08 finished in 5894 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((X(p0)&&p1))))'
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 240/240 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 117 transition count 181
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 117 transition count 181
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 43 place count 117 transition count 176
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 54 place count 106 transition count 165
Iterating global reduction 1 with 11 rules applied. Total rules applied 65 place count 106 transition count 165
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 70 place count 106 transition count 160
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 80 place count 96 transition count 145
Iterating global reduction 2 with 10 rules applied. Total rules applied 90 place count 96 transition count 145
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 97 place count 96 transition count 138
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 103 place count 90 transition count 121
Iterating global reduction 3 with 6 rules applied. Total rules applied 109 place count 90 transition count 121
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 111 place count 90 transition count 119
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 114 place count 87 transition count 116
Iterating global reduction 4 with 3 rules applied. Total rules applied 117 place count 87 transition count 116
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 119 place count 85 transition count 114
Iterating global reduction 4 with 2 rules applied. Total rules applied 121 place count 85 transition count 114
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 123 place count 85 transition count 112
Applied a total of 123 rules in 11 ms. Remains 85 /136 variables (removed 51) and now considering 112/240 (removed 128) transitions.
// Phase 1: matrix 112 rows 85 cols
[2023-03-08 03:08:35] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 03:08:35] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-08 03:08:35] [INFO ] Invariant cache hit.
[2023-03-08 03:08:35] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-08 03:08:36] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2023-03-08 03:08:36] [INFO ] Invariant cache hit.
[2023-03-08 03:08:36] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 85/136 places, 112/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 231 ms. Remains : 85/136 places, 112/240 transitions.
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=p1, acceptance={0} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}], [{ cond=(NOT p0), acceptance={} source=5 dest: 3}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s60 1)), p1:(AND (GEQ s1 1) (GEQ s37 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-10 finished in 446 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)&&F(G(!p1)))))'
Support contains 3 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 240/240 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 117 transition count 177
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 117 transition count 177
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 42 place count 117 transition count 173
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 51 place count 108 transition count 164
Iterating global reduction 1 with 9 rules applied. Total rules applied 60 place count 108 transition count 164
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 63 place count 108 transition count 161
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 71 place count 100 transition count 148
Iterating global reduction 2 with 8 rules applied. Total rules applied 79 place count 100 transition count 148
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 85 place count 100 transition count 142
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 89 place count 96 transition count 129
Iterating global reduction 3 with 4 rules applied. Total rules applied 93 place count 96 transition count 129
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 94 place count 96 transition count 128
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 96 place count 94 transition count 126
Iterating global reduction 4 with 2 rules applied. Total rules applied 98 place count 94 transition count 126
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 99 place count 93 transition count 125
Iterating global reduction 4 with 1 rules applied. Total rules applied 100 place count 93 transition count 125
Applied a total of 100 rules in 10 ms. Remains 93 /136 variables (removed 43) and now considering 125/240 (removed 115) transitions.
// Phase 1: matrix 125 rows 93 cols
[2023-03-08 03:08:36] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 03:08:36] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-08 03:08:36] [INFO ] Invariant cache hit.
[2023-03-08 03:08:36] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-08 03:08:36] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2023-03-08 03:08:36] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 03:08:36] [INFO ] Invariant cache hit.
[2023-03-08 03:08:36] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 93/136 places, 125/240 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 301 ms. Remains : 93/136 places, 125/240 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) p1), p1]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s91 1)), p1:(AND (GEQ s1 1) (GEQ s83 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 23026 reset in 135 ms.
Product exploration explored 100000 steps with 22908 reset in 141 ms.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 320 edges and 93 vertex of which 92 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (NOT (AND p0 p1))), (X p0), (X (X (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 954 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(OR (NOT p0) p1), p1]
Incomplete random walk after 10000 steps, including 2317 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 464 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 486 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 485 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Finished probabilistic random walk after 19401 steps, run visited all 3 properties in 169 ms. (steps per millisecond=114 )
Probabilistic random walk after 19401 steps, saw 9284 distinct states, run finished after 169 ms. (steps per millisecond=114 ) properties seen :3
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (NOT (AND p0 p1))), (X p0), (X (X (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (AND p1 p0))]
Knowledge based reduction with 7 factoid took 279 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(OR (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 74 ms :[(OR (NOT p0) p1), p1]
Support contains 3 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 125/125 transitions.
Applied a total of 0 rules in 7 ms. Remains 93 /93 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-08 03:08:38] [INFO ] Invariant cache hit.
[2023-03-08 03:08:39] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-08 03:08:39] [INFO ] Invariant cache hit.
[2023-03-08 03:08:39] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-08 03:08:39] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2023-03-08 03:08:39] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 03:08:39] [INFO ] Invariant cache hit.
[2023-03-08 03:08:39] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 278 ms. Remains : 93/93 places, 125/125 transitions.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 320 edges and 93 vertex of which 92 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p1 p0))), (X (NOT p1)), (X p0), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 310 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(OR (NOT p0) p1), p1]
Incomplete random walk after 10000 steps, including 2277 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 461 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 473 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 446 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Finished probabilistic random walk after 19401 steps, run visited all 3 properties in 90 ms. (steps per millisecond=215 )
Probabilistic random walk after 19401 steps, saw 9284 distinct states, run finished after 90 ms. (steps per millisecond=215 ) properties seen :3
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p1 p0))), (X (NOT p1)), (X p0), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (AND p1 p0))]
Knowledge based reduction with 7 factoid took 342 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(OR (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 57 ms :[(OR (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 58 ms :[(OR (NOT p0) p1), p1]
Product exploration explored 100000 steps with 23118 reset in 126 ms.
Product exploration explored 100000 steps with 22907 reset in 129 ms.
Built C files in :
/tmp/ltsmin1872516835964603164
[2023-03-08 03:08:40] [INFO ] Computing symmetric may disable matrix : 125 transitions.
[2023-03-08 03:08:40] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 03:08:40] [INFO ] Computing symmetric may enable matrix : 125 transitions.
[2023-03-08 03:08:40] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 03:08:40] [INFO ] Computing Do-Not-Accords matrix : 125 transitions.
[2023-03-08 03:08:40] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 03:08:40] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1872516835964603164
Running compilation step : cd /tmp/ltsmin1872516835964603164;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 270 ms.
Running link step : cd /tmp/ltsmin1872516835964603164;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin1872516835964603164;'/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/stateBased3510703889442242177.hoa' '--buchi-type=spotba'
LTSmin run took 136 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-13 finished in 4922 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 p1)||X(!(!p0 U p2)))))'
Support contains 5 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 240/240 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 118 transition count 174
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 118 transition count 174
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 41 place count 118 transition count 169
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 49 place count 110 transition count 161
Iterating global reduction 1 with 8 rules applied. Total rules applied 57 place count 110 transition count 161
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 60 place count 110 transition count 158
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 68 place count 102 transition count 147
Iterating global reduction 2 with 8 rules applied. Total rules applied 76 place count 102 transition count 147
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 80 place count 102 transition count 143
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 84 place count 98 transition count 133
Iterating global reduction 3 with 4 rules applied. Total rules applied 88 place count 98 transition count 133
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 92 place count 98 transition count 129
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 94 place count 96 transition count 127
Iterating global reduction 4 with 2 rules applied. Total rules applied 96 place count 96 transition count 127
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 98 place count 94 transition count 125
Iterating global reduction 4 with 2 rules applied. Total rules applied 100 place count 94 transition count 125
Applied a total of 100 rules in 6 ms. Remains 94 /136 variables (removed 42) and now considering 125/240 (removed 115) transitions.
// Phase 1: matrix 125 rows 94 cols
[2023-03-08 03:08:41] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 03:08:41] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-08 03:08:41] [INFO ] Invariant cache hit.
[2023-03-08 03:08:41] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-08 03:08:41] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2023-03-08 03:08:41] [INFO ] Invariant cache hit.
[2023-03-08 03:08:41] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 94/136 places, 125/240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 227 ms. Remains : 94/136 places, 125/240 transitions.
Stuttering acceptance computed with spot in 169 ms :[true, (AND p1 p2), (AND p1 p2), p1, p2]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(AND (GEQ s7 1) (GEQ s36 1)), p1:(AND (GEQ s1 1) (GEQ s89 1)), p2:(AND (GEQ s1 1) (GEQ s63 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 22938 reset in 151 ms.
Product exploration explored 100000 steps with 22891 reset in 156 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 322 edges and 94 vertex of which 93 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 1450 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[true, (AND p1 p2), p2, p1, (AND p1 p2)]
Incomplete random walk after 10000 steps, including 2318 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 986 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 412 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 965 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 471 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 987 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 1028 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 505 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 485 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 443 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 958 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 2318310 steps, run timeout after 3001 ms. (steps per millisecond=772 ) properties seen :{0=1, 1=1, 2=1, 3=1, 4=1, 5=1, 7=1, 8=1, 9=1}
Probabilistic random walk after 2318310 steps, saw 894206 distinct states, run finished after 3001 ms. (steps per millisecond=772 ) properties seen :9
Running SMT prover for 1 properties.
[2023-03-08 03:08:47] [INFO ] Invariant cache hit.
[2023-03-08 03:08:47] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-08 03:08:47] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-08 03:08:47] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p1))), (G (NOT (AND p2 p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p2) (NOT p1))), (F p2), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1)))), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (AND (NOT p0) p2 (NOT p1))), (F (AND (NOT p2) p1)), (F (NOT (AND (NOT p0) (NOT p2) (NOT p1))))]
Knowledge based reduction with 23 factoid took 1725 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[true, p2, p1, (AND p1 p2), (AND p1 p2)]
Stuttering acceptance computed with spot in 193 ms :[true, p2, p1, (AND p1 p2), (AND p1 p2)]
Support contains 5 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 125/125 transitions.
Applied a total of 0 rules in 1 ms. Remains 94 /94 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-08 03:08:49] [INFO ] Invariant cache hit.
[2023-03-08 03:08:49] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-08 03:08:49] [INFO ] Invariant cache hit.
[2023-03-08 03:08:49] [INFO ] State equation strengthened by 44 read => feed constraints.
[2023-03-08 03:08:49] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2023-03-08 03:08:49] [INFO ] Invariant cache hit.
[2023-03-08 03:08:49] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 249 ms. Remains : 94/94 places, 125/125 transitions.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 322 edges and 94 vertex of which 93 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), true, (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 707 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[true, p2, p1, (AND p1 p2), (AND p1 p2)]
Incomplete random walk after 10000 steps, including 2282 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 459 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 1009 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 1001 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 460 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 982 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 1027 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 470 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 974 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :0
Finished probabilistic random walk after 21133 steps, run visited all 8 properties in 102 ms. (steps per millisecond=207 )
Probabilistic random walk after 21133 steps, saw 10012 distinct states, run finished after 102 ms. (steps per millisecond=207 ) properties seen :8
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT p1)), (X (X (NOT p2))), true, (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (AND p2 (NOT p0))), (F (AND p0 (NOT p1))), (F p2), (F (AND (NOT p2) p0 (NOT p1))), (F (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) p1)))), (F (NOT (AND (NOT p2) (NOT p0) (NOT p1))))]
Knowledge based reduction with 18 factoid took 896 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[true, p2, p1, (AND p1 p2), (AND p1 p2)]
Stuttering acceptance computed with spot in 797 ms :[true, p2, p1, (AND p1 p2), (AND p1 p2)]
Stuttering acceptance computed with spot in 163 ms :[true, p2, p1, (AND p1 p2), (AND p1 p2)]
Product exploration explored 100000 steps with 23029 reset in 136 ms.
Product exploration explored 100000 steps with 22944 reset in 144 ms.
Built C files in :
/tmp/ltsmin3084061593012458329
[2023-03-08 03:08:53] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3084061593012458329
Running compilation step : cd /tmp/ltsmin3084061593012458329;'/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 217 ms.
Running link step : cd /tmp/ltsmin3084061593012458329;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin3084061593012458329;'/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/stateBased9264897292244992106.hoa' '--buchi-type=spotba'
LTSmin run took 9128 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-14 finished in 21919 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0)) U !p1)))'
Support contains 5 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 240/240 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 117 transition count 169
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 117 transition count 169
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 117 transition count 166
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 51 place count 107 transition count 156
Iterating global reduction 1 with 10 rules applied. Total rules applied 61 place count 107 transition count 156
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 64 place count 107 transition count 153
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 73 place count 98 transition count 140
Iterating global reduction 2 with 9 rules applied. Total rules applied 82 place count 98 transition count 140
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 87 place count 98 transition count 135
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 91 place count 94 transition count 125
Iterating global reduction 3 with 4 rules applied. Total rules applied 95 place count 94 transition count 125
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 97 place count 94 transition count 123
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 99 place count 92 transition count 121
Iterating global reduction 4 with 2 rules applied. Total rules applied 101 place count 92 transition count 121
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 103 place count 90 transition count 119
Iterating global reduction 4 with 2 rules applied. Total rules applied 105 place count 90 transition count 119
Applied a total of 105 rules in 18 ms. Remains 90 /136 variables (removed 46) and now considering 119/240 (removed 121) transitions.
// Phase 1: matrix 119 rows 90 cols
[2023-03-08 03:09:03] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 03:09:03] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-08 03:09:03] [INFO ] Invariant cache hit.
[2023-03-08 03:09:03] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-08 03:09:03] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2023-03-08 03:09:03] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 03:09:03] [INFO ] Invariant cache hit.
[2023-03-08 03:09:03] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 90/136 places, 119/240 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 266 ms. Remains : 90/136 places, 119/240 transitions.
Stuttering acceptance computed with spot in 111 ms :[p1, (NOT p0), p1]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s51 1)), p0:(OR (AND (GEQ s1 1) (GEQ s46 1)) (AND (GEQ s26 1) (GEQ s50 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 22923 reset in 115 ms.
Product exploration explored 100000 steps with 23004 reset in 125 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 308 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 170 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[p1, (NOT p0), p1]
Incomplete random walk after 10000 steps, including 2273 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 517 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 473 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Finished probabilistic random walk after 5348 steps, run visited all 2 properties in 30 ms. (steps per millisecond=178 )
Probabilistic random walk after 5348 steps, saw 2548 distinct states, run finished after 30 ms. (steps per millisecond=178 ) properties seen :2
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 5 factoid took 267 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[p1, (NOT p0), p1]
Stuttering acceptance computed with spot in 115 ms :[p1, (NOT p0), p1]
Support contains 5 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 119/119 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 119/119 (removed 0) transitions.
[2023-03-08 03:09:04] [INFO ] Invariant cache hit.
[2023-03-08 03:09:04] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-08 03:09:04] [INFO ] Invariant cache hit.
[2023-03-08 03:09:04] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-08 03:09:04] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2023-03-08 03:09:04] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 03:09:04] [INFO ] Invariant cache hit.
[2023-03-08 03:09:04] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 217 ms. Remains : 90/90 places, 119/119 transitions.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 308 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 177 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[p1, (NOT p0), p1]
Incomplete random walk after 10000 steps, including 2328 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 445 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 468 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Finished probabilistic random walk after 5348 steps, run visited all 2 properties in 19 ms. (steps per millisecond=281 )
Probabilistic random walk after 5348 steps, saw 2548 distinct states, run finished after 19 ms. (steps per millisecond=281 ) properties seen :2
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 5 factoid took 624 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[p1, (NOT p0), p1]
Stuttering acceptance computed with spot in 102 ms :[p1, (NOT p0), p1]
Stuttering acceptance computed with spot in 105 ms :[p1, (NOT p0), p1]
Product exploration explored 100000 steps with 22947 reset in 102 ms.
Product exploration explored 100000 steps with 22977 reset in 113 ms.
Built C files in :
/tmp/ltsmin53084894263051165
[2023-03-08 03:09:06] [INFO ] Computing symmetric may disable matrix : 119 transitions.
[2023-03-08 03:09:06] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 03:09:06] [INFO ] Computing symmetric may enable matrix : 119 transitions.
[2023-03-08 03:09:06] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 03:09:06] [INFO ] Computing Do-Not-Accords matrix : 119 transitions.
[2023-03-08 03:09:06] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 03:09:06] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin53084894263051165
Running compilation step : cd /tmp/ltsmin53084894263051165;'/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 234 ms.
Running link step : cd /tmp/ltsmin53084894263051165;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin53084894263051165;'/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/stateBased9444115295919123553.hoa' '--buchi-type=spotba'
LTSmin run took 338 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-15 finished in 4098 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2023-03-08 03:09:07] [INFO ] Flatten gal took : 14 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2540735198432548520
[2023-03-08 03:09:07] [INFO ] Applying decomposition
[2023-03-08 03:09:07] [INFO ] Computing symmetric may disable matrix : 240 transitions.
[2023-03-08 03:09:07] [INFO ] Computation of Complete disable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 03:09:07] [INFO ] Flatten gal took : 12 ms
[2023-03-08 03:09:07] [INFO ] Computing symmetric may enable matrix : 240 transitions.
[2023-03-08 03:09:07] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 03:09:07] [INFO ] Computing Do-Not-Accords matrix : 240 transitions.
[2023-03-08 03:09:07] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 03:09:07] [INFO ] Built C files in 64ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2540735198432548520
Running compilation step : cd /tmp/ltsmin2540735198432548520;'/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'
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/graph13804749235250442723.txt' '-o' '/tmp/graph13804749235250442723.bin' '-w' '/tmp/graph13804749235250442723.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13804749235250442723.bin' '-l' '-1' '-v' '-w' '/tmp/graph13804749235250442723.weights' '-q' '0' '-e' '0.001'
[2023-03-08 03:09:07] [INFO ] Decomposing Gal with order
[2023-03-08 03:09:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 03:09:07] [INFO ] Removed a total of 240 redundant transitions.
[2023-03-08 03:09:07] [INFO ] Flatten gal took : 82 ms
[2023-03-08 03:09:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 266 labels/synchronizations in 7 ms.
[2023-03-08 03:09:07] [INFO ] Time to serialize gal into /tmp/LTLFireability2362982217212314412.gal : 3 ms
[2023-03-08 03:09:07] [INFO ] Time to serialize properties into /tmp/LTLFireability4085214317847968319.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/LTLFireability2362982217212314412.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4085214317847968319.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 : !((G(F("(((i5.u2.s1<1)||(i1.u0.l1224<1))||((i5.u2.s1>=1)&&(i3.u10.l610>=1)))"))))
Formula 0 simplified : FG!"(((i5.u2.s1<1)||(i1.u0.l1224<1))||((i5.u2.s1>=1)&&(i3.u10.l610>=1)))"
Compilation finished in 512 ms.
Running link step : cd /tmp/ltsmin2540735198432548520;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin2540735198432548520;'/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' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-08 03:29:59] [INFO ] Flatten gal took : 18 ms
[2023-03-08 03:29:59] [INFO ] Time to serialize gal into /tmp/LTLFireability8926740005305112927.gal : 1 ms
[2023-03-08 03:29:59] [INFO ] Time to serialize properties into /tmp/LTLFireability17800847439760057858.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/LTLFireability8926740005305112927.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17800847439760057858.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...298
Read 1 LTL properties
Checking formula 0 : !((G(F("(((s1<1)||(l1224<1))||((s1>=1)&&(l610>=1)))"))))
Formula 0 simplified : FG!"(((s1<1)||(l1224<1))||((s1>=1)&&(l610>=1)))"
Detected timeout of ITS tools.
[2023-03-08 03:50:51] [INFO ] Flatten gal took : 18 ms
[2023-03-08 03:50:51] [INFO ] Input system was already deterministic with 240 transitions.
[2023-03-08 03:50:51] [INFO ] Transformed 136 places.
[2023-03-08 03:50:51] [INFO ] Transformed 240 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:50:51] [INFO ] Time to serialize gal into /tmp/LTLFireability2117584901507514420.gal : 2 ms
[2023-03-08 03:50:51] [INFO ] Time to serialize properties into /tmp/LTLFireability7777383709906767199.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/LTLFireability2117584901507514420.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7777383709906767199.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...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F("(((s1<1)||(l1224<1))||((s1>=1)&&(l610>=1)))"))))
Formula 0 simplified : FG!"(((s1<1)||(l1224<1))||((s1>=1)&&(l610>=1)))"
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.007: Initializing POR dependencies: labels 241, guards 240
pins2lts-mc-linux64( 4/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.021: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.026: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.025: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.039: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.039: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.048: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.187: LTL layer: formula: [](<>((LTLAPp0==true)))
pins2lts-mc-linux64( 4/ 8), 0.188: "[](<>((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.188: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.259: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.263: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.286: There are 243 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.286: State length is 137, there are 243 groups
pins2lts-mc-linux64( 0/ 8), 0.286: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.286: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.287: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.287: Visible groups: 0 / 243, labels: 1 / 243
pins2lts-mc-linux64( 0/ 8), 0.287: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.287: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.317: [Blue] ~53 levels ~960 states ~2592 transitions
pins2lts-mc-linux64( 7/ 8), 0.339: [Blue] ~53 levels ~1920 states ~4664 transitions
pins2lts-mc-linux64( 5/ 8), 0.378: [Blue] ~36 levels ~3840 states ~9416 transitions
pins2lts-mc-linux64( 5/ 8), 0.445: [Blue] ~48 levels ~7680 states ~17744 transitions
pins2lts-mc-linux64( 6/ 8), 0.569: [Blue] ~194 levels ~15360 states ~33496 transitions
pins2lts-mc-linux64( 6/ 8), 0.890: [Blue] ~194 levels ~30720 states ~63984 transitions
pins2lts-mc-linux64( 6/ 8), 1.382: [Blue] ~194 levels ~61440 states ~125856 transitions
pins2lts-mc-linux64( 6/ 8), 2.464: [Blue] ~194 levels ~122880 states ~251968 transitions
pins2lts-mc-linux64( 6/ 8), 4.372: [Blue] ~194 levels ~245760 states ~508344 transitions
pins2lts-mc-linux64( 6/ 8), 8.167: [Blue] ~194 levels ~491520 states ~1045048 transitions
pins2lts-mc-linux64( 6/ 8), 14.766: [Blue] ~194 levels ~983040 states ~2080320 transitions
pins2lts-mc-linux64( 6/ 8), 27.613: [Blue] ~194 levels ~1966080 states ~4211384 transitions
pins2lts-mc-linux64( 6/ 8), 55.711: [Blue] ~7986 levels ~3932160 states ~8798200 transitions
pins2lts-mc-linux64( 6/ 8), 124.363: [Blue] ~23481 levels ~7864320 states ~19267952 transitions
pins2lts-mc-linux64( 6/ 8), 275.166: [Blue] ~214572 levels ~15728640 states ~42183504 transitions
pins2lts-mc-linux64( 6/ 8), 596.161: [Blue] ~550175 levels ~31457280 states ~90259032 transitions
pins2lts-mc-linux64( 2/ 8), 1203.740: [Blue] ~27524 levels ~62914560 states ~178484144 transitions
pins2lts-mc-linux64( 4/ 8), 2514.582: [Blue] ~1078782 levels ~125829120 states ~367919848 transitions
pins2lts-mc-linux64( 3/ 8), 3019.115: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 3019.185:
pins2lts-mc-linux64( 0/ 8), 3019.187: Explored 137698864 states 429957944 transitions, fanout: 3.122
pins2lts-mc-linux64( 0/ 8), 3019.187: Total exploration time 3018.900 sec (3018.820 sec minimum, 3018.862 sec on average)
pins2lts-mc-linux64( 0/ 8), 3019.187: States per second: 45612, Transitions per second: 142422
pins2lts-mc-linux64( 0/ 8), 3019.187:
pins2lts-mc-linux64( 0/ 8), 3019.187: State space has 134217388 states, 2119170 are accepting
pins2lts-mc-linux64( 0/ 8), 3019.187: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 3019.187: blue states: 137698864 (102.59%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 3019.187: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 3019.187: all-red states: 2119170 (1.58%), bogus 383 (0.00%)
pins2lts-mc-linux64( 0/ 8), 3019.187:
pins2lts-mc-linux64( 0/ 8), 3019.187: Total memory used for local state coloring: 50.5MB
pins2lts-mc-linux64( 0/ 8), 3019.187:
pins2lts-mc-linux64( 0/ 8), 3019.187: Queue width: 8B, total height: 3310315, memory: 25.26MB
pins2lts-mc-linux64( 0/ 8), 3019.187: Tree memory: 1086.5MB, 8.5 B/state, compr.: 1.5%
pins2lts-mc-linux64( 0/ 8), 3019.187: Tree fill ratio (roots/leafs): 99.0%/24.0%
pins2lts-mc-linux64( 0/ 8), 3019.187: Stored 240 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 3019.187: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 3019.187: Est. total memory use: 1111.7MB (~1049.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2540735198432548520;'/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' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2540735198432548520;'/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' '--ltl' '[](<>((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)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 11824840 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16034880 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-d1m09"
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-d1m09, 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-167814475200276"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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