Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 12:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Apr 12 12:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 12:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 12 12:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 432K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DBSingleClientW-PT-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 1716326086022

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d1m09
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-21 21:14:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 21:14:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 21:14:47] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2024-05-21 21:14:47] [INFO ] Transformed 1440 places.
[2024-05-21 21:14:47] [INFO ] Transformed 672 transitions.
[2024-05-21 21:14:47] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 151 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 1093 places in 4 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 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 78 places :
Symmetric choice reduction at 1 with 78 rule applications. Total rules 179 place count 248 transition count 401
Iterating global reduction 1 with 78 rules applied. Total rules applied 257 place count 248 transition count 401
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 266 place count 248 transition count 392
Discarding 57 places :
Symmetric choice reduction at 2 with 57 rule applications. Total rules 323 place count 191 transition count 335
Iterating global reduction 2 with 57 rules applied. Total rules applied 380 place count 191 transition count 335
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 382 place count 191 transition count 333
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 405 place count 168 transition count 301
Iterating global reduction 3 with 23 rules applied. Total rules applied 428 place count 168 transition count 301
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 3 with 22 rules applied. Total rules applied 450 place count 168 transition count 279
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 452 place count 166 transition count 276
Iterating global reduction 4 with 2 rules applied. Total rules applied 454 place count 166 transition count 276
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 455 place count 165 transition count 275
Iterating global reduction 4 with 1 rules applied. Total rules applied 456 place count 165 transition count 275
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 457 place count 164 transition count 274
Iterating global reduction 4 with 1 rules applied. Total rules applied 458 place count 164 transition count 274
Applied a total of 458 rules in 159 ms. Remains 164 /347 variables (removed 183) and now considering 274/672 (removed 398) transitions.
// Phase 1: matrix 274 rows 164 cols
[2024-05-21 21:14:48] [INFO ] Computed 2 invariants in 26 ms
[2024-05-21 21:14:48] [INFO ] Implicit Places using invariants in 263 ms returned []
[2024-05-21 21:14:48] [INFO ] Invariant cache hit.
[2024-05-21 21:14:48] [INFO ] State equation strengthened by 123 read => feed constraints.
[2024-05-21 21:14:48] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 698 ms to find 0 implicit places.
[2024-05-21 21:14:48] [INFO ] Invariant cache hit.
[2024-05-21 21:14:48] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 164/347 places, 274/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 989 ms. Remains : 164/347 places, 274/672 transitions.
Support contains 34 out of 164 places after structural reductions.
[2024-05-21 21:14:48] [INFO ] Flatten gal took : 43 ms
[2024-05-21 21:14:48] [INFO ] Flatten gal took : 20 ms
[2024-05-21 21:14:49] [INFO ] Input system was already deterministic with 274 transitions.
Support contains 30 out of 164 places (down from 34) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2278 resets, run finished after 699 ms. (steps per millisecond=14 ) properties (out of 21) seen :2
Incomplete Best-First random walk after 1000 steps, including 46 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 48 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 44 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 57 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 34 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 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 95 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 100 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 91 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 100 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 46 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 28 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 48 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 46 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
[2024-05-21 21:14:49] [INFO ] Invariant cache hit.
[2024-05-21 21:14:50] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 21:14:50] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-21 21:14:50] [INFO ] After 385ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2024-05-21 21:14:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-21 21:14:50] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-21 21:14:51] [INFO ] After 559ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :18
[2024-05-21 21:14:51] [INFO ] State equation strengthened by 123 read => feed constraints.
[2024-05-21 21:14:52] [INFO ] After 874ms SMT Verify possible using 123 Read/Feed constraints in natural domain returned unsat :1 sat :18
[2024-05-21 21:14:53] [INFO ] After 1892ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :18
Attempting to minimize the solution found.
Minimization took 987 ms.
[2024-05-21 21:14:54] [INFO ] After 3613ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :18
Fused 19 Parikh solutions to 18 different solutions.
Parikh walk visited 1 properties in 172 ms.
Support contains 23 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 274/274 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 155 transition count 254
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 155 transition count 254
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 155 transition count 253
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 150 transition count 246
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 150 transition count 246
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 31 place count 150 transition count 244
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 34 place count 147 transition count 241
Iterating global reduction 2 with 3 rules applied. Total rules applied 37 place count 147 transition count 241
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 147 transition count 240
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 41 place count 144 transition count 236
Iterating global reduction 3 with 3 rules applied. Total rules applied 44 place count 144 transition count 236
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 46 place count 142 transition count 233
Iterating global reduction 3 with 2 rules applied. Total rules applied 48 place count 142 transition count 233
Applied a total of 48 rules in 49 ms. Remains 142 /164 variables (removed 22) and now considering 233/274 (removed 41) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 142/164 places, 233/274 transitions.
Incomplete random walk after 10000 steps, including 2291 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 42 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 46 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) 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 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 52 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 100 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 103 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 101 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 94 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Finished probabilistic random walk after 7113 steps, run visited all 17 properties in 71 ms. (steps per millisecond=100 )
Probabilistic random walk after 7113 steps, saw 3231 distinct states, run finished after 71 ms. (steps per millisecond=100 ) properties seen :17
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 25 stable transitions
Graph (complete) has 600 edges and 164 vertex of which 163 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 3 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 274/274 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 141 transition count 212
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 141 transition count 212
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 51 place count 141 transition count 207
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 66 place count 126 transition count 184
Iterating global reduction 1 with 15 rules applied. Total rules applied 81 place count 126 transition count 184
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 84 place count 126 transition count 181
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 100 place count 110 transition count 161
Iterating global reduction 2 with 16 rules applied. Total rules applied 116 place count 110 transition count 161
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 121 place count 110 transition count 156
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 131 place count 100 transition count 138
Iterating global reduction 3 with 10 rules applied. Total rules applied 141 place count 100 transition count 138
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 148 place count 100 transition count 131
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 153 place count 95 transition count 125
Iterating global reduction 4 with 5 rules applied. Total rules applied 158 place count 95 transition count 125
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 161 place count 92 transition count 122
Iterating global reduction 4 with 3 rules applied. Total rules applied 164 place count 92 transition count 122
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 166 place count 92 transition count 120
Applied a total of 166 rules in 10 ms. Remains 92 /164 variables (removed 72) and now considering 120/274 (removed 154) transitions.
// Phase 1: matrix 120 rows 92 cols
[2024-05-21 21:14:55] [INFO ] Computed 2 invariants in 4 ms
[2024-05-21 21:14:55] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-21 21:14:55] [INFO ] Invariant cache hit.
[2024-05-21 21:14:55] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-21 21:14:55] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2024-05-21 21:14:55] [INFO ] Invariant cache hit.
[2024-05-21 21:14:55] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 92/164 places, 120/274 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 274 ms. Remains : 92/164 places, 120/274 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 251 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s87 1)) (AND (GEQ s1 1) (GEQ s59 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 3 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 575 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((G(p1)||p0))&&F(p2))))'
Support contains 4 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 274/274 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 141 transition count 209
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 141 transition count 209
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 49 place count 141 transition count 206
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 65 place count 125 transition count 182
Iterating global reduction 1 with 16 rules applied. Total rules applied 81 place count 125 transition count 182
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 84 place count 125 transition count 179
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 101 place count 108 transition count 158
Iterating global reduction 2 with 17 rules applied. Total rules applied 118 place count 108 transition count 158
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 124 place count 108 transition count 152
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 134 place count 98 transition count 134
Iterating global reduction 3 with 10 rules applied. Total rules applied 144 place count 98 transition count 134
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 149 place count 98 transition count 129
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 154 place count 93 transition count 123
Iterating global reduction 4 with 5 rules applied. Total rules applied 159 place count 93 transition count 123
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 163 place count 89 transition count 114
Iterating global reduction 4 with 4 rules applied. Total rules applied 167 place count 89 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 169 place count 89 transition count 112
Applied a total of 169 rules in 12 ms. Remains 89 /164 variables (removed 75) and now considering 112/274 (removed 162) transitions.
// Phase 1: matrix 112 rows 89 cols
[2024-05-21 21:14:55] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 21:14:55] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 21:14:55] [INFO ] Invariant cache hit.
[2024-05-21 21:14:55] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-21 21:14:55] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
[2024-05-21 21:14:55] [INFO ] Invariant cache hit.
[2024-05-21 21:14:55] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 89/164 places, 112/274 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 239 ms. Remains : 89/164 places, 112/274 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s55 1)), p2:(AND (GEQ s1 1) (GEQ s84 1)), p1:(AND (GEQ s1 1) (GEQ s87 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-02 finished in 442 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((F(p1)&&p0) U X(p1)))))'
Support contains 3 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 274/274 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 141 transition count 212
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 141 transition count 212
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 50 place count 141 transition count 208
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 65 place count 126 transition count 185
Iterating global reduction 1 with 15 rules applied. Total rules applied 80 place count 126 transition count 185
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 83 place count 126 transition count 182
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 99 place count 110 transition count 161
Iterating global reduction 2 with 16 rules applied. Total rules applied 115 place count 110 transition count 161
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 121 place count 110 transition count 155
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 131 place count 100 transition count 140
Iterating global reduction 3 with 10 rules applied. Total rules applied 141 place count 100 transition count 140
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 146 place count 100 transition count 135
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 151 place count 95 transition count 129
Iterating global reduction 4 with 5 rules applied. Total rules applied 156 place count 95 transition count 129
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 158 place count 93 transition count 127
Iterating global reduction 4 with 2 rules applied. Total rules applied 160 place count 93 transition count 127
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 163 place count 93 transition count 124
Applied a total of 163 rules in 23 ms. Remains 93 /164 variables (removed 71) and now considering 124/274 (removed 150) transitions.
// Phase 1: matrix 124 rows 93 cols
[2024-05-21 21:14:56] [INFO ] Computed 2 invariants in 4 ms
[2024-05-21 21:14:56] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-21 21:14:56] [INFO ] Invariant cache hit.
[2024-05-21 21:14:56] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-21 21:14:56] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2024-05-21 21:14:56] [INFO ] Invariant cache hit.
[2024-05-21 21:14:56] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 93/164 places, 124/274 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 302 ms. Remains : 93/164 places, 124/274 transitions.
Stuttering acceptance computed with spot in 216 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 4}, { cond=(NOT p0), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}]], initial=2, aps=[p0:(AND (GEQ s1 1) (GEQ s58 1)), p1:(AND (GEQ s1 1) (GEQ s88 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-04 finished in 535 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 274/274 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 141 transition count 218
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 141 transition count 218
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 51 place count 141 transition count 213
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 67 place count 125 transition count 189
Iterating global reduction 1 with 16 rules applied. Total rules applied 83 place count 125 transition count 189
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 86 place count 125 transition count 186
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 103 place count 108 transition count 165
Iterating global reduction 2 with 17 rules applied. Total rules applied 120 place count 108 transition count 165
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 127 place count 108 transition count 158
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 137 place count 98 transition count 140
Iterating global reduction 3 with 10 rules applied. Total rules applied 147 place count 98 transition count 140
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 154 place count 98 transition count 133
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 159 place count 93 transition count 127
Iterating global reduction 4 with 5 rules applied. Total rules applied 164 place count 93 transition count 127
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 168 place count 89 transition count 118
Iterating global reduction 4 with 4 rules applied. Total rules applied 172 place count 89 transition count 118
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 173 place count 89 transition count 117
Applied a total of 173 rules in 34 ms. Remains 89 /164 variables (removed 75) and now considering 117/274 (removed 157) transitions.
// Phase 1: matrix 117 rows 89 cols
[2024-05-21 21:14:56] [INFO ] Computed 2 invariants in 4 ms
[2024-05-21 21:14:56] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-21 21:14:56] [INFO ] Invariant cache hit.
[2024-05-21 21:14:56] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 21:14:56] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[2024-05-21 21:14:56] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-21 21:14:56] [INFO ] Invariant cache hit.
[2024-05-21 21:14:56] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/164 places, 117/274 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 298 ms. Remains : 89/164 places, 117/274 transitions.
Stuttering acceptance computed with spot in 67 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 23031 reset in 363 ms.
Product exploration explored 100000 steps with 23022 reset in 174 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.2 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 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 68 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2256 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 492 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 13 ms. (steps per millisecond=373 )
Probabilistic random walk after 4849 steps, saw 2265 distinct states, run finished after 14 ms. (steps per millisecond=346 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 105 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 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 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 10 ms. Remains 89 /89 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2024-05-21 21:14:57] [INFO ] Invariant cache hit.
[2024-05-21 21:14:58] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-21 21:14:58] [INFO ] Invariant cache hit.
[2024-05-21 21:14:58] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 21:14:58] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2024-05-21 21:14:58] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-21 21:14:58] [INFO ] Invariant cache hit.
[2024-05-21 21:14:58] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 265 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 72 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 91 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2328 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 465 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4849 steps, run visited all 1 properties in 18 ms. (steps per millisecond=269 )
Probabilistic random walk after 4849 steps, saw 2265 distinct states, run finished after 18 ms. (steps per millisecond=269 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 23006 reset in 111 ms.
Product exploration explored 100000 steps with 23012 reset in 143 ms.
Built C files in :
/tmp/ltsmin5595395052929055501
[2024-05-21 21:14:59] [INFO ] Computing symmetric may disable matrix : 117 transitions.
[2024-05-21 21:14:59] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:14:59] [INFO ] Computing symmetric may enable matrix : 117 transitions.
[2024-05-21 21:14:59] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:14:59] [INFO ] Computing Do-Not-Accords matrix : 117 transitions.
[2024-05-21 21:14:59] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:14:59] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5595395052929055501
Running compilation step : cd /tmp/ltsmin5595395052929055501;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 326 ms.
Running link step : cd /tmp/ltsmin5595395052929055501;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin5595395052929055501;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16529912787117812780.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 11 ms. Remains 89 /89 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2024-05-21 21:15:14] [INFO ] Invariant cache hit.
[2024-05-21 21:15:14] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-21 21:15:14] [INFO ] Invariant cache hit.
[2024-05-21 21:15:14] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 21:15:14] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2024-05-21 21:15:14] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-21 21:15:14] [INFO ] Invariant cache hit.
[2024-05-21 21:15:14] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 283 ms. Remains : 89/89 places, 117/117 transitions.
Built C files in :
/tmp/ltsmin82903100602200332
[2024-05-21 21:15:14] [INFO ] Computing symmetric may disable matrix : 117 transitions.
[2024-05-21 21:15:14] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:15:14] [INFO ] Computing symmetric may enable matrix : 117 transitions.
[2024-05-21 21:15:14] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:15:14] [INFO ] Computing Do-Not-Accords matrix : 117 transitions.
[2024-05-21 21:15:14] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:15:14] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin82903100602200332
Running compilation step : cd /tmp/ltsmin82903100602200332;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 241 ms.
Running link step : cd /tmp/ltsmin82903100602200332;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin82903100602200332;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9074802259565764973.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 21:15:29] [INFO ] Flatten gal took : 8 ms
[2024-05-21 21:15:29] [INFO ] Flatten gal took : 6 ms
[2024-05-21 21:15:29] [INFO ] Time to serialize gal into /tmp/LTL6759355697549680994.gal : 3 ms
[2024-05-21 21:15:29] [INFO ] Time to serialize properties into /tmp/LTL6294802136877602004.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6759355697549680994.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16707893872303177463.hoa' '-atoms' '/tmp/LTL6294802136877602004.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
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.
[2024-05-21 21:15:59] [INFO ] Flatten gal took : 6 ms
[2024-05-21 21:15:59] [INFO ] Applying decomposition
[2024-05-21 21:15:59] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11147863819309675815.txt' '-o' '/tmp/graph11147863819309675815.bin' '-w' '/tmp/graph11147863819309675815.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11147863819309675815.bin' '-l' '-1' '-v' '-w' '/tmp/graph11147863819309675815.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:15:59] [INFO ] Decomposing Gal with order
[2024-05-21 21:15:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:15:59] [INFO ] Removed a total of 123 redundant transitions.
[2024-05-21 21:15:59] [INFO ] Flatten gal took : 37 ms
[2024-05-21 21:15:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 93 labels/synchronizations in 7 ms.
[2024-05-21 21:15:59] [INFO ] Time to serialize gal into /tmp/LTL13314608846757582761.gal : 2 ms
[2024-05-21 21:15:59] [INFO ] Time to serialize properties into /tmp/LTL15590026945796314777.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13314608846757582761.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15590026945796314777.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(F("(((i0.u0.s1<1)||(i1.u16.l1224<1))||((i0.u0.s1>=1)&&(u10.l610>=1)))"))))
Formula 0 simplified : FG!"(((i0.u0.s1<1)||(i1.u16.l1224<1))||((i0.u0.s1>=1)&&(u10.l610>=1)))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16014238732717779061
[2024-05-21 21:16:14] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16014238732717779061
Running compilation step : cd /tmp/ltsmin16014238732717779061;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 197 ms.
Running link step : cd /tmp/ltsmin16014238732717779061;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin16014238732717779061;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-05 finished in 93488 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G(F(p1))))'
Support contains 3 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 274/274 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 141 transition count 216
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 141 transition count 216
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 51 place count 141 transition count 211
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 66 place count 126 transition count 188
Iterating global reduction 1 with 15 rules applied. Total rules applied 81 place count 126 transition count 188
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 84 place count 126 transition count 185
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 99 place count 111 transition count 166
Iterating global reduction 2 with 15 rules applied. Total rules applied 114 place count 111 transition count 166
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 120 place count 111 transition count 160
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 129 place count 102 transition count 146
Iterating global reduction 3 with 9 rules applied. Total rules applied 138 place count 102 transition count 146
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 145 place count 102 transition count 139
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 149 place count 98 transition count 134
Iterating global reduction 4 with 4 rules applied. Total rules applied 153 place count 98 transition count 134
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 156 place count 95 transition count 126
Iterating global reduction 4 with 3 rules applied. Total rules applied 159 place count 95 transition count 126
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 160 place count 95 transition count 125
Applied a total of 160 rules in 32 ms. Remains 95 /164 variables (removed 69) and now considering 125/274 (removed 149) transitions.
// Phase 1: matrix 125 rows 95 cols
[2024-05-21 21:16:30] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:16:30] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-21 21:16:30] [INFO ] Invariant cache hit.
[2024-05-21 21:16:30] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 21:16:30] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
[2024-05-21 21:16:30] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-21 21:16:30] [INFO ] Invariant cache hit.
[2024-05-21 21:16:30] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 95/164 places, 125/274 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 270 ms. Remains : 95/164 places, 125/274 transitions.
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s90 1)), p1:(AND (GEQ s1 1) (GEQ s87 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-06 finished in 460 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0 U (G(!p0)||(!p0&&G(!p1)))))))'
Support contains 4 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 274/274 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 140 transition count 208
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 140 transition count 208
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 51 place count 140 transition count 205
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 68 place count 123 transition count 180
Iterating global reduction 1 with 17 rules applied. Total rules applied 85 place count 123 transition count 180
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 88 place count 123 transition count 177
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 105 place count 106 transition count 155
Iterating global reduction 2 with 17 rules applied. Total rules applied 122 place count 106 transition count 155
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 129 place count 106 transition count 148
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 139 place count 96 transition count 131
Iterating global reduction 3 with 10 rules applied. Total rules applied 149 place count 96 transition count 131
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 154 place count 96 transition count 126
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 159 place count 91 transition count 120
Iterating global reduction 4 with 5 rules applied. Total rules applied 164 place count 91 transition count 120
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 167 place count 88 transition count 112
Iterating global reduction 4 with 3 rules applied. Total rules applied 170 place count 88 transition count 112
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 172 place count 88 transition count 110
Applied a total of 172 rules in 25 ms. Remains 88 /164 variables (removed 76) and now considering 110/274 (removed 164) transitions.
// Phase 1: matrix 110 rows 88 cols
[2024-05-21 21:16:30] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:16:30] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-21 21:16:30] [INFO ] Invariant cache hit.
[2024-05-21 21:16:30] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-21 21:16:30] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2024-05-21 21:16:30] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-21 21:16:30] [INFO ] Invariant cache hit.
[2024-05-21 21:16:30] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/164 places, 110/274 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 255 ms. Remains : 88/164 places, 110/274 transitions.
Stuttering acceptance computed with spot in 116 ms :[p0, p0, (AND p1 p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR p1 p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s84 1)), p0:(AND (GEQ s23 1) (GEQ s49 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 23030 reset in 144 ms.
Product exploration explored 100000 steps with 22942 reset in 145 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 298 edges and 88 vertex of which 87 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 116 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[p0, p0, (AND p0 p1)]
Incomplete random walk after 10000 steps, including 2313 resets, run finished after 329 ms. (steps per millisecond=30 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 482 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 521 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 978 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 464 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 481 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 1019 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 2218987 steps, run timeout after 3001 ms. (steps per millisecond=739 ) properties seen :{0=1, 1=1, 2=1, 3=1, 5=1}
Probabilistic random walk after 2218987 steps, saw 888675 distinct states, run finished after 3002 ms. (steps per millisecond=739 ) properties seen :5
Running SMT prover for 1 properties.
[2024-05-21 21:16:35] [INFO ] Invariant cache hit.
[2024-05-21 21:16:35] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 21:16:35] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 21:16:35] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1))), (F (OR p0 p1)), (F p0), (F (AND (NOT p0) p1))]
Knowledge based reduction with 10 factoid took 254 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[p0, p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 136 ms :[p0, p0, (AND p0 p1)]
Support contains 4 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 110/110 transitions.
Applied a total of 0 rules in 3 ms. Remains 88 /88 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2024-05-21 21:16:35] [INFO ] Invariant cache hit.
[2024-05-21 21:16:35] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-21 21:16:35] [INFO ] Invariant cache hit.
[2024-05-21 21:16:35] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-21 21:16:35] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2024-05-21 21:16:35] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-21 21:16:35] [INFO ] Invariant cache hit.
[2024-05-21 21:16:35] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 277 ms. Remains : 88/88 places, 110/110 transitions.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 298 edges and 88 vertex of which 87 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 110 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[p0, p0, (AND p0 p1)]
Incomplete random walk after 10000 steps, including 2287 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 474 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 476 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 979 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 484 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 969 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-21 21:16:36] [INFO ] Invariant cache hit.
[2024-05-21 21:16:36] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 21:16:36] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 21:16:36] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2024-05-21 21:16:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-21 21:16:36] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 21:16:36] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-05-21 21:16:36] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-21 21:16:36] [INFO ] After 28ms SMT Verify possible using 35 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2024-05-21 21:16:36] [INFO ] After 44ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 19 ms.
[2024-05-21 21:16:36] [INFO ] After 173ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 110/110 transitions.
Applied a total of 0 rules in 5 ms. Remains 88 /88 variables (removed 0) and now considering 110/110 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 88/88 places, 110/110 transitions.
Incomplete random walk after 10000 steps, including 2315 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 984 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 991 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Finished probabilistic random walk after 17656 steps, run visited all 2 properties in 74 ms. (steps per millisecond=238 )
Probabilistic random walk after 17656 steps, saw 8439 distinct states, run finished after 74 ms. (steps per millisecond=238 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1))), (F (OR p0 p1)), (F p0), (F (AND (NOT p0) p1))]
Knowledge based reduction with 10 factoid took 257 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[p0, p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 102 ms :[p0, p0, (AND p0 p1)]
Stuttering acceptance computed with spot in 122 ms :[p0, p0, (AND p0 p1)]
Product exploration explored 100000 steps with 23001 reset in 102 ms.
Product exploration explored 100000 steps with 22875 reset in 111 ms.
Built C files in :
/tmp/ltsmin8011008328772862554
[2024-05-21 21:16:37] [INFO ] Computing symmetric may disable matrix : 110 transitions.
[2024-05-21 21:16:37] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:16:37] [INFO ] Computing symmetric may enable matrix : 110 transitions.
[2024-05-21 21:16:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:16:37] [INFO ] Computing Do-Not-Accords matrix : 110 transitions.
[2024-05-21 21:16:37] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:16:37] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8011008328772862554
Running compilation step : cd /tmp/ltsmin8011008328772862554;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 238 ms.
Running link step : cd /tmp/ltsmin8011008328772862554;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin8011008328772862554;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17196592073929004175.hoa' '--buchi-type=spotba'
LTSmin run took 144 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-07 finished in 7587 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(F(G(!p0))||G(p1))))'
Support contains 3 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 274/274 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 141 transition count 208
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 141 transition count 208
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 49 place count 141 transition count 205
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 66 place count 124 transition count 180
Iterating global reduction 1 with 17 rules applied. Total rules applied 83 place count 124 transition count 180
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 86 place count 124 transition count 177
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 103 place count 107 transition count 156
Iterating global reduction 2 with 17 rules applied. Total rules applied 120 place count 107 transition count 156
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 127 place count 107 transition count 149
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 137 place count 97 transition count 132
Iterating global reduction 3 with 10 rules applied. Total rules applied 147 place count 97 transition count 132
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 150 place count 97 transition count 129
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 156 place count 91 transition count 122
Iterating global reduction 4 with 6 rules applied. Total rules applied 162 place count 91 transition count 122
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 166 place count 87 transition count 113
Iterating global reduction 4 with 4 rules applied. Total rules applied 170 place count 87 transition count 113
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 173 place count 87 transition count 110
Applied a total of 173 rules in 17 ms. Remains 87 /164 variables (removed 77) and now considering 110/274 (removed 164) transitions.
// Phase 1: matrix 110 rows 87 cols
[2024-05-21 21:16:38] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:16:38] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-21 21:16:38] [INFO ] Invariant cache hit.
[2024-05-21 21:16:38] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-21 21:16:38] [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.
[2024-05-21 21:16:38] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 21:16:38] [INFO ] Invariant cache hit.
[2024-05-21 21:16:38] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/164 places, 110/274 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 244 ms. Remains : 87/164 places, 110/274 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), p0, (AND p0 (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s27 1) (GEQ s34 1)), p1:(OR (LT s29 1) (LT s34 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 5 steps with 1 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-08 finished in 402 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 274/274 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 141 transition count 212
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 141 transition count 212
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 51 place count 141 transition count 207
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 66 place count 126 transition count 187
Iterating global reduction 1 with 15 rules applied. Total rules applied 81 place count 126 transition count 187
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 84 place count 126 transition count 184
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 100 place count 110 transition count 164
Iterating global reduction 2 with 16 rules applied. Total rules applied 116 place count 110 transition count 164
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 122 place count 110 transition count 158
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 131 place count 101 transition count 141
Iterating global reduction 3 with 9 rules applied. Total rules applied 140 place count 101 transition count 141
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 146 place count 101 transition count 135
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 151 place count 96 transition count 129
Iterating global reduction 4 with 5 rules applied. Total rules applied 156 place count 96 transition count 129
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 160 place count 92 transition count 120
Iterating global reduction 4 with 4 rules applied. Total rules applied 164 place count 92 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 165 place count 92 transition count 119
Applied a total of 165 rules in 17 ms. Remains 92 /164 variables (removed 72) and now considering 119/274 (removed 155) transitions.
// Phase 1: matrix 119 rows 92 cols
[2024-05-21 21:16:38] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 21:16:38] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-21 21:16:38] [INFO ] Invariant cache hit.
[2024-05-21 21:16:38] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-21 21:16:38] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2024-05-21 21:16:38] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 21:16:38] [INFO ] Invariant cache hit.
[2024-05-21 21:16:38] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 92/164 places, 119/274 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 265 ms. Remains : 92/164 places, 119/274 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-10 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 s32 1) (LT s58 1) (AND (GEQ s1 1) (GEQ s86 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 22993 reset in 100 ms.
Product exploration explored 100000 steps with 22958 reset in 107 ms.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 314 edges and 92 vertex of which 91 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 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 56 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2261 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 965 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 22065 steps, run visited all 1 properties in 35 ms. (steps per millisecond=630 )
Probabilistic random walk after 22065 steps, saw 10069 distinct states, run finished after 35 ms. (steps per millisecond=630 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 90 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 55 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 92 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 92/92 places, 119/119 transitions.
Applied a total of 0 rules in 4 ms. Remains 92 /92 variables (removed 0) and now considering 119/119 (removed 0) transitions.
[2024-05-21 21:16:39] [INFO ] Invariant cache hit.
[2024-05-21 21:16:39] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 21:16:39] [INFO ] Invariant cache hit.
[2024-05-21 21:16:39] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-21 21:16:39] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2024-05-21 21:16:39] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 21:16:39] [INFO ] Invariant cache hit.
[2024-05-21 21:16:39] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 255 ms. Remains : 92/92 places, 119/119 transitions.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 314 edges and 92 vertex of which 91 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 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 2305 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 933 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 22065 steps, run visited all 1 properties in 33 ms. (steps per millisecond=668 )
Probabilistic random walk after 22065 steps, saw 10069 distinct states, run finished after 33 ms. (steps per millisecond=668 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 103 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 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 23029 reset in 102 ms.
Product exploration explored 100000 steps with 23040 reset in 129 ms.
Built C files in :
/tmp/ltsmin7373545988869547736
[2024-05-21 21:16:40] [INFO ] Computing symmetric may disable matrix : 119 transitions.
[2024-05-21 21:16:40] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:16:40] [INFO ] Computing symmetric may enable matrix : 119 transitions.
[2024-05-21 21:16:40] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:16:40] [INFO ] Computing Do-Not-Accords matrix : 119 transitions.
[2024-05-21 21:16:40] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:16:40] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7373545988869547736
Running compilation step : cd /tmp/ltsmin7373545988869547736;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 239 ms.
Running link step : cd /tmp/ltsmin7373545988869547736;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin7373545988869547736;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4769260505126694903.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 92 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 92/92 places, 119/119 transitions.
Applied a total of 0 rules in 14 ms. Remains 92 /92 variables (removed 0) and now considering 119/119 (removed 0) transitions.
[2024-05-21 21:16:55] [INFO ] Invariant cache hit.
[2024-05-21 21:16:55] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-21 21:16:55] [INFO ] Invariant cache hit.
[2024-05-21 21:16:55] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-21 21:16:55] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2024-05-21 21:16:55] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 21:16:55] [INFO ] Invariant cache hit.
[2024-05-21 21:16:55] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 259 ms. Remains : 92/92 places, 119/119 transitions.
Built C files in :
/tmp/ltsmin14779334698381346678
[2024-05-21 21:16:55] [INFO ] Computing symmetric may disable matrix : 119 transitions.
[2024-05-21 21:16:55] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:16:55] [INFO ] Computing symmetric may enable matrix : 119 transitions.
[2024-05-21 21:16:55] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:16:55] [INFO ] Computing Do-Not-Accords matrix : 119 transitions.
[2024-05-21 21:16:55] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:16:55] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14779334698381346678
Running compilation step : cd /tmp/ltsmin14779334698381346678;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 244 ms.
Running link step : cd /tmp/ltsmin14779334698381346678;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin14779334698381346678;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14681156403253034936.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 21:17:11] [INFO ] Flatten gal took : 7 ms
[2024-05-21 21:17:11] [INFO ] Flatten gal took : 6 ms
[2024-05-21 21:17:11] [INFO ] Time to serialize gal into /tmp/LTL5073436566320178405.gal : 2 ms
[2024-05-21 21:17:11] [INFO ] Time to serialize properties into /tmp/LTL14868602667228544721.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5073436566320178405.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7412845948330445765.hoa' '-atoms' '/tmp/LTL14868602667228544721.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("(((i0.u7.p114<1)||(i0.u7.l506<1))||((i0.u0.s1>=1)&&(i6.u17.l1224>=1)))"))))
Formula 0 simplified : FG!"(((i0.u7.p114<1)||(i0.u7.l506<1))||((i0.u0.s1>=1)&&(i6.u17.l1224>=1)))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6300064650427335386
[2024-05-21 21:17:56] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6300064650427335386
Running compilation step : cd /tmp/ltsmin6300064650427335386;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 211 ms.
Running link step : cd /tmp/ltsmin6300064650427335386;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin6300064650427335386;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-10 finished in 92945 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G((p0||X(G(p1))))) U G(p2)))'
Support contains 5 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 274/274 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 142 transition count 214
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 142 transition count 214
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 47 place count 142 transition count 211
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 62 place count 127 transition count 191
Iterating global reduction 1 with 15 rules applied. Total rules applied 77 place count 127 transition count 191
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 80 place count 127 transition count 188
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 96 place count 111 transition count 167
Iterating global reduction 2 with 16 rules applied. Total rules applied 112 place count 111 transition count 167
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 119 place count 111 transition count 160
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 127 place count 103 transition count 145
Iterating global reduction 3 with 8 rules applied. Total rules applied 135 place count 103 transition count 145
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 138 place count 103 transition count 142
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 142 place count 99 transition count 137
Iterating global reduction 4 with 4 rules applied. Total rules applied 146 place count 99 transition count 137
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 149 place count 96 transition count 129
Iterating global reduction 4 with 3 rules applied. Total rules applied 152 place count 96 transition count 129
Applied a total of 152 rules in 7 ms. Remains 96 /164 variables (removed 68) and now considering 129/274 (removed 145) transitions.
// Phase 1: matrix 129 rows 96 cols
[2024-05-21 21:18:11] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:18:11] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-21 21:18:11] [INFO ] Invariant cache hit.
[2024-05-21 21:18:11] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 21:18:11] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2024-05-21 21:18:11] [INFO ] Invariant cache hit.
[2024-05-21 21:18:11] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 96/164 places, 129/274 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 280 ms. Remains : 96/164 places, 129/274 transitions.
Stuttering acceptance computed with spot in 258 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(AND p2 p0), acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) p0 p1), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p2 p0 p1), acceptance={} source=5 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={} source=6 dest: 4}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s77 1)), p0:(AND (GEQ s1 1) (GEQ s93 1)), p1:(AND (GEQ s36 1) (GEQ s60 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-11 finished in 581 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((G(F(p0)) U p1)||X(F(p2)))))'
Support contains 3 out of 164 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 274/274 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 142 transition count 213
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 142 transition count 213
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 48 place count 142 transition count 209
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 63 place count 127 transition count 186
Iterating global reduction 1 with 15 rules applied. Total rules applied 78 place count 127 transition count 186
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 80 place count 127 transition count 184
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 96 place count 111 transition count 163
Iterating global reduction 2 with 16 rules applied. Total rules applied 112 place count 111 transition count 163
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 118 place count 111 transition count 157
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 127 place count 102 transition count 142
Iterating global reduction 3 with 9 rules applied. Total rules applied 136 place count 102 transition count 142
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 140 place count 102 transition count 138
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 146 place count 96 transition count 131
Iterating global reduction 4 with 6 rules applied. Total rules applied 152 place count 96 transition count 131
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 156 place count 92 transition count 122
Iterating global reduction 4 with 4 rules applied. Total rules applied 160 place count 92 transition count 122
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 162 place count 92 transition count 120
Applied a total of 162 rules in 12 ms. Remains 92 /164 variables (removed 72) and now considering 120/274 (removed 154) transitions.
// Phase 1: matrix 120 rows 92 cols
[2024-05-21 21:18:12] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 21:18:12] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-21 21:18:12] [INFO ] Invariant cache hit.
[2024-05-21 21:18:12] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-21 21:18:12] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2024-05-21 21:18:12] [INFO ] Invariant cache hit.
[2024-05-21 21:18:12] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 92/164 places, 120/274 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 256 ms. Remains : 92/164 places, 120/274 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s82 1)), p2:(AND (GEQ s1 1) (GEQ s53 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-12 finished in 353 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(!p1)||p0)))'
Support contains 4 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 274/274 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 141 transition count 208
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 141 transition count 208
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 50 place count 141 transition count 204
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 66 place count 125 transition count 180
Iterating global reduction 1 with 16 rules applied. Total rules applied 82 place count 125 transition count 180
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 85 place count 125 transition count 177
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 102 place count 108 transition count 156
Iterating global reduction 2 with 17 rules applied. Total rules applied 119 place count 108 transition count 156
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 125 place count 108 transition count 150
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 135 place count 98 transition count 132
Iterating global reduction 3 with 10 rules applied. Total rules applied 145 place count 98 transition count 132
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 150 place count 98 transition count 127
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 155 place count 93 transition count 121
Iterating global reduction 4 with 5 rules applied. Total rules applied 160 place count 93 transition count 121
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 164 place count 89 transition count 112
Iterating global reduction 4 with 4 rules applied. Total rules applied 168 place count 89 transition count 112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 169 place count 89 transition count 111
Applied a total of 169 rules in 13 ms. Remains 89 /164 variables (removed 75) and now considering 111/274 (removed 163) transitions.
// Phase 1: matrix 111 rows 89 cols
[2024-05-21 21:18:12] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 21:18:12] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-21 21:18:12] [INFO ] Invariant cache hit.
[2024-05-21 21:18:12] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-21 21:18:12] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2024-05-21 21:18:12] [INFO ] Invariant cache hit.
[2024-05-21 21:18:12] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 89/164 places, 111/274 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 248 ms. Remains : 89/164 places, 111/274 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (AND (NOT p0) p1), p1]
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s1 1) (LT s87 1)), p1:(AND (GEQ s28 1) (GEQ s35 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][false, false, false]]
Product exploration explored 100000 steps with 22834 reset in 145 ms.
Product exploration explored 100000 steps with 22893 reset in 131 ms.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 301 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 12 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), true, (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 116 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[true, (AND (NOT p0) p1), p1]
Incomplete random walk after 10000 steps, including 2290 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 491 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 469 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-21 21:18:13] [INFO ] Invariant cache hit.
[2024-05-21 21:18:13] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-21 21:18:13] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-21 21:18:13] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 21:18:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 21:18:13] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 21:18:13] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 21:18:13] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-21 21:18:13] [INFO ] After 26ms SMT Verify possible using 34 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 21:18:13] [INFO ] After 59ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 27 ms.
[2024-05-21 21:18:13] [INFO ] After 164ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 11 ms.
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 111/111 transitions.
Graph (complete) has 278 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 88 transition count 109
Applied a total of 3 rules in 4 ms. Remains 88 /89 variables (removed 1) and now considering 109/111 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 88/89 places, 109/111 transitions.
Incomplete random walk after 10000 steps, including 2308 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 451 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 483 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Finished probabilistic random walk after 18613 steps, run visited all 2 properties in 113 ms. (steps per millisecond=164 )
Probabilistic random walk after 18613 steps, saw 8891 distinct states, run finished after 114 ms. (steps per millisecond=163 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), true, (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F p1)]
Knowledge based reduction with 10 factoid took 290 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[true, (AND (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 105 ms :[true, (AND (NOT p0) p1), p1]
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 111/111 transitions.
Applied a total of 0 rules in 1 ms. Remains 89 /89 variables (removed 0) and now considering 111/111 (removed 0) transitions.
[2024-05-21 21:18:14] [INFO ] Invariant cache hit.
[2024-05-21 21:18:14] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 21:18:14] [INFO ] Invariant cache hit.
[2024-05-21 21:18:14] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-21 21:18:14] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2024-05-21 21:18:14] [INFO ] Invariant cache hit.
[2024-05-21 21:18:14] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 217 ms. Remains : 89/89 places, 111/111 transitions.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 301 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 12 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), true, (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 86 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[true, (AND (NOT p0) p1), p1]
Incomplete random walk after 10000 steps, including 2315 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 457 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 488 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-21 21:18:15] [INFO ] Invariant cache hit.
[2024-05-21 21:18:15] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 21:18:15] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 21:18:15] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 21:18:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 21:18:15] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 21:18:15] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 21:18:15] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-21 21:18:15] [INFO ] After 27ms SMT Verify possible using 34 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 21:18:15] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 33 ms.
[2024-05-21 21:18:15] [INFO ] After 171ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 111/111 transitions.
Graph (complete) has 278 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 88 transition count 109
Applied a total of 3 rules in 5 ms. Remains 88 /89 variables (removed 1) and now considering 109/111 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 88/89 places, 109/111 transitions.
Incomplete random walk after 10000 steps, including 2319 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 424 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 450 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Finished probabilistic random walk after 18613 steps, run visited all 2 properties in 97 ms. (steps per millisecond=191 )
Probabilistic random walk after 18613 steps, saw 8891 distinct states, run finished after 97 ms. (steps per millisecond=191 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), true, (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F p1)]
Knowledge based reduction with 10 factoid took 198 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 81 ms :[true, (AND (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 69 ms :[true, (AND (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 85 ms :[true, (AND (NOT p0) p1), p1]
Product exploration explored 100000 steps with 22985 reset in 110 ms.
Product exploration explored 100000 steps with 23020 reset in 114 ms.
Built C files in :
/tmp/ltsmin3288174510156949898
[2024-05-21 21:18:16] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3288174510156949898
Running compilation step : cd /tmp/ltsmin3288174510156949898;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 195 ms.
Running link step : cd /tmp/ltsmin3288174510156949898;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin3288174510156949898;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8221613404943347430.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 111/111 transitions.
Applied a total of 0 rules in 4 ms. Remains 89 /89 variables (removed 0) and now considering 111/111 (removed 0) transitions.
[2024-05-21 21:18:31] [INFO ] Invariant cache hit.
[2024-05-21 21:18:31] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-21 21:18:31] [INFO ] Invariant cache hit.
[2024-05-21 21:18:31] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-21 21:18:31] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2024-05-21 21:18:31] [INFO ] Invariant cache hit.
[2024-05-21 21:18:31] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 245 ms. Remains : 89/89 places, 111/111 transitions.
Built C files in :
/tmp/ltsmin16072011948679183777
[2024-05-21 21:18:31] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16072011948679183777
Running compilation step : cd /tmp/ltsmin16072011948679183777;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 200 ms.
Running link step : cd /tmp/ltsmin16072011948679183777;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin16072011948679183777;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15300864883271970185.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 21:18:46] [INFO ] Flatten gal took : 7 ms
[2024-05-21 21:18:46] [INFO ] Flatten gal took : 4 ms
[2024-05-21 21:18:46] [INFO ] Time to serialize gal into /tmp/LTL7918695502745616600.gal : 2 ms
[2024-05-21 21:18:46] [INFO ] Time to serialize properties into /tmp/LTL5754705551511551827.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7918695502745616600.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18247155726646188003.hoa' '-atoms' '/tmp/LTL5754705551511551827.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL5754705551511551827.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18247155726646188003.hoa
Detected timeout of ITS tools.
[2024-05-21 21:19:01] [INFO ] Flatten gal took : 5 ms
[2024-05-21 21:19:01] [INFO ] Flatten gal took : 5 ms
[2024-05-21 21:19:01] [INFO ] Time to serialize gal into /tmp/LTL6789039967669878989.gal : 1 ms
[2024-05-21 21:19:01] [INFO ] Time to serialize properties into /tmp/LTL10272269014753201749.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6789039967669878989.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10272269014753201749.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(("((s1<1)||(l1293<1))")||(X("((p94<1)||(l0<1))")))))
Formula 0 simplified : F(!"((s1<1)||(l1293<1))" & X!"((p94<1)||(l0<1))")
Detected timeout of ITS tools.
[2024-05-21 21:19:17] [INFO ] Flatten gal took : 8 ms
[2024-05-21 21:19:17] [INFO ] Applying decomposition
[2024-05-21 21:19:17] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph14689608821231119234.txt' '-o' '/tmp/graph14689608821231119234.bin' '-w' '/tmp/graph14689608821231119234.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14689608821231119234.bin' '-l' '-1' '-v' '-w' '/tmp/graph14689608821231119234.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:19:17] [INFO ] Decomposing Gal with order
[2024-05-21 21:19:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:19:17] [INFO ] Removed a total of 111 redundant transitions.
[2024-05-21 21:19:17] [INFO ] Flatten gal took : 10 ms
[2024-05-21 21:19:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 79 labels/synchronizations in 3 ms.
[2024-05-21 21:19:17] [INFO ] Time to serialize gal into /tmp/LTL10688849156356298899.gal : 20 ms
[2024-05-21 21:19:17] [INFO ] Time to serialize properties into /tmp/LTL17337468644281762387.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10688849156356298899.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17337468644281762387.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(("((i3.u0.s1<1)||(i4.u6.l1293<1))")||(X("((i3.u12.p94<1)||(i3.u0.l0<1))")))))
Formula 0 simplified : F(!"((i3.u0.s1<1)||(i4.u6.l1293<1))" & X!"((i3.u12.p94<1)||(i3.u0.l0<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5386055909963262173
[2024-05-21 21:19:32] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5386055909963262173
Running compilation step : cd /tmp/ltsmin5386055909963262173;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 191 ms.
Running link step : cd /tmp/ltsmin5386055909963262173;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin5386055909963262173;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((X((LTLAPp1==true))||(LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-15 finished in 94936 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(!p1)||p0)))'
Found a Lengthening insensitive property : DBSingleClientW-PT-d1m09-LTLFireability-15
Stuttering acceptance computed with spot in 110 ms :[true, (AND (NOT p0) p1), p1]
Support contains 4 out of 164 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 164/164 places, 274/274 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 141 transition count 208
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 141 transition count 208
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 50 place count 141 transition count 204
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 66 place count 125 transition count 180
Iterating global reduction 1 with 16 rules applied. Total rules applied 82 place count 125 transition count 180
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 85 place count 125 transition count 177
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 102 place count 108 transition count 156
Iterating global reduction 2 with 17 rules applied. Total rules applied 119 place count 108 transition count 156
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 125 place count 108 transition count 150
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 135 place count 98 transition count 132
Iterating global reduction 3 with 10 rules applied. Total rules applied 145 place count 98 transition count 132
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 150 place count 98 transition count 127
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 155 place count 93 transition count 121
Iterating global reduction 4 with 5 rules applied. Total rules applied 160 place count 93 transition count 121
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 164 place count 89 transition count 112
Iterating global reduction 4 with 4 rules applied. Total rules applied 168 place count 89 transition count 112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 169 place count 89 transition count 111
Applied a total of 169 rules in 12 ms. Remains 89 /164 variables (removed 75) and now considering 111/274 (removed 163) transitions.
[2024-05-21 21:19:47] [INFO ] Invariant cache hit.
[2024-05-21 21:19:47] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-21 21:19:47] [INFO ] Invariant cache hit.
[2024-05-21 21:19:47] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-21 21:19:47] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
[2024-05-21 21:19:47] [INFO ] Invariant cache hit.
[2024-05-21 21:19:47] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 89/164 places, 111/274 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 323 ms. Remains : 89/164 places, 111/274 transitions.
Running random walk in product with property : DBSingleClientW-PT-d1m09-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s1 1) (LT s87 1)), p1:(AND (GEQ s28 1) (GEQ s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 22913 reset in 102 ms.
Product exploration explored 100000 steps with 22956 reset in 108 ms.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 301 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 12 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), true, (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 106 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 72 ms :[true, (AND (NOT p0) p1), p1]
Incomplete random walk after 10000 steps, including 2300 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 491 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 510 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-21 21:19:48] [INFO ] Invariant cache hit.
[2024-05-21 21:19:48] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-21 21:19:48] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 21:19:48] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 21:19:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-21 21:19:48] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 21:19:48] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 21:19:48] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-21 21:19:48] [INFO ] After 27ms SMT Verify possible using 34 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 21:19:48] [INFO ] After 61ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 27 ms.
[2024-05-21 21:19:48] [INFO ] After 161ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 8 ms.
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 111/111 transitions.
Graph (complete) has 278 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 88 transition count 109
Applied a total of 3 rules in 5 ms. Remains 88 /89 variables (removed 1) and now considering 109/111 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 88/89 places, 109/111 transitions.
Incomplete random walk after 10000 steps, including 2319 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 480 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 477 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Finished probabilistic random walk after 18613 steps, run visited all 2 properties in 69 ms. (steps per millisecond=269 )
Probabilistic random walk after 18613 steps, saw 8891 distinct states, run finished after 69 ms. (steps per millisecond=269 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), true, (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F p1)]
Knowledge based reduction with 10 factoid took 281 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 74 ms :[true, (AND (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 84 ms :[true, (AND (NOT p0) p1), p1]
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 111/111 transitions.
Applied a total of 0 rules in 2 ms. Remains 89 /89 variables (removed 0) and now considering 111/111 (removed 0) transitions.
[2024-05-21 21:19:49] [INFO ] Invariant cache hit.
[2024-05-21 21:19:49] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-21 21:19:49] [INFO ] Invariant cache hit.
[2024-05-21 21:19:49] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-21 21:19:49] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2024-05-21 21:19:49] [INFO ] Invariant cache hit.
[2024-05-21 21:19:49] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 231 ms. Remains : 89/89 places, 111/111 transitions.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 301 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), true, (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 93 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 85 ms :[true, (AND (NOT p0) p1), p1]
Incomplete random walk after 10000 steps, including 2309 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 482 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 499 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-21 21:19:50] [INFO ] Invariant cache hit.
[2024-05-21 21:19:50] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-21 21:19:50] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-21 21:19:50] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 21:19:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 21:19:50] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 21:19:50] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 21:19:50] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-21 21:19:50] [INFO ] After 27ms SMT Verify possible using 34 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-21 21:19:50] [INFO ] After 65ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 30 ms.
[2024-05-21 21:19:50] [INFO ] After 174ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 9 ms.
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 111/111 transitions.
Graph (complete) has 278 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 88 transition count 109
Applied a total of 3 rules in 3 ms. Remains 88 /89 variables (removed 1) and now considering 109/111 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 88/89 places, 109/111 transitions.
Incomplete random walk after 10000 steps, including 2279 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 493 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 465 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Finished probabilistic random walk after 18613 steps, run visited all 2 properties in 98 ms. (steps per millisecond=189 )
Probabilistic random walk after 18613 steps, saw 8891 distinct states, run finished after 98 ms. (steps per millisecond=189 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), true, (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1)))), (F p1)]
Knowledge based reduction with 10 factoid took 189 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 83 ms :[true, (AND (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 69 ms :[true, (AND (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 96 ms :[true, (AND (NOT p0) p1), p1]
Product exploration explored 100000 steps with 23074 reset in 108 ms.
Product exploration explored 100000 steps with 23025 reset in 106 ms.
Built C files in :
/tmp/ltsmin14652334206082904242
[2024-05-21 21:19:51] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14652334206082904242
Running compilation step : cd /tmp/ltsmin14652334206082904242;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 199 ms.
Running link step : cd /tmp/ltsmin14652334206082904242;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin14652334206082904242;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15081431787579938021.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 111/111 transitions.
Applied a total of 0 rules in 2 ms. Remains 89 /89 variables (removed 0) and now considering 111/111 (removed 0) transitions.
[2024-05-21 21:20:06] [INFO ] Invariant cache hit.
[2024-05-21 21:20:06] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-21 21:20:06] [INFO ] Invariant cache hit.
[2024-05-21 21:20:06] [INFO ] State equation strengthened by 34 read => feed constraints.
[2024-05-21 21:20:06] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2024-05-21 21:20:06] [INFO ] Invariant cache hit.
[2024-05-21 21:20:06] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 274 ms. Remains : 89/89 places, 111/111 transitions.
Built C files in :
/tmp/ltsmin3327580506642834574
[2024-05-21 21:20:06] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3327580506642834574
Running compilation step : cd /tmp/ltsmin3327580506642834574;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 201 ms.
Running link step : cd /tmp/ltsmin3327580506642834574;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin3327580506642834574;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11364091937459219114.hoa' '--buchi-type=spotba'
LTSmin run took 2760 ms.
Treatment of property DBSingleClientW-PT-d1m09-LTLFireability-15 finished in 22263 ms.
FORMULA DBSingleClientW-PT-d1m09-LTLFireability-15 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-05-21 21:20:09] [INFO ] Flatten gal took : 11 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1419603671599863680
[2024-05-21 21:20:09] [INFO ] Computing symmetric may disable matrix : 274 transitions.
[2024-05-21 21:20:09] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:20:09] [INFO ] Applying decomposition
[2024-05-21 21:20:09] [INFO ] Computing symmetric may enable matrix : 274 transitions.
[2024-05-21 21:20:09] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:20:09] [INFO ] Flatten gal took : 10 ms
[2024-05-21 21:20:09] [INFO ] Computing Do-Not-Accords matrix : 274 transitions.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph4506576346794919403.txt' '-o' '/tmp/graph4506576346794919403.bin' '-w' '/tmp/graph4506576346794919403.weights'
[2024-05-21 21:20:09] [INFO ] Computation of Completed DNA matrix. took 23 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:20:09] [INFO ] Built C files in 79ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1419603671599863680
Running compilation step : cd /tmp/ltsmin1419603671599863680;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4506576346794919403.bin' '-l' '-1' '-v' '-w' '/tmp/graph4506576346794919403.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:20:09] [INFO ] Decomposing Gal with order
[2024-05-21 21:20:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:20:09] [INFO ] Removed a total of 322 redundant transitions.
[2024-05-21 21:20:09] [INFO ] Flatten gal took : 27 ms
[2024-05-21 21:20:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 224 labels/synchronizations in 14 ms.
[2024-05-21 21:20:09] [INFO ] Time to serialize gal into /tmp/LTLFireability628736909470775097.gal : 2 ms
[2024-05-21 21:20:09] [INFO ] Time to serialize properties into /tmp/LTLFireability11851244871884601726.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability628736909470775097.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11851244871884601726.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 2 LTL properties
Checking formula 0 : !((G(F("(((i0.u0.s1<1)||(i6.u18.l1224<1))||((i0.u0.s1>=1)&&(i3.u6.l610>=1)))"))))
Formula 0 simplified : FG!"(((i0.u0.s1<1)||(i6.u18.l1224<1))||((i0.u0.s1>=1)&&(i3.u6.l610>=1)))"
Compilation finished in 593 ms.
Running link step : cd /tmp/ltsmin1419603671599863680;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin1419603671599863680;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-21 21:41:57] [INFO ] Flatten gal took : 29 ms
[2024-05-21 21:41:57] [INFO ] Time to serialize gal into /tmp/LTLFireability16376893802123629825.gal : 2 ms
[2024-05-21 21:41:57] [INFO ] Time to serialize properties into /tmp/LTLFireability7562762880858098667.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16376893802123629825.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7562762880858098667.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 2 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)))"
WARNING : LTSmin timed out (>1800 s) on command cd /tmp/ltsmin1419603671599863680;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin1419603671599863680;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp1==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-21 22:03:45] [INFO ] Flatten gal took : 18 ms
[2024-05-21 22:03:45] [INFO ] Input system was already deterministic with 274 transitions.
[2024-05-21 22:03:45] [INFO ] Transformed 164 places.
[2024-05-21 22:03:45] [INFO ] Transformed 274 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-21 22:03:45] [INFO ] Time to serialize gal into /tmp/LTLFireability7585759542605878331.gal : 2 ms
[2024-05-21 22:03:45] [INFO ] Time to serialize properties into /tmp/LTLFireability14254169657512840602.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7585759542605878331.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14254169657512840602.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 2 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)))"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 11138748 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16040700 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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is DBSingleClientW-PT-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 r109-tall-171624208300333"
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 ;