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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 12 12:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 184K Apr 12 12:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 12 12:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 12 12:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:35 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 119K 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-d0m05-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716324247002

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-d0m05
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-21 20:44:08] [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 20:44:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 20:44:08] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2024-05-21 20:44:08] [INFO ] Transformed 553 places.
[2024-05-21 20:44:08] [INFO ] Transformed 150 transitions.
[2024-05-21 20:44:08] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 122 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 444 places in 1 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m05-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 150/150 transitions.
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 102 transition count 139
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 29 place count 91 transition count 127
Iterating global reduction 1 with 11 rules applied. Total rules applied 40 place count 91 transition count 127
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 43 place count 91 transition count 124
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 46 place count 88 transition count 121
Iterating global reduction 2 with 3 rules applied. Total rules applied 49 place count 88 transition count 121
Applied a total of 49 rules in 23 ms. Remains 88 /109 variables (removed 21) and now considering 121/150 (removed 29) transitions.
// Phase 1: matrix 121 rows 88 cols
[2024-05-21 20:44:08] [INFO ] Computed 2 invariants in 12 ms
[2024-05-21 20:44:09] [INFO ] Implicit Places using invariants in 376 ms returned []
[2024-05-21 20:44:09] [INFO ] Invariant cache hit.
[2024-05-21 20:44:09] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-21 20:44:09] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 536 ms to find 0 implicit places.
[2024-05-21 20:44:09] [INFO ] Invariant cache hit.
[2024-05-21 20:44:09] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 88/109 places, 121/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 645 ms. Remains : 88/109 places, 121/150 transitions.
Support contains 28 out of 88 places after structural reductions.
[2024-05-21 20:44:09] [INFO ] Flatten gal took : 31 ms
[2024-05-21 20:44:09] [INFO ] Flatten gal took : 12 ms
[2024-05-21 20:44:09] [INFO ] Input system was already deterministic with 121 transitions.
Support contains 26 out of 88 places (down from 28) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2277 resets, run finished after 491 ms. (steps per millisecond=20 ) properties (out of 24) seen :12
Incomplete Best-First random walk after 10001 steps, including 1058 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 483 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 512 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 527 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 507 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 978 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10000 steps, including 477 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 993 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 483 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 483 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 484 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2024-05-21 20:44:10] [INFO ] Invariant cache hit.
[2024-05-21 20:44:10] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-21 20:44:10] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 20:44:11] [INFO ] After 273ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-21 20:44:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-21 20:44:11] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 20:44:11] [INFO ] After 143ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2024-05-21 20:44:11] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-05-21 20:44:11] [INFO ] After 140ms SMT Verify possible using 53 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2024-05-21 20:44:11] [INFO ] After 346ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 160 ms.
[2024-05-21 20:44:11] [INFO ] After 746ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 45 ms.
Support contains 13 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 121/121 transitions.
Graph (complete) has 259 edges and 88 vertex of which 87 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 87 transition count 120
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 7 place count 82 transition count 111
Iterating global reduction 1 with 5 rules applied. Total rules applied 12 place count 82 transition count 111
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 80 transition count 109
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 80 transition count 109
Applied a total of 16 rules in 20 ms. Remains 80 /88 variables (removed 8) and now considering 109/121 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 80/88 places, 109/121 transitions.
Incomplete random walk after 10000 steps, including 2249 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 998 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 515 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 482 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 506 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 485 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10000 steps, including 489 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 1012 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 478 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 511 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 500 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 109 rows 80 cols
[2024-05-21 20:44:12] [INFO ] Computed 2 invariants in 12 ms
[2024-05-21 20:44:12] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-21 20:44:12] [INFO ] After 164ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-21 20:44:12] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 20:44:13] [INFO ] After 91ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-21 20:44:13] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-21 20:44:13] [INFO ] After 96ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2024-05-21 20:44:13] [INFO ] After 216ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 82 ms.
[2024-05-21 20:44:13] [INFO ] After 449ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 37 ms.
Support contains 10 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 109/109 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 78 transition count 105
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 78 transition count 105
Applied a total of 4 rules in 11 ms. Remains 78 /80 variables (removed 2) and now considering 105/109 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 78/80 places, 105/109 transitions.
Incomplete random walk after 10000 steps, including 2293 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 513 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 489 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 513 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 493 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 1041 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 517 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 491 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 495 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :0
Finished probabilistic random walk after 8753 steps, run visited all 8 properties in 100 ms. (steps per millisecond=87 )
Probabilistic random walk after 8753 steps, saw 3790 distinct states, run finished after 100 ms. (steps per millisecond=87 ) properties seen :8
Parikh walk visited 0 properties in 0 ms.
FORMULA DBSingleClientW-PT-d0m05-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 291 edges and 88 vertex of which 87 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 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' '!(((p0 U X(p1))||X(G((p1||X(X(p2)))))))'
Support contains 5 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 121/121 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 76 transition count 95
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 76 transition count 95
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 69 transition count 88
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 69 transition count 88
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 67 transition count 85
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 67 transition count 85
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 67 transition count 84
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 66 transition count 82
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 66 transition count 82
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 65 transition count 81
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 65 transition count 81
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 64 transition count 80
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 64 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 51 place count 64 transition count 78
Applied a total of 51 rules in 12 ms. Remains 64 /88 variables (removed 24) and now considering 78/121 (removed 43) transitions.
// Phase 1: matrix 78 rows 64 cols
[2024-05-21 20:44:14] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 20:44:14] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-21 20:44:14] [INFO ] Invariant cache hit.
[2024-05-21 20:44:14] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-21 20:44:14] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2024-05-21 20:44:14] [INFO ] Invariant cache hit.
[2024-05-21 20:44:14] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 64/88 places, 78/121 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 176 ms. Remains : 64/88 places, 78/121 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 604 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 8}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 9}, { cond=(AND p0 (NOT p1)), acceptance={} source=8 dest: 10}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=9 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=10 dest: 11}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=10 dest: 12}], [{ cond=(NOT p1), acceptance={} source=11 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=12 dest: 11}, { cond=(AND p0 (NOT p1)), acceptance={0} source=12 dest: 12}]], initial=0, aps=[p0:(AND (GEQ s18 1) (GEQ s24 1)), p1:(AND (GEQ s1 1) (GEQ s57 1)), p2:(AND (GEQ s1 1) (GEQ s62 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 2 ms.
FORMULA DBSingleClientW-PT-d0m05-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m05-LTLFireability-00 finished in 852 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)||G(p1))))'
Support contains 3 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 121/121 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 76 transition count 95
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 76 transition count 95
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 69 transition count 88
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 69 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 69 transition count 86
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 67 transition count 82
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 67 transition count 82
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 65 transition count 79
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 65 transition count 79
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 64 transition count 78
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 64 transition count 78
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 52 place count 64 transition count 76
Applied a total of 52 rules in 23 ms. Remains 64 /88 variables (removed 24) and now considering 76/121 (removed 45) transitions.
// Phase 1: matrix 76 rows 64 cols
[2024-05-21 20:44:15] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 20:44:15] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-21 20:44:15] [INFO ] Invariant cache hit.
[2024-05-21 20:44:15] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-21 20:44:15] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2024-05-21 20:44:15] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 20:44:15] [INFO ] Invariant cache hit.
[2024-05-21 20:44:15] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/88 places, 76/121 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 201 ms. Remains : 64/88 places, 76/121 transitions.
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s62 1)), p1:(AND (GEQ s1 1) (GEQ s28 1))], nbAcceptance=2, 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-d0m05-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m05-LTLFireability-01 finished in 253 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p1))||p0)))'
Support contains 5 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 121/121 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 76 transition count 95
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 76 transition count 95
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 69 transition count 88
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 69 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 69 transition count 86
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 43 place count 66 transition count 80
Iterating global reduction 1 with 3 rules applied. Total rules applied 46 place count 66 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 47 place count 66 transition count 79
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 49 place count 64 transition count 76
Iterating global reduction 2 with 2 rules applied. Total rules applied 51 place count 64 transition count 76
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 53 place count 62 transition count 74
Iterating global reduction 2 with 2 rules applied. Total rules applied 55 place count 62 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 57 place count 62 transition count 72
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 58 place count 61 transition count 71
Iterating global reduction 3 with 1 rules applied. Total rules applied 59 place count 61 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 61 place count 61 transition count 69
Applied a total of 61 rules in 22 ms. Remains 61 /88 variables (removed 27) and now considering 69/121 (removed 52) transitions.
// Phase 1: matrix 69 rows 61 cols
[2024-05-21 20:44:15] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 20:44:15] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-21 20:44:15] [INFO ] Invariant cache hit.
[2024-05-21 20:44:15] [INFO ] State equation strengthened by 24 read => feed constraints.
[2024-05-21 20:44:15] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2024-05-21 20:44:15] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 20:44:15] [INFO ] Invariant cache hit.
[2024-05-21 20:44:15] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/88 places, 69/121 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 174 ms. Remains : 61/88 places, 69/121 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s10 1) (GEQ s22 1)) (AND (GEQ s1 1) (GEQ s58 1))), p1:(AND (GEQ s1 1) (GEQ s26 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d0m05-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m05-LTLFireability-03 finished in 264 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((G(F(!p0))||(F(!p0)&&X(X(G(p1)))))))))'
Support contains 3 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 121/121 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 76 transition count 95
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 76 transition count 95
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 70 transition count 89
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 70 transition count 89
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 67 transition count 83
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 67 transition count 83
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 67 transition count 82
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 66 transition count 81
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 66 transition count 81
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 65 transition count 80
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 65 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 49 place count 65 transition count 78
Applied a total of 49 rules in 11 ms. Remains 65 /88 variables (removed 23) and now considering 78/121 (removed 43) transitions.
// Phase 1: matrix 78 rows 65 cols
[2024-05-21 20:44:15] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 20:44:15] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-21 20:44:15] [INFO ] Invariant cache hit.
[2024-05-21 20:44:16] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-21 20:44:16] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2024-05-21 20:44:16] [INFO ] Invariant cache hit.
[2024-05-21 20:44:16] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 65/88 places, 78/121 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 170 ms. Remains : 65/88 places, 78/121 transitions.
Stuttering acceptance computed with spot in 237 ms :[p0, p0, p0, (AND p0 (NOT p1)), p0, (AND p0 (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s60 1)), p1:(AND (GEQ s1 1) (GEQ s58 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22881 reset in 252 ms.
Product exploration explored 100000 steps with 22809 reset in 139 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 211 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 163 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 241 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2309 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 478 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 471 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Finished probabilistic random walk after 4794 steps, run visited all 2 properties in 28 ms. (steps per millisecond=171 )
Probabilistic random walk after 4794 steps, saw 2193 distinct states, run finished after 29 ms. (steps per millisecond=165 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 263 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 232 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, (AND p0 (NOT p1))]
Support contains 3 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 78/78 transitions.
Applied a total of 0 rules in 2 ms. Remains 65 /65 variables (removed 0) and now considering 78/78 (removed 0) transitions.
[2024-05-21 20:44:17] [INFO ] Invariant cache hit.
[2024-05-21 20:44:18] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-21 20:44:18] [INFO ] Invariant cache hit.
[2024-05-21 20:44:18] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-21 20:44:18] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2024-05-21 20:44:18] [INFO ] Invariant cache hit.
[2024-05-21 20:44:18] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 185 ms. Remains : 65/65 places, 78/78 transitions.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 211 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 69 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2314 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 533 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 511 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Finished probabilistic random walk after 4794 steps, run visited all 2 properties in 23 ms. (steps per millisecond=208 )
Probabilistic random walk after 4794 steps, saw 2193 distinct states, run finished after 24 ms. (steps per millisecond=199 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), true]
False Knowledge obtained : [(F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 2 factoid took 107 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 255 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 242 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 22929 reset in 84 ms.
Product exploration explored 100000 steps with 22917 reset in 87 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 256 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, (AND p0 (NOT p1))]
Support contains 3 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 78/78 transitions.
Applied a total of 0 rules in 12 ms. Remains 65 /65 variables (removed 0) and now considering 78/78 (removed 0) transitions.
[2024-05-21 20:44:20] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-21 20:44:20] [INFO ] Invariant cache hit.
[2024-05-21 20:44:20] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 77 ms. Remains : 65/65 places, 78/78 transitions.
Built C files in :
/tmp/ltsmin11613211485827919245
[2024-05-21 20:44:20] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11613211485827919245
Running compilation step : cd /tmp/ltsmin11613211485827919245;'/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 245 ms.
Running link step : cd /tmp/ltsmin11613211485827919245;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin11613211485827919245;'/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/stateBased8374999162486880775.hoa' '--buchi-type=spotba'
LTSmin run took 483 ms.
FORMULA DBSingleClientW-PT-d0m05-LTLFireability-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d0m05-LTLFireability-05 finished in 5030 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(G(p0))))'
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 121/121 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 74 transition count 91
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 74 transition count 91
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 36 place count 66 transition count 83
Iterating global reduction 0 with 8 rules applied. Total rules applied 44 place count 66 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 66 transition count 81
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 49 place count 63 transition count 75
Iterating global reduction 1 with 3 rules applied. Total rules applied 52 place count 63 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 53 place count 63 transition count 74
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 55 place count 61 transition count 71
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 61 transition count 71
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 59 place count 59 transition count 69
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 59 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 63 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 64 place count 58 transition count 66
Iterating global reduction 3 with 1 rules applied. Total rules applied 65 place count 58 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 67 place count 58 transition count 64
Applied a total of 67 rules in 12 ms. Remains 58 /88 variables (removed 30) and now considering 64/121 (removed 57) transitions.
// Phase 1: matrix 64 rows 58 cols
[2024-05-21 20:44:20] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 20:44:21] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-21 20:44:21] [INFO ] Invariant cache hit.
[2024-05-21 20:44:21] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 20:44:21] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2024-05-21 20:44:21] [INFO ] Invariant cache hit.
[2024-05-21 20:44:21] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 58/88 places, 64/121 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 166 ms. Remains : 58/88 places, 64/121 transitions.
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s8 1) (GEQ s44 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m05-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m05-LTLFireability-06 finished in 311 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 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 121/121 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 75 transition count 94
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 75 transition count 94
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 33 place count 68 transition count 87
Iterating global reduction 0 with 7 rules applied. Total rules applied 40 place count 68 transition count 87
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 43 place count 65 transition count 81
Iterating global reduction 0 with 3 rules applied. Total rules applied 46 place count 65 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 65 transition count 80
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 63 transition count 77
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 63 transition count 77
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 61 transition count 75
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 61 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 57 place count 61 transition count 73
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 60 transition count 72
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 60 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 61 place count 60 transition count 70
Applied a total of 61 rules in 11 ms. Remains 60 /88 variables (removed 28) and now considering 70/121 (removed 51) transitions.
// Phase 1: matrix 70 rows 60 cols
[2024-05-21 20:44:21] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 20:44:21] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-21 20:44:21] [INFO ] Invariant cache hit.
[2024-05-21 20:44:21] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-21 20:44:21] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2024-05-21 20:44:21] [INFO ] Invariant cache hit.
[2024-05-21 20:44:21] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/88 places, 70/121 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 176 ms. Remains : 60/88 places, 70/121 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLFireability-07 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 s54 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 0 ms.
FORMULA DBSingleClientW-PT-d0m05-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m05-LTLFireability-07 finished in 267 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G((p1&&F(p2))))))'
Support contains 4 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 121/121 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 76 transition count 95
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 76 transition count 95
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 69 transition count 88
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 69 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 69 transition count 86
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 67 transition count 81
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 67 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 45 place count 67 transition count 80
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 66 transition count 79
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 66 transition count 79
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 65 transition count 78
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 65 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 65 transition count 77
Applied a total of 50 rules in 19 ms. Remains 65 /88 variables (removed 23) and now considering 77/121 (removed 44) transitions.
// Phase 1: matrix 77 rows 65 cols
[2024-05-21 20:44:21] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 20:44:21] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-21 20:44:21] [INFO ] Invariant cache hit.
[2024-05-21 20:44:21] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-21 20:44:21] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2024-05-21 20:44:21] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 20:44:21] [INFO ] Invariant cache hit.
[2024-05-21 20:44:21] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 65/88 places, 77/121 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 210 ms. Remains : 65/88 places, 77/121 transitions.
Stuttering acceptance computed with spot in 92 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LT s1 1) (LT s63 1)), p0:(AND (GEQ s19 1) (GEQ s24 1)), p2:(AND (OR (LT s1 1) (LT s63 1)) (OR (LT s19 1) (LT s24 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 22972 reset in 155 ms.
Product exploration explored 100000 steps with 22959 reset in 159 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 211 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 105 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 66 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2318 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10000 steps, including 479 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 1014 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 1031 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-21 20:44:22] [INFO ] Invariant cache hit.
[2024-05-21 20:44:22] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 20:44:22] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-21 20:44:22] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2024-05-21 20:44:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-21 20:44:22] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-21 20:44:22] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-05-21 20:44:22] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-21 20:44:22] [INFO ] After 20ms SMT Verify possible using 25 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2024-05-21 20:44:22] [INFO ] After 44ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 22 ms.
[2024-05-21 20:44:22] [INFO ] After 136ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 77/77 transitions.
Graph (complete) has 192 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 64 transition count 76
Applied a total of 2 rules in 4 ms. Remains 64 /65 variables (removed 1) and now considering 76/77 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 64/65 places, 76/77 transitions.
Incomplete random walk after 10000 steps, including 2311 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 484 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 992 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Finished probabilistic random walk after 8654 steps, run visited all 2 properties in 39 ms. (steps per millisecond=221 )
Probabilistic random walk after 8654 steps, saw 3798 distinct states, run finished after 40 ms. (steps per millisecond=216 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p1 (NOT p0)))), (G (NOT (AND (NOT p0) p1 (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 10 factoid took 224 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p1))]
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 77/77 transitions.
Applied a total of 0 rules in 10 ms. Remains 65 /65 variables (removed 0) and now considering 77/77 (removed 0) transitions.
[2024-05-21 20:44:23] [INFO ] Invariant cache hit.
[2024-05-21 20:44:23] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-21 20:44:23] [INFO ] Invariant cache hit.
[2024-05-21 20:44:23] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-21 20:44:23] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2024-05-21 20:44:23] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 20:44:23] [INFO ] Invariant cache hit.
[2024-05-21 20:44:23] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 190 ms. Remains : 65/65 places, 77/77 transitions.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 211 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 70 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2282 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 510 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 20:44:23] [INFO ] Invariant cache hit.
[2024-05-21 20:44:23] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 20:44:23] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 20:44:23] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 20:44:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 20:44:23] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 20:44:23] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 20:44:23] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-21 20:44:23] [INFO ] After 9ms SMT Verify possible using 25 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 20:44:23] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2024-05-21 20:44:23] [INFO ] After 89ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 77/77 transitions.
Graph (complete) has 192 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 64 transition count 76
Applied a total of 2 rules in 4 ms. Remains 64 /65 variables (removed 1) and now considering 76/77 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 64/65 places, 76/77 transitions.
Incomplete random walk after 10000 steps, including 2270 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 508 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 8654 steps, run visited all 1 properties in 12 ms. (steps per millisecond=721 )
Probabilistic random walk after 8654 steps, saw 3798 distinct states, run finished after 12 ms. (steps per millisecond=721 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 129 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 22845 reset in 113 ms.
Product exploration explored 100000 steps with 22936 reset in 111 ms.
Built C files in :
/tmp/ltsmin14343237626833582210
[2024-05-21 20:44:24] [INFO ] Computing symmetric may disable matrix : 77 transitions.
[2024-05-21 20:44:24] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:44:24] [INFO ] Computing symmetric may enable matrix : 77 transitions.
[2024-05-21 20:44:24] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:44:24] [INFO ] Computing Do-Not-Accords matrix : 77 transitions.
[2024-05-21 20:44:24] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:44:24] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14343237626833582210
Running compilation step : cd /tmp/ltsmin14343237626833582210;'/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 165 ms.
Running link step : cd /tmp/ltsmin14343237626833582210;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin14343237626833582210;'/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/stateBased2824259348826998537.hoa' '--buchi-type=spotba'
LTSmin run took 77 ms.
FORMULA DBSingleClientW-PT-d0m05-LTLFireability-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d0m05-LTLFireability-08 finished in 3053 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 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 121/121 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 74 transition count 91
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 74 transition count 91
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 36 place count 66 transition count 83
Iterating global reduction 0 with 8 rules applied. Total rules applied 44 place count 66 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 66 transition count 81
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 49 place count 63 transition count 75
Iterating global reduction 1 with 3 rules applied. Total rules applied 52 place count 63 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 53 place count 63 transition count 74
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 55 place count 61 transition count 71
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 61 transition count 71
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 60 transition count 70
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 60 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 61 place count 60 transition count 68
Applied a total of 61 rules in 5 ms. Remains 60 /88 variables (removed 28) and now considering 68/121 (removed 53) transitions.
// Phase 1: matrix 68 rows 60 cols
[2024-05-21 20:44:24] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 20:44:24] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-21 20:44:24] [INFO ] Invariant cache hit.
[2024-05-21 20:44:24] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 20:44:24] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2024-05-21 20:44:24] [INFO ] Invariant cache hit.
[2024-05-21 20:44:24] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/88 places, 68/121 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 172 ms. Remains : 60/88 places, 68/121 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLFireability-09 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:(AND (GEQ s1 1) (GEQ s49 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-d0m05-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m05-LTLFireability-09 finished in 284 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)||G(F(p1)))))'
Support contains 3 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 121/121 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 75 transition count 96
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 75 transition count 96
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 34 place count 67 transition count 88
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 67 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 67 transition count 86
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 47 place count 64 transition count 80
Iterating global reduction 1 with 3 rules applied. Total rules applied 50 place count 64 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 51 place count 64 transition count 79
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 63 transition count 77
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 63 transition count 77
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 62 transition count 76
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 62 transition count 76
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 61 transition count 75
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 61 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 59 place count 61 transition count 73
Applied a total of 59 rules in 14 ms. Remains 61 /88 variables (removed 27) and now considering 73/121 (removed 48) transitions.
// Phase 1: matrix 73 rows 61 cols
[2024-05-21 20:44:24] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 20:44:24] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-21 20:44:24] [INFO ] Invariant cache hit.
[2024-05-21 20:44:24] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-21 20:44:24] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2024-05-21 20:44:24] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 20:44:24] [INFO ] Invariant cache hit.
[2024-05-21 20:44:25] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/88 places, 73/121 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 171 ms. Remains : 61/88 places, 73/121 transitions.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s54 1)), p1:(OR (LT s1 1) (LT s42 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 22987 reset in 89 ms.
Product exploration explored 100000 steps with 22955 reset in 88 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 198 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 86 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2274 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 525 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 480 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2024-05-21 20:44:25] [INFO ] Invariant cache hit.
[2024-05-21 20:44:25] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-21 20:44:25] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 20:44:25] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 20:44:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-21 20:44:25] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 20:44:25] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 20:44:25] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-21 20:44:25] [INFO ] After 9ms SMT Verify possible using 26 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 20:44:25] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-21 20:44:25] [INFO ] After 77ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 73/73 transitions.
Graph (complete) has 180 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 60 transition count 72
Applied a total of 2 rules in 5 ms. Remains 60 /61 variables (removed 1) and now considering 72/73 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 60/61 places, 72/73 transitions.
Finished random walk after 1343 steps, including 310 resets, run visited all 1 properties in 2 ms. (steps per millisecond=671 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 120 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 61 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 61/61 places, 73/73 transitions.
Applied a total of 0 rules in 4 ms. Remains 61 /61 variables (removed 0) and now considering 73/73 (removed 0) transitions.
[2024-05-21 20:44:25] [INFO ] Invariant cache hit.
[2024-05-21 20:44:26] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-21 20:44:26] [INFO ] Invariant cache hit.
[2024-05-21 20:44:26] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-21 20:44:26] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2024-05-21 20:44:26] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 20:44:26] [INFO ] Invariant cache hit.
[2024-05-21 20:44:26] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 164 ms. Remains : 61/61 places, 73/73 transitions.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 198 edges and 61 vertex of which 60 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 65 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 8377 steps, including 1894 resets, run visited all 2 properties in 84 ms. (steps per millisecond=99 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 145 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 22807 reset in 85 ms.
Product exploration explored 100000 steps with 22844 reset in 86 ms.
Built C files in :
/tmp/ltsmin10432095332806926026
[2024-05-21 20:44:26] [INFO ] Computing symmetric may disable matrix : 73 transitions.
[2024-05-21 20:44:26] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:44:26] [INFO ] Computing symmetric may enable matrix : 73 transitions.
[2024-05-21 20:44:26] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:44:26] [INFO ] Computing Do-Not-Accords matrix : 73 transitions.
[2024-05-21 20:44:26] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 20:44:26] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10432095332806926026
Running compilation step : cd /tmp/ltsmin10432095332806926026;'/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 173 ms.
Running link step : cd /tmp/ltsmin10432095332806926026;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin10432095332806926026;'/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/stateBased200987833819189262.hoa' '--buchi-type=spotba'
LTSmin run took 668 ms.
FORMULA DBSingleClientW-PT-d0m05-LTLFireability-10 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d0m05-LTLFireability-10 finished in 2963 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(X(F(p0)))))'
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 121/121 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 74 transition count 91
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 74 transition count 91
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 36 place count 66 transition count 83
Iterating global reduction 0 with 8 rules applied. Total rules applied 44 place count 66 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 66 transition count 81
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 49 place count 63 transition count 75
Iterating global reduction 1 with 3 rules applied. Total rules applied 52 place count 63 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 53 place count 63 transition count 74
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 55 place count 61 transition count 71
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 61 transition count 71
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 60 transition count 70
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 60 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 61 place count 60 transition count 68
Applied a total of 61 rules in 3 ms. Remains 60 /88 variables (removed 28) and now considering 68/121 (removed 53) transitions.
// Phase 1: matrix 68 rows 60 cols
[2024-05-21 20:44:27] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 20:44:27] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-21 20:44:27] [INFO ] Invariant cache hit.
[2024-05-21 20:44:27] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 20:44:27] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2024-05-21 20:44:27] [INFO ] Invariant cache hit.
[2024-05-21 20:44:27] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 60/88 places, 68/121 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 175 ms. Remains : 60/88 places, 68/121 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m05-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: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s1 1) (GEQ s51 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m05-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m05-LTLFireability-11 finished in 306 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((F(G(p2))||p1))||p0)))'
Support contains 5 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 121/121 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 74 transition count 91
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 74 transition count 91
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 67 transition count 84
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 67 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 67 transition count 82
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 47 place count 64 transition count 76
Iterating global reduction 1 with 3 rules applied. Total rules applied 50 place count 64 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 51 place count 64 transition count 75
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 63 transition count 74
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 63 transition count 74
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 62 transition count 73
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 62 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 57 place count 62 transition count 71
Applied a total of 57 rules in 9 ms. Remains 62 /88 variables (removed 26) and now considering 71/121 (removed 50) transitions.
// Phase 1: matrix 71 rows 62 cols
[2024-05-21 20:44:28] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 20:44:28] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-21 20:44:28] [INFO ] Invariant cache hit.
[2024-05-21 20:44:28] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 20:44:28] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2024-05-21 20:44:28] [INFO ] Invariant cache hit.
[2024-05-21 20:44:28] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 62/88 places, 71/121 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 167 ms. Remains : 62/88 places, 71/121 transitions.
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s50 1)), p1:(OR (LT s14 1) (LT s40 1)), p2:(OR (LT s1 1) (LT s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 22767 reset in 81 ms.
Product exploration explored 100000 steps with 23026 reset in 88 ms.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 200 edges and 62 vertex of which 61 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p1)]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 2 factoid took 123 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Incomplete random walk after 10000 steps, including 2272 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 1036 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 20:44:28] [INFO ] Invariant cache hit.
[2024-05-21 20:44:28] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-21 20:44:28] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-21 20:44:28] [INFO ] After 17ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-21 20:44:28] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 20:44:28] [INFO ] After 7ms SMT Verify possible using 21 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 20:44:28] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 20:44:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 20:44:28] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 20:44:28] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 20:44:28] [INFO ] After 4ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 20:44:29] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-21 20:44:29] [INFO ] After 56ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 71/71 transitions.
Graph (complete) has 183 edges and 62 vertex of which 61 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 61 transition count 70
Applied a total of 2 rules in 4 ms. Remains 61 /62 variables (removed 1) and now considering 70/71 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 61/62 places, 70/71 transitions.
Incomplete random walk after 10000 steps, including 2287 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1032 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 8153 steps, run visited all 1 properties in 12 ms. (steps per millisecond=679 )
Probabilistic random walk after 8153 steps, saw 3562 distinct states, run finished after 12 ms. (steps per millisecond=679 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 p2), (X p1)]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (F (NOT p0)), (F (NOT p2)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 178 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Support contains 5 out of 62 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 71/71 transitions.
Applied a total of 0 rules in 1 ms. Remains 62 /62 variables (removed 0) and now considering 71/71 (removed 0) transitions.
[2024-05-21 20:44:29] [INFO ] Invariant cache hit.
[2024-05-21 20:44:29] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-21 20:44:29] [INFO ] Invariant cache hit.
[2024-05-21 20:44:29] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 20:44:29] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2024-05-21 20:44:29] [INFO ] Invariant cache hit.
[2024-05-21 20:44:29] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 163 ms. Remains : 62/62 places, 71/71 transitions.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 200 edges and 62 vertex of which 61 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p1)]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 2 factoid took 100 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Incomplete random walk after 10000 steps, including 2285 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 1023 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-21 20:44:29] [INFO ] Invariant cache hit.
[2024-05-21 20:44:29] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-21 20:44:29] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 20:44:29] [INFO ] After 16ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-21 20:44:29] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 20:44:29] [INFO ] After 4ms SMT Verify possible using 21 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 20:44:29] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 20:44:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 20:44:29] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 20:44:29] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 20:44:29] [INFO ] After 10ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-21 20:44:29] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-21 20:44:29] [INFO ] After 58ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 71/71 transitions.
Graph (complete) has 183 edges and 62 vertex of which 61 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 61 transition count 70
Applied a total of 2 rules in 3 ms. Remains 61 /62 variables (removed 1) and now considering 70/71 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 61/62 places, 70/71 transitions.
Incomplete random walk after 10000 steps, including 2314 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1020 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 8153 steps, run visited all 1 properties in 12 ms. (steps per millisecond=679 )
Probabilistic random walk after 8153 steps, saw 3562 distinct states, run finished after 12 ms. (steps per millisecond=679 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 p2), (X p1)]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (F (NOT p0)), (F (NOT p2)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 185 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 22899 reset in 78 ms.
Product exploration explored 100000 steps with 22851 reset in 86 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Support contains 5 out of 62 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 62/62 places, 71/71 transitions.
Applied a total of 0 rules in 4 ms. Remains 62 /62 variables (removed 0) and now considering 71/71 (removed 0) transitions.
[2024-05-21 20:44:30] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-21 20:44:30] [INFO ] Invariant cache hit.
[2024-05-21 20:44:30] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55 ms. Remains : 62/62 places, 71/71 transitions.
Built C files in :
/tmp/ltsmin14576130333190567412
[2024-05-21 20:44:30] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14576130333190567412
Running compilation step : cd /tmp/ltsmin14576130333190567412;'/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 135 ms.
Running link step : cd /tmp/ltsmin14576130333190567412;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin14576130333190567412;'/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/stateBased6933746944039779579.hoa' '--buchi-type=spotba'
LTSmin run took 545 ms.
FORMULA DBSingleClientW-PT-d0m05-LTLFireability-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d0m05-LTLFireability-12 finished in 3502 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((X(X(X(F(!p0))))&&G(p1)))))'
Support contains 3 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 121/121 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 76 transition count 95
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 76 transition count 95
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 70 transition count 89
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 70 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 70 transition count 87
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 69 transition count 84
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 69 transition count 84
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 68 transition count 83
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 68 transition count 83
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 67 transition count 82
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 67 transition count 82
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 46 place count 67 transition count 80
Applied a total of 46 rules in 3 ms. Remains 67 /88 variables (removed 21) and now considering 80/121 (removed 41) transitions.
// Phase 1: matrix 80 rows 67 cols
[2024-05-21 20:44:31] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 20:44:31] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-21 20:44:31] [INFO ] Invariant cache hit.
[2024-05-21 20:44:31] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-21 20:44:31] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2024-05-21 20:44:31] [INFO ] Invariant cache hit.
[2024-05-21 20:44:31] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 67/88 places, 80/121 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 169 ms. Remains : 67/88 places, 80/121 transitions.
Stuttering acceptance computed with spot in 261 ms :[(NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true, (OR (NOT p1) p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 6}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 6}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 6}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 6}], [{ cond=p1, acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=true, acceptance={} source=7 dest: 5}]], initial=7, aps=[p1:(AND (GEQ s1 1) (GEQ s61 1)), p0:(OR (LT s1 1) (LT s65 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m05-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m05-LTLFireability-13 finished in 445 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)&&(X((F(p1)&&X(F(!p0))))||G(p0)))))'
Support contains 2 out of 88 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 121/121 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 75 transition count 96
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 75 transition count 96
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 34 place count 67 transition count 88
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 67 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 67 transition count 86
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 47 place count 64 transition count 80
Iterating global reduction 1 with 3 rules applied. Total rules applied 50 place count 64 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 51 place count 64 transition count 79
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 53 place count 62 transition count 76
Iterating global reduction 2 with 2 rules applied. Total rules applied 55 place count 62 transition count 76
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 61 transition count 75
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 61 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 59 place count 61 transition count 73
Applied a total of 59 rules in 11 ms. Remains 61 /88 variables (removed 27) and now considering 73/121 (removed 48) transitions.
// Phase 1: matrix 73 rows 61 cols
[2024-05-21 20:44:32] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 20:44:32] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-21 20:44:32] [INFO ] Invariant cache hit.
[2024-05-21 20:44:32] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-21 20:44:32] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2024-05-21 20:44:32] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 20:44:32] [INFO ] Invariant cache hit.
[2024-05-21 20:44:32] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/88 places, 73/121 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 164 ms. Remains : 61/88 places, 73/121 transitions.
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m05-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m05-LTLFireability-14 finished in 234 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((X(G(p0))&&G(p1)))))'
Support contains 3 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 121/121 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 76 transition count 99
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 76 transition count 99
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 69 transition count 92
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 69 transition count 92
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 69 transition count 90
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 67 transition count 85
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 67 transition count 85
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 45 place count 67 transition count 84
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 66 transition count 83
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 66 transition count 83
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 65 transition count 82
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 65 transition count 82
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 51 place count 65 transition count 80
Applied a total of 51 rules in 3 ms. Remains 65 /88 variables (removed 23) and now considering 80/121 (removed 41) transitions.
// Phase 1: matrix 80 rows 65 cols
[2024-05-21 20:44:32] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 20:44:32] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-21 20:44:32] [INFO ] Invariant cache hit.
[2024-05-21 20:44:32] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-21 20:44:32] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2024-05-21 20:44:32] [INFO ] Invariant cache hit.
[2024-05-21 20:44:32] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 65/88 places, 80/121 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 156 ms. Remains : 65/88 places, 80/121 transitions.
Stuttering acceptance computed with spot in 180 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p1:(AND (GEQ s1 1) (GEQ s63 1)), p0:(OR (LT s1 1) (LT s63 1) (AND (GEQ s1 1) (GEQ s44 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m05-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m05-LTLFireability-15 finished in 350 ms.
All properties solved by simple procedures.
Total runtime 24234 ms.

BK_STOP 1716324273525

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

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