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.r597-smll-171734926400048.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 MedleyA-PT-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r597-smll-171734926400048
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 6.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.9K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 107K Jun 2 16:33 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 MedleyA-PT-10-LTLFireability-00
FORMULA_NAME MedleyA-PT-10-LTLFireability-01
FORMULA_NAME MedleyA-PT-10-LTLFireability-02
FORMULA_NAME MedleyA-PT-10-LTLFireability-03
FORMULA_NAME MedleyA-PT-10-LTLFireability-04
FORMULA_NAME MedleyA-PT-10-LTLFireability-05
FORMULA_NAME MedleyA-PT-10-LTLFireability-06
FORMULA_NAME MedleyA-PT-10-LTLFireability-07
FORMULA_NAME MedleyA-PT-10-LTLFireability-08
FORMULA_NAME MedleyA-PT-10-LTLFireability-09
FORMULA_NAME MedleyA-PT-10-LTLFireability-10
FORMULA_NAME MedleyA-PT-10-LTLFireability-11
FORMULA_NAME MedleyA-PT-10-LTLFireability-12
FORMULA_NAME MedleyA-PT-10-LTLFireability-13
FORMULA_NAME MedleyA-PT-10-LTLFireability-14
FORMULA_NAME MedleyA-PT-10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717362226581

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=MedleyA-PT-10
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-06-02 21:03:49] [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-06-02 21:03:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:03:49] [INFO ] Load time of PNML (sax parser for PT used): 119 ms
[2024-06-02 21:03:49] [INFO ] Transformed 149 places.
[2024-06-02 21:03:49] [INFO ] Transformed 340 transitions.
[2024-06-02 21:03:49] [INFO ] Found NUPN structural information;
[2024-06-02 21:03:49] [INFO ] Parsed PT model containing 149 places and 340 transitions and 1721 arcs in 245 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-10-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 149 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 340/340 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 146 transition count 340
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 41 place count 108 transition count 295
Iterating global reduction 1 with 38 rules applied. Total rules applied 79 place count 108 transition count 295
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 82 place count 108 transition count 292
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 87 place count 103 transition count 287
Iterating global reduction 2 with 5 rules applied. Total rules applied 92 place count 103 transition count 287
Applied a total of 92 rules in 53 ms. Remains 103 /149 variables (removed 46) and now considering 287/340 (removed 53) transitions.
// Phase 1: matrix 287 rows 103 cols
[2024-06-02 21:03:50] [INFO ] Computed 10 invariants in 25 ms
[2024-06-02 21:03:50] [INFO ] Implicit Places using invariants in 268 ms returned []
[2024-06-02 21:03:50] [INFO ] Invariant cache hit.
[2024-06-02 21:03:51] [INFO ] Implicit Places using invariants and state equation in 531 ms returned []
Implicit Place search using SMT with State Equation took 843 ms to find 0 implicit places.
[2024-06-02 21:03:51] [INFO ] Invariant cache hit.
[2024-06-02 21:03:51] [INFO ] Dead Transitions using invariants and state equation in 450 ms found 64 transitions.
Found 64 dead transitions using SMT.
Drop transitions removed 64 transitions
Dead transitions reduction (with SMT) removed 64 transitions
Starting structural reductions in LTL mode, iteration 1 : 103/149 places, 223/340 transitions.
Applied a total of 0 rules in 4 ms. Remains 103 /103 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1354 ms. Remains : 103/149 places, 223/340 transitions.
Support contains 36 out of 103 places after structural reductions.
[2024-06-02 21:03:52] [INFO ] Flatten gal took : 81 ms
[2024-06-02 21:03:52] [INFO ] Flatten gal took : 37 ms
[2024-06-02 21:03:52] [INFO ] Input system was already deterministic with 223 transitions.
Incomplete random walk after 10000 steps, including 431 resets, run finished after 490 ms. (steps per millisecond=20 ) properties (out of 31) seen :10
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :1
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
// Phase 1: matrix 223 rows 103 cols
[2024-06-02 21:03:52] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 21:03:53] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-02 21:03:53] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 4 ms returned sat
[2024-06-02 21:03:53] [INFO ] After 520ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:17
[2024-06-02 21:03:53] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-06-02 21:03:53] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 4 ms returned sat
[2024-06-02 21:03:54] [INFO ] After 485ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :13
[2024-06-02 21:03:54] [INFO ] After 1035ms SMT Verify possible using trap constraints in natural domain returned unsat :7 sat :13
Attempting to minimize the solution found.
Minimization took 331 ms.
[2024-06-02 21:03:55] [INFO ] After 1654ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :13
Fused 20 Parikh solutions to 13 different solutions.
Parikh walk visited 7 properties in 119 ms.
Support contains 11 out of 103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 103/103 places, 223/223 transitions.
Graph (complete) has 412 edges and 103 vertex of which 101 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 101 transition count 212
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 18 place count 93 transition count 212
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 18 place count 93 transition count 208
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 26 place count 89 transition count 208
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 28 place count 87 transition count 205
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 87 transition count 205
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 86 transition count 201
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 86 transition count 201
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 25 rules applied. Total rules applied 57 place count 73 transition count 189
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 59 place count 71 transition count 187
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 71 transition count 187
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -89
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 75 place count 64 transition count 276
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 107 place count 64 transition count 244
Drop transitions removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 3 with 39 rules applied. Total rules applied 146 place count 64 transition count 205
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 146 place count 64 transition count 201
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 154 place count 60 transition count 201
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 158 place count 60 transition count 197
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 162 place count 56 transition count 197
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 164 place count 56 transition count 197
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 165 place count 55 transition count 196
Applied a total of 165 rules in 123 ms. Remains 55 /103 variables (removed 48) and now considering 196/223 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 55/103 places, 196/223 transitions.
Incomplete random walk after 10000 steps, including 1006 resets, run finished after 325 ms. (steps per millisecond=30 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 120 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 186 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 189 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 130 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 112 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 146 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Finished probabilistic random walk after 557603 steps, run visited all 6 properties in 2681 ms. (steps per millisecond=207 )
Probabilistic random walk after 557603 steps, saw 127990 distinct states, run finished after 2681 ms. (steps per millisecond=207 ) properties seen :6
Parikh walk visited 0 properties in 0 ms.
FORMULA MedleyA-PT-10-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 5 atomic propositions for a total of 14 simplifications.
FORMULA MedleyA-PT-10-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-10-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-10-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 9 stabilizing places and 9 stable transitions
Graph (complete) has 412 edges and 103 vertex of which 101 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 5 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 223/223 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 95 transition count 203
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 95 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 95 transition count 202
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 90 transition count 190
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 90 transition count 190
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 30 place count 87 transition count 181
Iterating global reduction 1 with 3 rules applied. Total rules applied 33 place count 87 transition count 181
Applied a total of 33 rules in 16 ms. Remains 87 /103 variables (removed 16) and now considering 181/223 (removed 42) transitions.
// Phase 1: matrix 181 rows 87 cols
[2024-06-02 21:03:59] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 21:03:59] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-06-02 21:03:59] [INFO ] Invariant cache hit.
[2024-06-02 21:03:59] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
[2024-06-02 21:03:59] [INFO ] Invariant cache hit.
[2024-06-02 21:03:59] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 87/103 places, 181/223 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 433 ms. Remains : 87/103 places, 181/223 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 300 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (NEQ s57 1) (AND (EQ s6 1) (EQ s33 1) (EQ s69 1) (EQ s79 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]]
Product exploration explored 100000 steps with 33333 reset in 368 ms.
Product exploration explored 100000 steps with 33333 reset in 289 ms.
Computed a total of 9 stabilizing places and 9 stable transitions
Graph (complete) has 346 edges and 87 vertex of which 86 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 9 stabilizing places and 9 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 19 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-10-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-10-LTLFireability-00 finished in 1499 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(G(p1))))'
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 223/223 transitions.
Graph (complete) has 412 edges and 103 vertex of which 101 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 100 transition count 209
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 89 transition count 208
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 24 place count 89 transition count 205
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 30 place count 86 transition count 205
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 35 place count 81 transition count 192
Iterating global reduction 2 with 5 rules applied. Total rules applied 40 place count 81 transition count 192
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 40 place count 81 transition count 191
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 42 place count 80 transition count 191
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 46 place count 76 transition count 181
Iterating global reduction 2 with 4 rules applied. Total rules applied 50 place count 76 transition count 181
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 75 transition count 178
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 75 transition count 178
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 80 place count 60 transition count 165
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 82 place count 60 transition count 163
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 85 place count 57 transition count 158
Iterating global reduction 3 with 3 rules applied. Total rules applied 88 place count 57 transition count 158
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 100 place count 51 transition count 192
Drop transitions removed 44 transitions
Redundant transition composition rules discarded 44 transitions
Iterating global reduction 3 with 44 rules applied. Total rules applied 144 place count 51 transition count 148
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 144 place count 51 transition count 146
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 148 place count 49 transition count 146
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 154 place count 46 transition count 177
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 156 place count 46 transition count 175
Applied a total of 156 rules in 66 ms. Remains 46 /103 variables (removed 57) and now considering 175/223 (removed 48) transitions.
// Phase 1: matrix 175 rows 46 cols
[2024-06-02 21:04:00] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 21:04:00] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-02 21:04:00] [INFO ] Invariant cache hit.
[2024-06-02 21:04:00] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-06-02 21:04:01] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
[2024-06-02 21:04:01] [INFO ] Redundant transitions in 9 ms returned []
[2024-06-02 21:04:01] [INFO ] Invariant cache hit.
[2024-06-02 21:04:01] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/103 places, 175/223 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 470 ms. Remains : 46/103 places, 175/223 transitions.
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s3 0) (EQ s10 0) (EQ s17 0)), p1:(OR (NEQ s3 1) (NEQ s10 1) (NEQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 13779 reset in 485 ms.
Product exploration explored 100000 steps with 13772 reset in 410 ms.
Computed a total of 6 stabilizing places and 66 stable transitions
Computed a total of 6 stabilizing places and 66 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 105 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p1)]
Incomplete random walk after 10000 steps, including 1371 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 266 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Finished probabilistic random walk after 145259 steps, run visited all 1 properties in 339 ms. (steps per millisecond=428 )
Probabilistic random walk after 145259 steps, saw 33318 distinct states, run finished after 340 ms. (steps per millisecond=427 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 187 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p1)]
Support contains 3 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 175/175 transitions.
Applied a total of 0 rules in 9 ms. Remains 46 /46 variables (removed 0) and now considering 175/175 (removed 0) transitions.
[2024-06-02 21:04:03] [INFO ] Invariant cache hit.
[2024-06-02 21:04:03] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-02 21:04:03] [INFO ] Invariant cache hit.
[2024-06-02 21:04:03] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-06-02 21:04:03] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
[2024-06-02 21:04:03] [INFO ] Redundant transitions in 9 ms returned []
[2024-06-02 21:04:03] [INFO ] Invariant cache hit.
[2024-06-02 21:04:03] [INFO ] Dead Transitions using invariants and state equation in 191 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 552 ms. Remains : 46/46 places, 175/175 transitions.
Computed a total of 6 stabilizing places and 66 stable transitions
Computed a total of 6 stabilizing places and 66 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 160 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p1)]
Incomplete random walk after 10000 steps, including 1352 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 269 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Finished probabilistic random walk after 145259 steps, run visited all 1 properties in 411 ms. (steps per millisecond=353 )
Probabilistic random walk after 145259 steps, saw 33318 distinct states, run finished after 418 ms. (steps per millisecond=347 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 381 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 168 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 146 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 142 ms :[(NOT p1)]
Product exploration explored 100000 steps with 13802 reset in 531 ms.
Product exploration explored 100000 steps with 13791 reset in 576 ms.
Built C files in :
/tmp/ltsmin6209064285221040936
[2024-06-02 21:04:06] [INFO ] Computing symmetric may disable matrix : 175 transitions.
[2024-06-02 21:04:06] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:04:06] [INFO ] Computing symmetric may enable matrix : 175 transitions.
[2024-06-02 21:04:06] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:04:06] [INFO ] Computing Do-Not-Accords matrix : 175 transitions.
[2024-06-02 21:04:06] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:04:06] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6209064285221040936
Running compilation step : cd /tmp/ltsmin6209064285221040936;'/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 905 ms.
Running link step : cd /tmp/ltsmin6209064285221040936;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin6209064285221040936;'/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/stateBased9897830664614034878.hoa' '--buchi-type=spotba'
LTSmin run took 2161 ms.
FORMULA MedleyA-PT-10-LTLFireability-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-10-LTLFireability-02 finished in 8976 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p0)&&F(G(p1))))||G(p2)))'
Support contains 6 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 223/223 transitions.
Graph (complete) has 412 edges and 103 vertex of which 102 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.24 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 101 transition count 212
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 11 rules applied. Total rules applied 21 place count 92 transition count 210
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 23 place count 91 transition count 209
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 23 place count 91 transition count 206
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 29 place count 88 transition count 206
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 36 place count 81 transition count 187
Iterating global reduction 3 with 7 rules applied. Total rules applied 43 place count 81 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 44 place count 81 transition count 186
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 49 place count 76 transition count 174
Iterating global reduction 4 with 5 rules applied. Total rules applied 54 place count 76 transition count 174
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 57 place count 73 transition count 165
Iterating global reduction 4 with 3 rules applied. Total rules applied 60 place count 73 transition count 165
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 88 place count 58 transition count 152
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 90 place count 58 transition count 150
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 92 place count 56 transition count 148
Iterating global reduction 5 with 2 rules applied. Total rules applied 94 place count 56 transition count 148
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 108 place count 49 transition count 172
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 116 place count 49 transition count 164
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 118 place count 48 transition count 175
Applied a total of 118 rules in 81 ms. Remains 48 /103 variables (removed 55) and now considering 175/223 (removed 48) transitions.
// Phase 1: matrix 175 rows 48 cols
[2024-06-02 21:04:09] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 21:04:09] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-02 21:04:09] [INFO ] Invariant cache hit.
[2024-06-02 21:04:10] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 21:04:10] [INFO ] Implicit Places using invariants and state equation in 482 ms returned []
Implicit Place search using SMT with State Equation took 589 ms to find 0 implicit places.
[2024-06-02 21:04:10] [INFO ] Redundant transitions in 3 ms returned []
[2024-06-02 21:04:10] [INFO ] Invariant cache hit.
[2024-06-02 21:04:10] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/103 places, 175/223 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 822 ms. Remains : 48/103 places, 175/223 transitions.
Stuttering acceptance computed with spot in 303 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s39 1), p0:(OR (EQ s3 0) (EQ s17 0) (EQ s21 0) (EQ s26 0)), p1:(EQ s24 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-10-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-10-LTLFireability-03 finished in 1149 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(!p0) U p1))))'
Support contains 8 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 223/223 transitions.
Graph (complete) has 412 edges and 103 vertex of which 101 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 100 transition count 210
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 23 place count 90 transition count 208
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 23 place count 90 transition count 204
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 31 place count 86 transition count 204
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 37 place count 80 transition count 186
Iterating global reduction 2 with 6 rules applied. Total rules applied 43 place count 80 transition count 186
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 48 place count 75 transition count 174
Iterating global reduction 2 with 5 rules applied. Total rules applied 53 place count 75 transition count 174
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 55 place count 73 transition count 168
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 73 transition count 168
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 79 place count 62 transition count 157
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 82 place count 62 transition count 154
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 84 place count 60 transition count 150
Iterating global reduction 3 with 2 rules applied. Total rules applied 86 place count 60 transition count 150
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 100 place count 53 transition count 174
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 108 place count 53 transition count 166
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 112 place count 51 transition count 189
Applied a total of 112 rules in 60 ms. Remains 51 /103 variables (removed 52) and now considering 189/223 (removed 34) transitions.
// Phase 1: matrix 189 rows 51 cols
[2024-06-02 21:04:10] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 21:04:11] [INFO ] Implicit Places using invariants in 73 ms returned [24]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 85 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/103 places, 189/223 transitions.
Applied a total of 0 rules in 12 ms. Remains 50 /50 variables (removed 0) and now considering 189/189 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 175 ms. Remains : 50/103 places, 189/223 transitions.
Stuttering acceptance computed with spot in 171 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : MedleyA-PT-10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s4 1) (EQ s8 1) (EQ s40 1) (EQ s42 1)), p0:(AND (EQ s6 1) (EQ s11 1) (EQ s24 1) (EQ s26 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-10-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-10-LTLFireability-04 finished in 376 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 223/223 transitions.
Graph (complete) has 412 edges and 103 vertex of which 101 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 100 transition count 209
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 25 place count 89 transition count 207
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 25 place count 89 transition count 202
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 35 place count 84 transition count 202
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 41 place count 78 transition count 184
Iterating global reduction 2 with 6 rules applied. Total rules applied 47 place count 78 transition count 184
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 47 place count 78 transition count 183
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 49 place count 77 transition count 183
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 54 place count 72 transition count 171
Iterating global reduction 2 with 5 rules applied. Total rules applied 59 place count 72 transition count 171
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 61 place count 70 transition count 165
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 70 transition count 165
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 93 place count 54 transition count 151
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 96 place count 54 transition count 148
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 99 place count 51 transition count 143
Iterating global reduction 3 with 3 rules applied. Total rules applied 102 place count 51 transition count 143
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 116 place count 44 transition count 176
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 124 place count 44 transition count 168
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 126 place count 43 transition count 179
Applied a total of 126 rules in 46 ms. Remains 43 /103 variables (removed 60) and now considering 179/223 (removed 44) transitions.
// Phase 1: matrix 179 rows 43 cols
[2024-06-02 21:04:11] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 21:04:11] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-02 21:04:11] [INFO ] Invariant cache hit.
[2024-06-02 21:04:11] [INFO ] State equation strengthened by 102 read => feed constraints.
[2024-06-02 21:04:11] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
[2024-06-02 21:04:11] [INFO ] Redundant transitions in 2 ms returned []
[2024-06-02 21:04:11] [INFO ] Invariant cache hit.
[2024-06-02 21:04:11] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/103 places, 179/223 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 483 ms. Remains : 43/103 places, 179/223 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s20 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 30 steps with 6 reset in 0 ms.
FORMULA MedleyA-PT-10-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-10-LTLFireability-05 finished in 594 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 G((!p0&&F(p1)))))'
Support contains 6 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 223/223 transitions.
Graph (complete) has 412 edges and 103 vertex of which 101 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 100 transition count 210
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 23 place count 90 transition count 208
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 23 place count 90 transition count 204
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 31 place count 86 transition count 204
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 37 place count 80 transition count 186
Iterating global reduction 2 with 6 rules applied. Total rules applied 43 place count 80 transition count 186
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 48 place count 75 transition count 174
Iterating global reduction 2 with 5 rules applied. Total rules applied 53 place count 75 transition count 174
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 55 place count 73 transition count 168
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 73 transition count 168
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 85 place count 58 transition count 155
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 88 place count 58 transition count 152
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 91 place count 55 transition count 147
Iterating global reduction 3 with 3 rules applied. Total rules applied 94 place count 55 transition count 147
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 108 place count 48 transition count 171
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 116 place count 48 transition count 163
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 118 place count 47 transition count 174
Applied a total of 118 rules in 30 ms. Remains 47 /103 variables (removed 56) and now considering 174/223 (removed 49) transitions.
// Phase 1: matrix 174 rows 47 cols
[2024-06-02 21:04:11] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 21:04:11] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-02 21:04:11] [INFO ] Invariant cache hit.
[2024-06-02 21:04:12] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-02 21:04:12] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2024-06-02 21:04:12] [INFO ] Redundant transitions in 2 ms returned []
[2024-06-02 21:04:12] [INFO ] Invariant cache hit.
[2024-06-02 21:04:12] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/103 places, 174/223 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 346 ms. Remains : 47/103 places, 174/223 transitions.
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p1) p0), (NOT p1), (OR (NOT p1) p0), true]
Running random walk in product with property : MedleyA-PT-10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s20 1) (EQ s34 1) (EQ s37 1) (EQ s41 1)), p1:(AND (EQ s3 1) (EQ s7 1) (EQ s20 1) (EQ s34 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-10-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-10-LTLFireability-06 finished in 518 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 (G(!p0)||p1)) U (G((!p0 U (p1||G(!p0))))||(X(X(F(!p0)))&&(!p0 U (p1||G(!p0)))))))'
Support contains 6 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 223/223 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 96 transition count 208
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 96 transition count 208
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 96 transition count 207
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 19 place count 92 transition count 197
Iterating global reduction 1 with 4 rules applied. Total rules applied 23 place count 92 transition count 197
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 90 transition count 191
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 90 transition count 191
Applied a total of 27 rules in 6 ms. Remains 90 /103 variables (removed 13) and now considering 191/223 (removed 32) transitions.
// Phase 1: matrix 191 rows 90 cols
[2024-06-02 21:04:12] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 21:04:12] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-06-02 21:04:12] [INFO ] Invariant cache hit.
[2024-06-02 21:04:12] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2024-06-02 21:04:12] [INFO ] Invariant cache hit.
[2024-06-02 21:04:12] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 90/103 places, 191/223 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 381 ms. Remains : 90/103 places, 191/223 transitions.
Stuttering acceptance computed with spot in 248 ms :[(AND p0 (NOT p1)), true, (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, (AND p0 (NOT p1))]
Running random walk in product with property : MedleyA-PT-10-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(OR (NOT p0) p1), acceptance={} source=2 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=p0, acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s41 1) (EQ s47 1) (EQ s63 1)), p1:(AND (EQ s41 1) (EQ s69 1) (EQ s72 1) (EQ s84 1) (NOT (AND (EQ s41 1) (EQ s47 1) (EQ s63 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]]
Entered a terminal (fully accepting) state of product in 43072 steps with 3365 reset in 121 ms.
FORMULA MedleyA-PT-10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-10-LTLFireability-07 finished in 774 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)) U (p1||F(p2))))'
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 223/223 transitions.
Graph (complete) has 412 edges and 103 vertex of which 101 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 100 transition count 208
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 27 place count 88 transition count 206
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 27 place count 88 transition count 202
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 35 place count 84 transition count 202
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 39 place count 80 transition count 190
Iterating global reduction 2 with 4 rules applied. Total rules applied 43 place count 80 transition count 190
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 47 place count 76 transition count 180
Iterating global reduction 2 with 4 rules applied. Total rules applied 51 place count 76 transition count 180
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 75 transition count 177
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 75 transition count 177
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 85 place count 58 transition count 162
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 88 place count 58 transition count 159
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 91 place count 55 transition count 154
Iterating global reduction 3 with 3 rules applied. Total rules applied 94 place count 55 transition count 154
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 110 place count 47 transition count 195
Drop transitions removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 3 with 30 rules applied. Total rules applied 140 place count 47 transition count 165
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 142 place count 46 transition count 176
Applied a total of 142 rules in 30 ms. Remains 46 /103 variables (removed 57) and now considering 176/223 (removed 47) transitions.
// Phase 1: matrix 176 rows 46 cols
[2024-06-02 21:04:13] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 21:04:13] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-02 21:04:13] [INFO ] Invariant cache hit.
[2024-06-02 21:04:13] [INFO ] State equation strengthened by 98 read => feed constraints.
[2024-06-02 21:04:13] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
[2024-06-02 21:04:13] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 21:04:13] [INFO ] Invariant cache hit.
[2024-06-02 21:04:13] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/103 places, 176/223 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 392 ms. Remains : 46/103 places, 176/223 transitions.
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : MedleyA-PT-10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NEQ s29 1) (EQ s18 1)), p2:(EQ s1 1), p0:(EQ s29 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 37496 reset in 384 ms.
Product exploration explored 100000 steps with 37488 reset in 438 ms.
Computed a total of 7 stabilizing places and 69 stable transitions
Computed a total of 7 stabilizing places and 69 stable transitions
Detected a total of 7/46 stabilizing places and 69/176 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
Knowledge based reduction with 2 factoid took 327 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p0))))]
Knowledge based reduction with 2 factoid took 376 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
[2024-06-02 21:04:15] [INFO ] Invariant cache hit.
[2024-06-02 21:04:15] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-02 21:04:15] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-02 21:04:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:04:15] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2024-06-02 21:04:15] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:04:15] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-06-02 21:04:15] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-02 21:04:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:04:15] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-06-02 21:04:15] [INFO ] State equation strengthened by 98 read => feed constraints.
[2024-06-02 21:04:15] [INFO ] [Nat]Added 98 Read/Feed constraints in 12 ms returned sat
[2024-06-02 21:04:15] [INFO ] Computed and/alt/rep : 37/219/37 causal constraints (skipped 136 transitions) in 27 ms.
[2024-06-02 21:04:15] [INFO ] Added : 0 causal constraints over 0 iterations in 55 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 3 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 176/176 transitions.
Applied a total of 0 rules in 4 ms. Remains 46 /46 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2024-06-02 21:04:15] [INFO ] Invariant cache hit.
[2024-06-02 21:04:15] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 21:04:15] [INFO ] Invariant cache hit.
[2024-06-02 21:04:15] [INFO ] State equation strengthened by 98 read => feed constraints.
[2024-06-02 21:04:16] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2024-06-02 21:04:16] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 21:04:16] [INFO ] Invariant cache hit.
[2024-06-02 21:04:16] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 372 ms. Remains : 46/46 places, 176/176 transitions.
Computed a total of 7 stabilizing places and 69 stable transitions
Computed a total of 7 stabilizing places and 69 stable transitions
Detected a total of 7/46 stabilizing places and 69/176 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
Knowledge based reduction with 2 factoid took 465 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p0))))]
Knowledge based reduction with 2 factoid took 391 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
[2024-06-02 21:04:17] [INFO ] Invariant cache hit.
[2024-06-02 21:04:17] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-02 21:04:17] [INFO ] [Real]Absence check using 6 positive and 2 generalized place invariants in 5 ms returned sat
[2024-06-02 21:04:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:04:17] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2024-06-02 21:04:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:04:17] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-06-02 21:04:17] [INFO ] [Nat]Absence check using 6 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-02 21:04:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:04:17] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-06-02 21:04:17] [INFO ] State equation strengthened by 98 read => feed constraints.
[2024-06-02 21:04:17] [INFO ] [Nat]Added 98 Read/Feed constraints in 14 ms returned sat
[2024-06-02 21:04:17] [INFO ] Computed and/alt/rep : 37/219/37 causal constraints (skipped 136 transitions) in 24 ms.
[2024-06-02 21:04:17] [INFO ] Added : 0 causal constraints over 0 iterations in 45 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 37540 reset in 505 ms.
Product exploration explored 100000 steps with 37408 reset in 472 ms.
Built C files in :
/tmp/ltsmin8752170848608511688
[2024-06-02 21:04:18] [INFO ] Computing symmetric may disable matrix : 176 transitions.
[2024-06-02 21:04:18] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:04:18] [INFO ] Computing symmetric may enable matrix : 176 transitions.
[2024-06-02 21:04:18] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:04:18] [INFO ] Computing Do-Not-Accords matrix : 176 transitions.
[2024-06-02 21:04:18] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:04:18] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8752170848608511688
Running compilation step : cd /tmp/ltsmin8752170848608511688;'/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 679 ms.
Running link step : cd /tmp/ltsmin8752170848608511688;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin8752170848608511688;'/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/stateBased4274761150414933185.hoa' '--buchi-type=spotba'
LTSmin run took 208 ms.
FORMULA MedleyA-PT-10-LTLFireability-08 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-10-LTLFireability-08 finished in 6732 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&&G(p1)))))))'
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 223/223 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 97 transition count 208
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 97 transition count 208
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 93 transition count 199
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 93 transition count 199
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 91 transition count 193
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 91 transition count 193
Applied a total of 24 rules in 4 ms. Remains 91 /103 variables (removed 12) and now considering 193/223 (removed 30) transitions.
// Phase 1: matrix 193 rows 91 cols
[2024-06-02 21:04:19] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 21:04:19] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-02 21:04:19] [INFO ] Invariant cache hit.
[2024-06-02 21:04:20] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
[2024-06-02 21:04:20] [INFO ] Invariant cache hit.
[2024-06-02 21:04:20] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 91/103 places, 193/223 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 392 ms. Remains : 91/103 places, 193/223 transitions.
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : MedleyA-PT-10-LTLFireability-11 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=(OR (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s43 0) (EQ s49 0) (EQ s68 0)), p1:(EQ s33 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 4401 reset in 149 ms.
Product exploration explored 100000 steps with 4391 reset in 164 ms.
Computed a total of 9 stabilizing places and 9 stable transitions
Graph (complete) has 363 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Computed a total of 9 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 288 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 431 resets, run finished after 281 ms. (steps per millisecond=35 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 109 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 110 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 107 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 615600 steps, run timeout after 3001 ms. (steps per millisecond=205 ) properties seen :{}
Probabilistic random walk after 615600 steps, saw 123445 distinct states, run finished after 3004 ms. (steps per millisecond=204 ) properties seen :0
Running SMT prover for 3 properties.
[2024-06-02 21:04:24] [INFO ] Invariant cache hit.
[2024-06-02 21:04:24] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-02 21:04:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-02 21:04:24] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 3 ms returned sat
[2024-06-02 21:04:24] [INFO ] After 118ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-02 21:04:24] [INFO ] After 192ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 61 ms.
[2024-06-02 21:04:25] [INFO ] After 306ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 44 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=22 )
Parikh walk visited 3 properties in 1 ms.
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(F (OR (NOT p0) (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 2 factoid took 153 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 4 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 193/193 transitions.
Applied a total of 0 rules in 1 ms. Remains 91 /91 variables (removed 0) and now considering 193/193 (removed 0) transitions.
[2024-06-02 21:04:25] [INFO ] Invariant cache hit.
[2024-06-02 21:04:25] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-02 21:04:25] [INFO ] Invariant cache hit.
[2024-06-02 21:04:25] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2024-06-02 21:04:25] [INFO ] Invariant cache hit.
[2024-06-02 21:04:26] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 358 ms. Remains : 91/91 places, 193/193 transitions.
Computed a total of 9 stabilizing places and 9 stable transitions
Graph (complete) has 363 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 9 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 436 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 108 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 874045 steps, run timeout after 3001 ms. (steps per millisecond=291 ) properties seen :{}
Probabilistic random walk after 874045 steps, saw 166605 distinct states, run finished after 3001 ms. (steps per millisecond=291 ) properties seen :0
Running SMT prover for 3 properties.
[2024-06-02 21:04:29] [INFO ] Invariant cache hit.
[2024-06-02 21:04:29] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-02 21:04:29] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-02 21:04:29] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 3 ms returned sat
[2024-06-02 21:04:29] [INFO ] After 126ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-02 21:04:29] [INFO ] After 204ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 69 ms.
[2024-06-02 21:04:29] [INFO ] After 345ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 42 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=14 )
Parikh walk visited 3 properties in 2 ms.
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(F (OR (NOT p0) (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 2 factoid took 166 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 4380 reset in 151 ms.
Product exploration explored 100000 steps with 4352 reset in 165 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 4 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 193/193 transitions.
Graph (complete) has 363 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 90 transition count 192
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 13 place count 90 transition count 190
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 13 place count 90 transition count 193
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 17 place count 90 transition count 193
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 20 place count 87 transition count 190
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 23 place count 87 transition count 190
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 2 with 17 rules applied. Total rules applied 40 place count 87 transition count 192
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 42 place count 87 transition count 190
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 47 place count 82 transition count 183
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 3 with 5 rules applied. Total rules applied 52 place count 82 transition count 183
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -69
Deduced a syphon composed of 33 places in 0 ms
Iterating global reduction 3 with 8 rules applied. Total rules applied 60 place count 82 transition count 252
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 63 place count 79 transition count 246
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 66 place count 79 transition count 246
Deduced a syphon composed of 30 places in 0 ms
Drop transitions removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 3 with 39 rules applied. Total rules applied 105 place count 79 transition count 207
Deduced a syphon composed of 30 places in 0 ms
Applied a total of 105 rules in 33 ms. Remains 79 /91 variables (removed 12) and now considering 207/193 (removed -14) transitions.
[2024-06-02 21:04:31] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 207 rows 79 cols
[2024-06-02 21:04:31] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 21:04:31] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 79/91 places, 207/193 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 178 ms. Remains : 79/91 places, 207/193 transitions.
Built C files in :
/tmp/ltsmin8651659101440909045
[2024-06-02 21:04:31] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8651659101440909045
Running compilation step : cd /tmp/ltsmin8651659101440909045;'/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 513 ms.
Running link step : cd /tmp/ltsmin8651659101440909045;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin8651659101440909045;'/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/stateBased17655741471795651347.hoa' '--buchi-type=spotba'
LTSmin run took 6128 ms.
FORMULA MedleyA-PT-10-LTLFireability-11 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-10-LTLFireability-11 finished in 18517 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(G(p1)))))'
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 223/223 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 96 transition count 205
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 96 transition count 205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 96 transition count 204
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 93 transition count 198
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 93 transition count 198
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 92 transition count 195
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 92 transition count 195
Applied a total of 23 rules in 7 ms. Remains 92 /103 variables (removed 11) and now considering 195/223 (removed 28) transitions.
// Phase 1: matrix 195 rows 92 cols
[2024-06-02 21:04:38] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 21:04:38] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-02 21:04:38] [INFO ] Invariant cache hit.
[2024-06-02 21:04:38] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2024-06-02 21:04:38] [INFO ] Invariant cache hit.
[2024-06-02 21:04:38] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 92/103 places, 195/223 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 353 ms. Remains : 92/103 places, 195/223 transitions.
Stuttering acceptance computed with spot in 235 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : MedleyA-PT-10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s27 1), p1:(OR (EQ s8 0) (EQ s32 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7689 steps with 344 reset in 11 ms.
FORMULA MedleyA-PT-10-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-10-LTLFireability-13 finished in 619 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 223/223 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 96 transition count 208
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 96 transition count 208
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 96 transition count 207
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 19 place count 92 transition count 197
Iterating global reduction 1 with 4 rules applied. Total rules applied 23 place count 92 transition count 197
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 90 transition count 191
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 90 transition count 191
Applied a total of 27 rules in 8 ms. Remains 90 /103 variables (removed 13) and now considering 191/223 (removed 32) transitions.
// Phase 1: matrix 191 rows 90 cols
[2024-06-02 21:04:39] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 21:04:39] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-02 21:04:39] [INFO ] Invariant cache hit.
[2024-06-02 21:04:39] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
[2024-06-02 21:04:39] [INFO ] Invariant cache hit.
[2024-06-02 21:04:39] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 90/103 places, 191/223 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 384 ms. Remains : 90/103 places, 191/223 transitions.
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-10-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s41 1) (EQ s56 1) (EQ s66 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-10-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-10-LTLFireability-15 finished in 506 ms.
All properties solved by simple procedures.
Total runtime 49815 ms.

BK_STOP 1717362280739

--------------------
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="MedleyA-PT-10"
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 MedleyA-PT-10, 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 r597-smll-171734926400048"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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