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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.5K 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 4.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 12:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Apr 12 12:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 12 12:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 12 12:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.6M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716327587129

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-d2m04
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-21 21:39:48] [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:39:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 21:39:48] [INFO ] Load time of PNML (sax parser for PT used): 350 ms
[2024-05-21 21:39:49] [INFO ] Transformed 4763 places.
[2024-05-21 21:39:49] [INFO ] Transformed 2478 transitions.
[2024-05-21 21:39:49] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 443 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 3580 places in 16 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 0 with 245 rules applied. Total rules applied 245 place count 1137 transition count 2279
Discarding 379 places :
Symmetric choice reduction at 1 with 379 rule applications. Total rules 624 place count 758 transition count 1346
Iterating global reduction 1 with 379 rules applied. Total rules applied 1003 place count 758 transition count 1346
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 1043 place count 758 transition count 1306
Discarding 304 places :
Symmetric choice reduction at 2 with 304 rule applications. Total rules 1347 place count 454 transition count 1002
Iterating global reduction 2 with 304 rules applied. Total rules applied 1651 place count 454 transition count 1002
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1663 place count 454 transition count 990
Discarding 225 places :
Symmetric choice reduction at 3 with 225 rule applications. Total rules 1888 place count 229 transition count 672
Iterating global reduction 3 with 225 rules applied. Total rules applied 2113 place count 229 transition count 672
Ensure Unique test removed 229 transitions
Reduce isomorphic transitions removed 229 transitions.
Iterating post reduction 3 with 229 rules applied. Total rules applied 2342 place count 229 transition count 443
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 2363 place count 208 transition count 410
Iterating global reduction 4 with 21 rules applied. Total rules applied 2384 place count 208 transition count 410
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 4 with 25 rules applied. Total rules applied 2409 place count 208 transition count 385
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 2419 place count 198 transition count 375
Iterating global reduction 5 with 10 rules applied. Total rules applied 2429 place count 198 transition count 375
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2433 place count 198 transition count 371
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 2440 place count 191 transition count 364
Iterating global reduction 6 with 7 rules applied. Total rules applied 2447 place count 191 transition count 364
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 2453 place count 191 transition count 358
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 2454 place count 190 transition count 356
Iterating global reduction 7 with 1 rules applied. Total rules applied 2455 place count 190 transition count 356
Applied a total of 2455 rules in 211 ms. Remains 190 /1183 variables (removed 993) and now considering 356/2478 (removed 2122) transitions.
// Phase 1: matrix 356 rows 190 cols
[2024-05-21 21:39:49] [INFO ] Computed 2 invariants in 25 ms
[2024-05-21 21:39:49] [INFO ] Implicit Places using invariants in 285 ms returned []
[2024-05-21 21:39:49] [INFO ] Invariant cache hit.
[2024-05-21 21:39:49] [INFO ] State equation strengthened by 178 read => feed constraints.
[2024-05-21 21:39:50] [INFO ] Implicit Places using invariants and state equation in 632 ms returned []
Implicit Place search using SMT with State Equation took 941 ms to find 0 implicit places.
[2024-05-21 21:39:50] [INFO ] Invariant cache hit.
[2024-05-21 21:39:50] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 190/1183 places, 356/2478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1295 ms. Remains : 190/1183 places, 356/2478 transitions.
Support contains 30 out of 190 places after structural reductions.
[2024-05-21 21:39:50] [INFO ] Flatten gal took : 51 ms
[2024-05-21 21:39:50] [INFO ] Flatten gal took : 24 ms
[2024-05-21 21:39:50] [INFO ] Input system was already deterministic with 356 transitions.
Incomplete random walk after 10000 steps, including 2320 resets, run finished after 491 ms. (steps per millisecond=20 ) properties (out of 25) seen :2
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 95 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 113 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 200 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 38 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 38 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 93 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 36 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 37 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 100 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 42 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 101 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Probably explored full state space saw : 69653 states, properties seen :21
Probabilistic random walk after 178501 steps, saw 69653 distinct states, run finished after 1413 ms. (steps per millisecond=126 ) properties seen :21
Explored full state space saw : 69797 states, properties seen :0
Exhaustive walk after 178694 steps, saw 69797 distinct states, run finished after 695 ms. (steps per millisecond=257 ) properties seen :0
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
Computed a total of 5 stabilizing places and 28 stable transitions
Graph (complete) has 744 edges and 190 vertex of which 189 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0&&X(p1)))||F(G(p2))))'
Support contains 5 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 356/356 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 170 transition count 297
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 170 transition count 297
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 47 place count 170 transition count 290
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 61 place count 156 transition count 269
Iterating global reduction 1 with 14 rules applied. Total rules applied 75 place count 156 transition count 269
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 78 place count 156 transition count 266
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 88 place count 146 transition count 251
Iterating global reduction 2 with 10 rules applied. Total rules applied 98 place count 146 transition count 251
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 106 place count 146 transition count 243
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 113 place count 139 transition count 208
Iterating global reduction 3 with 7 rules applied. Total rules applied 120 place count 139 transition count 208
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 121 place count 139 transition count 207
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 123 place count 137 transition count 205
Iterating global reduction 4 with 2 rules applied. Total rules applied 125 place count 137 transition count 205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 126 place count 137 transition count 204
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 127 place count 136 transition count 203
Iterating global reduction 5 with 1 rules applied. Total rules applied 128 place count 136 transition count 203
Applied a total of 128 rules in 22 ms. Remains 136 /190 variables (removed 54) and now considering 203/356 (removed 153) transitions.
// Phase 1: matrix 203 rows 136 cols
[2024-05-21 21:39:54] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:39:54] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-21 21:39:54] [INFO ] Invariant cache hit.
[2024-05-21 21:39:54] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-05-21 21:39:54] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
[2024-05-21 21:39:54] [INFO ] Invariant cache hit.
[2024-05-21 21:39:54] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 136/190 places, 203/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 517 ms. Remains : 136/190 places, 203/356 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 227 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : DBSingleClientW-PT-d2m04-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s97 1)), p2:(OR (LT s1 1) (LT s130 1)), p1:(OR (LT s45 1) (LT s77 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 22880 reset in 321 ms.
Product exploration explored 100000 steps with 23006 reset in 227 ms.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 498 edges and 136 vertex of which 135 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X p2)), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 98 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Incomplete random walk after 10000 steps, including 2307 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 418 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 475 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 421 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Finished probabilistic random walk after 23147 steps, run visited all 3 properties in 106 ms. (steps per millisecond=218 )
Probabilistic random walk after 23147 steps, saw 10320 distinct states, run finished after 107 ms. (steps per millisecond=216 ) properties seen :3
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X p2)), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (NOT p2)), (F (OR (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 249 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Stuttering acceptance computed with spot in 78 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Support contains 5 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 203/203 transitions.
Applied a total of 0 rules in 23 ms. Remains 136 /136 variables (removed 0) and now considering 203/203 (removed 0) transitions.
[2024-05-21 21:39:56] [INFO ] Invariant cache hit.
[2024-05-21 21:39:56] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-21 21:39:56] [INFO ] Invariant cache hit.
[2024-05-21 21:39:56] [INFO ] State equation strengthened by 70 read => feed constraints.
[2024-05-21 21:39:56] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
[2024-05-21 21:39:56] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-21 21:39:56] [INFO ] Invariant cache hit.
[2024-05-21 21:39:56] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 609 ms. Remains : 136/136 places, 203/203 transitions.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 498 edges and 136 vertex of which 135 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X p2)), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 103 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Incomplete random walk after 10000 steps, including 2295 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 441 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 463 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 446 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Finished probabilistic random walk after 23147 steps, run visited all 3 properties in 150 ms. (steps per millisecond=154 )
Probabilistic random walk after 23147 steps, saw 10320 distinct states, run finished after 150 ms. (steps per millisecond=154 ) properties seen :3
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X p2)), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (NOT p2)), (F (OR (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 203 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Stuttering acceptance computed with spot in 77 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Stuttering acceptance computed with spot in 79 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Product exploration explored 100000 steps with 23064 reset in 193 ms.
Product exploration explored 100000 steps with 23111 reset in 174 ms.
Built C files in :
/tmp/ltsmin2483157664985200231
[2024-05-21 21:39:58] [INFO ] Computing symmetric may disable matrix : 203 transitions.
[2024-05-21 21:39:58] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:39:58] [INFO ] Computing symmetric may enable matrix : 203 transitions.
[2024-05-21 21:39:58] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:39:58] [INFO ] Computing Do-Not-Accords matrix : 203 transitions.
[2024-05-21 21:39:58] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:39:58] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2483157664985200231
Running compilation step : cd /tmp/ltsmin2483157664985200231;'/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 505 ms.
Running link step : cd /tmp/ltsmin2483157664985200231;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin2483157664985200231;'/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/stateBased11424281194218221574.hoa' '--buchi-type=spotba'
LTSmin run took 1385 ms.
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m04-LTLFireability-01 finished in 6487 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||X((F(p0) U X(G(p1)))))))'
Support contains 4 out of 190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 190/190 places, 356/356 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 170 transition count 292
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 170 transition count 292
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 46 place count 170 transition count 286
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 60 place count 156 transition count 266
Iterating global reduction 1 with 14 rules applied. Total rules applied 74 place count 156 transition count 266
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 76 place count 156 transition count 264
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 89 place count 143 transition count 245
Iterating global reduction 2 with 13 rules applied. Total rules applied 102 place count 143 transition count 245
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 111 place count 143 transition count 236
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 120 place count 134 transition count 196
Iterating global reduction 3 with 9 rules applied. Total rules applied 129 place count 134 transition count 196
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 130 place count 134 transition count 195
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 134 place count 130 transition count 191
Iterating global reduction 4 with 4 rules applied. Total rules applied 138 place count 130 transition count 191
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 141 place count 130 transition count 188
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 143 place count 128 transition count 186
Iterating global reduction 5 with 2 rules applied. Total rules applied 145 place count 128 transition count 186
Applied a total of 145 rules in 35 ms. Remains 128 /190 variables (removed 62) and now considering 186/356 (removed 170) transitions.
// Phase 1: matrix 186 rows 128 cols
[2024-05-21 21:40:00] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:40:00] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-21 21:40:00] [INFO ] Invariant cache hit.
[2024-05-21 21:40:00] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-21 21:40:00] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
[2024-05-21 21:40:00] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-21 21:40:00] [INFO ] Invariant cache hit.
[2024-05-21 21:40:01] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 128/190 places, 186/356 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 634 ms. Remains : 128/190 places, 186/356 transitions.
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d2m04-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s8 1) (GEQ s53 1)), p1:(AND (GEQ s2 1) (GEQ s126 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m04-LTLFireability-02 finished in 781 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 190/190 places, 356/356 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 169 transition count 294
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 169 transition count 294
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 50 place count 169 transition count 286
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 64 place count 155 transition count 265
Iterating global reduction 1 with 14 rules applied. Total rules applied 78 place count 155 transition count 265
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 82 place count 155 transition count 261
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 94 place count 143 transition count 244
Iterating global reduction 2 with 12 rules applied. Total rules applied 106 place count 143 transition count 244
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 114 place count 143 transition count 236
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 123 place count 134 transition count 189
Iterating global reduction 3 with 9 rules applied. Total rules applied 132 place count 134 transition count 189
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 133 place count 134 transition count 188
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 136 place count 131 transition count 185
Iterating global reduction 4 with 3 rules applied. Total rules applied 139 place count 131 transition count 185
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 140 place count 131 transition count 184
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 142 place count 129 transition count 182
Iterating global reduction 5 with 2 rules applied. Total rules applied 144 place count 129 transition count 182
Applied a total of 144 rules in 37 ms. Remains 129 /190 variables (removed 61) and now considering 182/356 (removed 174) transitions.
// Phase 1: matrix 182 rows 129 cols
[2024-05-21 21:40:01] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:40:01] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-21 21:40:01] [INFO ] Invariant cache hit.
[2024-05-21 21:40:01] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-21 21:40:01] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
[2024-05-21 21:40:01] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-21 21:40:01] [INFO ] Invariant cache hit.
[2024-05-21 21:40:01] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 129/190 places, 182/356 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 536 ms. Remains : 129/190 places, 182/356 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m04-LTLFireability-04 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:(AND (GEQ s1 1) (GEQ s123 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]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m04-LTLFireability-04 finished in 630 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(p0)||G((p1&&X(X(p2))))))'
Support contains 5 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 356/356 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 172 transition count 301
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 172 transition count 301
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 44 place count 172 transition count 293
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 56 place count 160 transition count 274
Iterating global reduction 1 with 12 rules applied. Total rules applied 68 place count 160 transition count 274
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 73 place count 160 transition count 269
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 83 place count 150 transition count 255
Iterating global reduction 2 with 10 rules applied. Total rules applied 93 place count 150 transition count 255
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 99 place count 150 transition count 249
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 105 place count 144 transition count 218
Iterating global reduction 3 with 6 rules applied. Total rules applied 111 place count 144 transition count 218
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 112 place count 144 transition count 217
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 114 place count 142 transition count 215
Iterating global reduction 4 with 2 rules applied. Total rules applied 116 place count 142 transition count 215
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 118 place count 140 transition count 213
Iterating global reduction 4 with 2 rules applied. Total rules applied 120 place count 140 transition count 213
Applied a total of 120 rules in 13 ms. Remains 140 /190 variables (removed 50) and now considering 213/356 (removed 143) transitions.
// Phase 1: matrix 213 rows 140 cols
[2024-05-21 21:40:01] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 21:40:01] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-21 21:40:01] [INFO ] Invariant cache hit.
[2024-05-21 21:40:02] [INFO ] State equation strengthened by 80 read => feed constraints.
[2024-05-21 21:40:02] [INFO ] Implicit Places using invariants and state equation in 370 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
[2024-05-21 21:40:02] [INFO ] Invariant cache hit.
[2024-05-21 21:40:02] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 140/190 places, 213/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 561 ms. Remains : 140/190 places, 213/356 transitions.
Stuttering acceptance computed with spot in 175 ms :[true, (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d2m04-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p1 p2), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(AND (GEQ s1 1) (GEQ s81 1)), p1:(OR (LT s1 1) (LT s69 1)), p2:(AND (OR (LT s1 1) (LT s133 1)) (OR (LT s1 1) (LT s134 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 22895 reset in 175 ms.
Product exploration explored 100000 steps with 22998 reset in 244 ms.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 514 edges and 140 vertex of which 139 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), true, (X (X (AND p1 p2))), (X (X (NOT (OR (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 127 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[true, (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 2319 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 417 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 462 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Finished probabilistic random walk after 10342 steps, run visited all 2 properties in 61 ms. (steps per millisecond=169 )
Probabilistic random walk after 10342 steps, saw 4928 distinct states, run finished after 61 ms. (steps per millisecond=169 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), true, (X (X (AND p1 p2))), (X (X (NOT (OR (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (OR (NOT p1) (NOT p2))), (F (NOT (AND p1 p2)))]
Knowledge based reduction with 7 factoid took 136 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[true, (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 134 ms :[true, (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1))]
Support contains 4 out of 140 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 213/213 transitions.
Applied a total of 0 rules in 12 ms. Remains 140 /140 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2024-05-21 21:40:04] [INFO ] Invariant cache hit.
[2024-05-21 21:40:04] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-21 21:40:04] [INFO ] Invariant cache hit.
[2024-05-21 21:40:04] [INFO ] State equation strengthened by 80 read => feed constraints.
[2024-05-21 21:40:04] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
[2024-05-21 21:40:04] [INFO ] Invariant cache hit.
[2024-05-21 21:40:04] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 561 ms. Remains : 140/140 places, 213/213 transitions.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 514 edges and 140 vertex of which 139 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p1 p2), (X (X (AND p1 p2))), (X (X (NOT (OR (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[true, (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 2297 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 442 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 456 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Finished probabilistic random walk after 10342 steps, run visited all 2 properties in 66 ms. (steps per millisecond=156 )
Probabilistic random walk after 10342 steps, saw 4928 distinct states, run finished after 66 ms. (steps per millisecond=156 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p2), (X (X (AND p1 p2))), (X (X (NOT (OR (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (OR (NOT p1) (NOT p2))), (F (NOT (AND p1 p2)))]
Knowledge based reduction with 3 factoid took 142 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[true, (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 136 ms :[true, (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 148 ms :[true, (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 23060 reset in 182 ms.
Product exploration explored 100000 steps with 22885 reset in 198 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 118 ms :[true, (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1))]
Support contains 4 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 213/213 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 139 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 139 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 138 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 138 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 137 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 137 transition count 210
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 137 transition count 209
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 136 transition count 201
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 136 transition count 201
Applied a total of 9 rules in 28 ms. Remains 136 /140 variables (removed 4) and now considering 201/213 (removed 12) transitions.
[2024-05-21 21:40:06] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 201 rows 136 cols
[2024-05-21 21:40:06] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:40:06] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 136/140 places, 201/213 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 168 ms. Remains : 136/140 places, 201/213 transitions.
Built C files in :
/tmp/ltsmin16798072098934103959
[2024-05-21 21:40:06] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16798072098934103959
Running compilation step : cd /tmp/ltsmin16798072098934103959;'/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 335 ms.
Running link step : cd /tmp/ltsmin16798072098934103959;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin16798072098934103959;'/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/stateBased12583255455539604184.hoa' '--buchi-type=spotba'
LTSmin run took 248 ms.
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m04-LTLFireability-06 finished in 5243 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 190/190 places, 356/356 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 169 transition count 290
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 169 transition count 290
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 48 place count 169 transition count 284
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 63 place count 154 transition count 262
Iterating global reduction 1 with 15 rules applied. Total rules applied 78 place count 154 transition count 262
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 81 place count 154 transition count 259
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 94 place count 141 transition count 240
Iterating global reduction 2 with 13 rules applied. Total rules applied 107 place count 141 transition count 240
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 116 place count 141 transition count 231
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 124 place count 133 transition count 191
Iterating global reduction 3 with 8 rules applied. Total rules applied 132 place count 133 transition count 191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 133 place count 133 transition count 190
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 136 place count 130 transition count 187
Iterating global reduction 4 with 3 rules applied. Total rules applied 139 place count 130 transition count 187
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 141 place count 130 transition count 185
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 143 place count 128 transition count 183
Iterating global reduction 5 with 2 rules applied. Total rules applied 145 place count 128 transition count 183
Applied a total of 145 rules in 25 ms. Remains 128 /190 variables (removed 62) and now considering 183/356 (removed 173) transitions.
// Phase 1: matrix 183 rows 128 cols
[2024-05-21 21:40:07] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:40:07] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-21 21:40:07] [INFO ] Invariant cache hit.
[2024-05-21 21:40:07] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-21 21:40:07] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
[2024-05-21 21:40:07] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 21:40:07] [INFO ] Invariant cache hit.
[2024-05-21 21:40:07] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 128/190 places, 183/356 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 454 ms. Remains : 128/190 places, 183/356 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m04-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s111 1)) (AND (GEQ s1 1) (GEQ s70 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m04-LTLFireability-07 finished in 498 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(p0))&&(!p1 U (p2||G(!p1)))))'
Support contains 5 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 356/356 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 170 transition count 292
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 170 transition count 292
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 47 place count 170 transition count 285
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 60 place count 157 transition count 267
Iterating global reduction 1 with 13 rules applied. Total rules applied 73 place count 157 transition count 267
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 74 place count 157 transition count 266
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 86 place count 145 transition count 248
Iterating global reduction 2 with 12 rules applied. Total rules applied 98 place count 145 transition count 248
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 107 place count 145 transition count 239
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 115 place count 137 transition count 199
Iterating global reduction 3 with 8 rules applied. Total rules applied 123 place count 137 transition count 199
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 127 place count 133 transition count 195
Iterating global reduction 3 with 4 rules applied. Total rules applied 131 place count 133 transition count 195
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 134 place count 133 transition count 192
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 136 place count 131 transition count 190
Iterating global reduction 4 with 2 rules applied. Total rules applied 138 place count 131 transition count 190
Applied a total of 138 rules in 21 ms. Remains 131 /190 variables (removed 59) and now considering 190/356 (removed 166) transitions.
// Phase 1: matrix 190 rows 131 cols
[2024-05-21 21:40:07] [INFO ] Computed 2 invariants in 4 ms
[2024-05-21 21:40:07] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-21 21:40:07] [INFO ] Invariant cache hit.
[2024-05-21 21:40:07] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-21 21:40:07] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
[2024-05-21 21:40:07] [INFO ] Invariant cache hit.
[2024-05-21 21:40:08] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 131/190 places, 190/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 436 ms. Remains : 131/190 places, 190/356 transitions.
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p0) (AND p1 (NOT p2))), true, (NOT p0), (AND (NOT p2) p1), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m04-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 1}, { cond=(OR p2 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}]], initial=0, aps=[p2:(AND (OR (LT s1 1) (LT s94 1)) (NOT (AND (GEQ s1 1) (GEQ s122 1)))), p1:(AND (GEQ s1 1) (GEQ s122 1)), p0:(OR (LT s45 1) (LT s74 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 242 ms.
Product exploration explored 100000 steps with 33333 reset in 235 ms.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 476 edges and 131 vertex of which 130 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 24 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m04-LTLFireability-09 finished in 1139 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(((p1||X(p2))&&p0)))'
Support contains 4 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 356/356 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 171 transition count 302
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 171 transition count 302
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 46 place count 171 transition count 294
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 58 place count 159 transition count 275
Iterating global reduction 1 with 12 rules applied. Total rules applied 70 place count 159 transition count 275
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 74 place count 159 transition count 271
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 84 place count 149 transition count 256
Iterating global reduction 2 with 10 rules applied. Total rules applied 94 place count 149 transition count 256
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 99 place count 149 transition count 251
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 104 place count 144 transition count 229
Iterating global reduction 3 with 5 rules applied. Total rules applied 109 place count 144 transition count 229
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 110 place count 144 transition count 228
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 112 place count 142 transition count 226
Iterating global reduction 4 with 2 rules applied. Total rules applied 114 place count 142 transition count 226
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 116 place count 142 transition count 224
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 117 place count 141 transition count 223
Iterating global reduction 5 with 1 rules applied. Total rules applied 118 place count 141 transition count 223
Applied a total of 118 rules in 15 ms. Remains 141 /190 variables (removed 49) and now considering 223/356 (removed 133) transitions.
// Phase 1: matrix 223 rows 141 cols
[2024-05-21 21:40:08] [INFO ] Computed 2 invariants in 6 ms
[2024-05-21 21:40:08] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-21 21:40:08] [INFO ] Invariant cache hit.
[2024-05-21 21:40:08] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-21 21:40:09] [INFO ] Implicit Places using invariants and state equation in 391 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
[2024-05-21 21:40:09] [INFO ] Invariant cache hit.
[2024-05-21 21:40:09] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 141/190 places, 223/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 614 ms. Remains : 141/190 places, 223/356 transitions.
Stuttering acceptance computed with spot in 80 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : DBSingleClientW-PT-d2m04-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s88 1)), p1:(GEQ s132 1), p2:(AND (GEQ s1 1) (GEQ s135 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m04-LTLFireability-10 finished in 711 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 4 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 356/356 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 170 transition count 299
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 170 transition count 299
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 47 place count 170 transition count 292
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 61 place count 156 transition count 271
Iterating global reduction 1 with 14 rules applied. Total rules applied 75 place count 156 transition count 271
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 78 place count 156 transition count 268
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 90 place count 144 transition count 251
Iterating global reduction 2 with 12 rules applied. Total rules applied 102 place count 144 transition count 251
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 112 place count 144 transition count 241
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 122 place count 134 transition count 193
Iterating global reduction 3 with 10 rules applied. Total rules applied 132 place count 134 transition count 193
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 133 place count 134 transition count 192
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 137 place count 130 transition count 188
Iterating global reduction 4 with 4 rules applied. Total rules applied 141 place count 130 transition count 188
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 144 place count 130 transition count 185
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 146 place count 128 transition count 183
Iterating global reduction 5 with 2 rules applied. Total rules applied 148 place count 128 transition count 183
Applied a total of 148 rules in 15 ms. Remains 128 /190 variables (removed 62) and now considering 183/356 (removed 173) transitions.
// Phase 1: matrix 183 rows 128 cols
[2024-05-21 21:40:09] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 21:40:09] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-21 21:40:09] [INFO ] Invariant cache hit.
[2024-05-21 21:40:09] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-05-21 21:40:09] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
[2024-05-21 21:40:09] [INFO ] Invariant cache hit.
[2024-05-21 21:40:09] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 128/190 places, 183/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 524 ms. Remains : 128/190 places, 183/356 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m04-LTLFireability-11 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 s26 1) (GEQ s53 1)) (AND (GEQ s1 1) (GEQ s96 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 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m04-LTLFireability-11 finished in 650 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 356/356 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 169 transition count 294
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 169 transition count 294
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 50 place count 169 transition count 286
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 64 place count 155 transition count 265
Iterating global reduction 1 with 14 rules applied. Total rules applied 78 place count 155 transition count 265
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 82 place count 155 transition count 261
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 94 place count 143 transition count 244
Iterating global reduction 2 with 12 rules applied. Total rules applied 106 place count 143 transition count 244
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 114 place count 143 transition count 236
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 123 place count 134 transition count 189
Iterating global reduction 3 with 9 rules applied. Total rules applied 132 place count 134 transition count 189
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 133 place count 134 transition count 188
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 136 place count 131 transition count 185
Iterating global reduction 4 with 3 rules applied. Total rules applied 139 place count 131 transition count 185
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 140 place count 131 transition count 184
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 142 place count 129 transition count 182
Iterating global reduction 5 with 2 rules applied. Total rules applied 144 place count 129 transition count 182
Applied a total of 144 rules in 14 ms. Remains 129 /190 variables (removed 61) and now considering 182/356 (removed 174) transitions.
// Phase 1: matrix 182 rows 129 cols
[2024-05-21 21:40:10] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:40:10] [INFO ] Implicit Places using invariants in 282 ms returned []
[2024-05-21 21:40:10] [INFO ] Invariant cache hit.
[2024-05-21 21:40:10] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-21 21:40:10] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 546 ms to find 0 implicit places.
[2024-05-21 21:40:10] [INFO ] Invariant cache hit.
[2024-05-21 21:40:10] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 129/190 places, 182/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 640 ms. Remains : 129/190 places, 182/356 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m04-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s123 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m04-LTLFireability-12 finished in 744 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)&&F(G(p1)))))'
Support contains 3 out of 190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 190/190 places, 356/356 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 169 transition count 290
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 169 transition count 290
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 49 place count 169 transition count 283
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 63 place count 155 transition count 262
Iterating global reduction 1 with 14 rules applied. Total rules applied 77 place count 155 transition count 262
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 155 transition count 259
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 92 place count 143 transition count 242
Iterating global reduction 2 with 12 rules applied. Total rules applied 104 place count 143 transition count 242
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 112 place count 143 transition count 234
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 121 place count 134 transition count 193
Iterating global reduction 3 with 9 rules applied. Total rules applied 130 place count 134 transition count 193
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 131 place count 134 transition count 192
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 135 place count 130 transition count 188
Iterating global reduction 4 with 4 rules applied. Total rules applied 139 place count 130 transition count 188
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 142 place count 130 transition count 185
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 144 place count 128 transition count 183
Iterating global reduction 5 with 2 rules applied. Total rules applied 146 place count 128 transition count 183
Applied a total of 146 rules in 25 ms. Remains 128 /190 variables (removed 62) and now considering 183/356 (removed 173) transitions.
// Phase 1: matrix 183 rows 128 cols
[2024-05-21 21:40:10] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 21:40:11] [INFO ] Implicit Places using invariants in 219 ms returned []
[2024-05-21 21:40:11] [INFO ] Invariant cache hit.
[2024-05-21 21:40:11] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-21 21:40:11] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 504 ms to find 0 implicit places.
[2024-05-21 21:40:11] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 21:40:11] [INFO ] Invariant cache hit.
[2024-05-21 21:40:11] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 128/190 places, 183/356 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 625 ms. Remains : 128/190 places, 183/356 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m04-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s71 1)), p1:(AND (GEQ s1 1) (GEQ s91 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m04-LTLFireability-14 finished in 759 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&&X((X(F(p1))||G(!p0)))))))'
Support contains 4 out of 190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 190/190 places, 356/356 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 170 transition count 292
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 170 transition count 292
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 46 place count 170 transition count 286
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 60 place count 156 transition count 266
Iterating global reduction 1 with 14 rules applied. Total rules applied 74 place count 156 transition count 266
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 76 place count 156 transition count 264
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 88 place count 144 transition count 246
Iterating global reduction 2 with 12 rules applied. Total rules applied 100 place count 144 transition count 246
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 109 place count 144 transition count 237
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 117 place count 136 transition count 198
Iterating global reduction 3 with 8 rules applied. Total rules applied 125 place count 136 transition count 198
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 129 place count 132 transition count 194
Iterating global reduction 3 with 4 rules applied. Total rules applied 133 place count 132 transition count 194
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 136 place count 132 transition count 191
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 138 place count 130 transition count 189
Iterating global reduction 4 with 2 rules applied. Total rules applied 140 place count 130 transition count 189
Applied a total of 140 rules in 28 ms. Remains 130 /190 variables (removed 60) and now considering 189/356 (removed 167) transitions.
// Phase 1: matrix 189 rows 130 cols
[2024-05-21 21:40:11] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:40:11] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-21 21:40:11] [INFO ] Invariant cache hit.
[2024-05-21 21:40:11] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-21 21:40:12] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
[2024-05-21 21:40:12] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 21:40:12] [INFO ] Invariant cache hit.
[2024-05-21 21:40:12] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 130/190 places, 189/356 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 541 ms. Remains : 130/190 places, 189/356 transitions.
Stuttering acceptance computed with spot in 208 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d2m04-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s71 1)), p1:(AND (GEQ s45 1) (GEQ s82 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 22995 reset in 145 ms.
Product exploration explored 100000 steps with 22973 reset in 153 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 473 edges and 130 vertex of which 129 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 104 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 9 states, 23 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 320 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, false, false, false]
Incomplete random walk after 10000 steps, including 2312 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 479 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 465 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 885 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 454 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 469 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Probably explored full state space saw : 28484 states, properties seen :4
Probabilistic random walk after 69033 steps, saw 28484 distinct states, run finished after 308 ms. (steps per millisecond=224 ) properties seen :4
Explored full state space saw : 28567 states, properties seen :0
Exhaustive walk after 69167 steps, saw 28567 distinct states, run finished after 88 ms. (steps per millisecond=785 ) properties seen :0
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (G (NOT (AND p1 p0)))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F p0), (F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 6 factoid took 315 ms. Reduced automaton from 9 states, 23 edges and 2 AP (stutter insensitive) to 8 states, 23 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 308 ms :[p0, p0, p0, p0, p0, false, (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 280 ms :[p0, p0, p0, p0, p0, false, (AND p0 p1), (AND p0 p1)]
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 189/189 transitions.
Applied a total of 0 rules in 7 ms. Remains 130 /130 variables (removed 0) and now considering 189/189 (removed 0) transitions.
[2024-05-21 21:40:14] [INFO ] Invariant cache hit.
[2024-05-21 21:40:14] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-21 21:40:14] [INFO ] Invariant cache hit.
[2024-05-21 21:40:15] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-05-21 21:40:15] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
[2024-05-21 21:40:15] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 21:40:15] [INFO ] Invariant cache hit.
[2024-05-21 21:40:15] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 482 ms. Remains : 130/130 places, 189/189 transitions.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 473 edges and 130 vertex of which 129 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (OR p1 (NOT p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (OR p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 121 ms. Reduced automaton from 8 states, 23 edges and 2 AP (stutter insensitive) to 8 states, 23 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 266 ms :[p0, p0, p0, p0, p0, false, (AND p0 p1), (AND p0 p1)]
Incomplete random walk after 10000 steps, including 2276 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 452 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 446 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 460 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 479 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 1027 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 952 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Probably explored full state space saw : 28484 states, properties seen :5
Probabilistic random walk after 69033 steps, saw 28484 distinct states, run finished after 236 ms. (steps per millisecond=292 ) properties seen :5
Explored full state space saw : 28567 states, properties seen :0
Exhaustive walk after 69167 steps, saw 28567 distinct states, run finished after 87 ms. (steps per millisecond=795 ) properties seen :0
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (OR p1 (NOT p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (OR p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 14 factoid took 560 ms. Reduced automaton from 8 states, 23 edges and 2 AP (stutter insensitive) to 8 states, 23 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 280 ms :[p0, p0, p0, p0, p0, false, (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 280 ms :[p0, p0, p0, p0, p0, false, (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 280 ms :[p0, p0, p0, p0, p0, false, (AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 22968 reset in 154 ms.
Product exploration explored 100000 steps with 22986 reset in 157 ms.
Built C files in :
/tmp/ltsmin2149881660641904993
[2024-05-21 21:40:18] [INFO ] Computing symmetric may disable matrix : 189 transitions.
[2024-05-21 21:40:18] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:40:18] [INFO ] Computing symmetric may enable matrix : 189 transitions.
[2024-05-21 21:40:18] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:40:18] [INFO ] Computing Do-Not-Accords matrix : 189 transitions.
[2024-05-21 21:40:18] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:40:18] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2149881660641904993
Running compilation step : cd /tmp/ltsmin2149881660641904993;'/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 364 ms.
Running link step : cd /tmp/ltsmin2149881660641904993;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin2149881660641904993;'/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/stateBased4146290143023715662.hoa' '--buchi-type=spotba'
LTSmin run took 1392 ms.
FORMULA DBSingleClientW-PT-d2m04-LTLFireability-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m04-LTLFireability-15 finished in 8529 ms.
All properties solved by simple procedures.
Total runtime 31575 ms.

BK_STOP 1716327621217

--------------------
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-d2m04"
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-d2m04, 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-171624208400343"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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