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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 4.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 46K 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 39K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 8.0K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K 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 130K 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-20-LTLFireability-00
FORMULA_NAME MedleyA-PT-20-LTLFireability-01
FORMULA_NAME MedleyA-PT-20-LTLFireability-02
FORMULA_NAME MedleyA-PT-20-LTLFireability-03
FORMULA_NAME MedleyA-PT-20-LTLFireability-04
FORMULA_NAME MedleyA-PT-20-LTLFireability-05
FORMULA_NAME MedleyA-PT-20-LTLFireability-06
FORMULA_NAME MedleyA-PT-20-LTLFireability-07
FORMULA_NAME MedleyA-PT-20-LTLFireability-08
FORMULA_NAME MedleyA-PT-20-LTLFireability-09
FORMULA_NAME MedleyA-PT-20-LTLFireability-10
FORMULA_NAME MedleyA-PT-20-LTLFireability-11
FORMULA_NAME MedleyA-PT-20-LTLFireability-12
FORMULA_NAME MedleyA-PT-20-LTLFireability-13
FORMULA_NAME MedleyA-PT-20-LTLFireability-14
FORMULA_NAME MedleyA-PT-20-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717367327656

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-20
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-06-02 22:28:50] [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 22:28:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:28:50] [INFO ] Load time of PNML (sax parser for PT used): 132 ms
[2024-06-02 22:28:50] [INFO ] Transformed 273 places.
[2024-06-02 22:28:50] [INFO ] Transformed 518 transitions.
[2024-06-02 22:28:50] [INFO ] Found NUPN structural information;
[2024-06-02 22:28:50] [INFO ] Parsed PT model containing 273 places and 518 transitions and 1795 arcs in 277 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA MedleyA-PT-20-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-20-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-20-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-20-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 518/518 transitions.
Discarding 96 places :
Symmetric choice reduction at 0 with 96 rule applications. Total rules 96 place count 177 transition count 422
Iterating global reduction 0 with 96 rules applied. Total rules applied 192 place count 177 transition count 422
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 196 place count 177 transition count 418
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 228 place count 145 transition count 326
Iterating global reduction 1 with 32 rules applied. Total rules applied 260 place count 145 transition count 326
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 265 place count 145 transition count 321
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 272 place count 138 transition count 307
Iterating global reduction 2 with 7 rules applied. Total rules applied 279 place count 138 transition count 307
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 281 place count 138 transition count 305
Applied a total of 281 rules in 75 ms. Remains 138 /273 variables (removed 135) and now considering 305/518 (removed 213) transitions.
// Phase 1: matrix 305 rows 138 cols
[2024-06-02 22:28:51] [INFO ] Computed 11 invariants in 17 ms
[2024-06-02 22:28:51] [INFO ] Implicit Places using invariants in 338 ms returned []
[2024-06-02 22:28:51] [INFO ] Invariant cache hit.
[2024-06-02 22:28:51] [INFO ] Implicit Places using invariants and state equation in 370 ms returned []
Implicit Place search using SMT with State Equation took 760 ms to find 0 implicit places.
[2024-06-02 22:28:51] [INFO ] Invariant cache hit.
[2024-06-02 22:28:52] [INFO ] Dead Transitions using invariants and state equation in 312 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 138/273 places, 305/518 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1153 ms. Remains : 138/273 places, 305/518 transitions.
Support contains 31 out of 138 places after structural reductions.
[2024-06-02 22:28:52] [INFO ] Flatten gal took : 81 ms
[2024-06-02 22:28:52] [INFO ] Flatten gal took : 43 ms
[2024-06-02 22:28:52] [INFO ] Input system was already deterministic with 305 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 776 ms. (steps per millisecond=12 ) properties (out of 25) seen :6
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 18) seen :2
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 13) seen :2
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2024-06-02 22:28:53] [INFO ] Invariant cache hit.
[2024-06-02 22:28:53] [INFO ] After 134ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-06-02 22:28:54] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-06-02 22:28:54] [INFO ] [Nat]Absence check using 10 positive and 1 generalized place invariants in 9 ms returned sat
[2024-06-02 22:28:54] [INFO ] After 272ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :9
[2024-06-02 22:28:54] [INFO ] After 515ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :9
Attempting to minimize the solution found.
Minimization took 195 ms.
[2024-06-02 22:28:54] [INFO ] After 877ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :9
Fused 10 Parikh solutions to 8 different solutions.
Parikh walk visited 5 properties in 73 ms.
Support contains 8 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 305/305 transitions.
Graph (trivial) has 104 edges and 138 vertex of which 18 / 138 are part of one of the 3 SCC in 5 ms
Free SCC test removed 15 places
Drop transitions removed 25 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 27 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 123 transition count 276
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 121 transition count 274
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 7 place count 121 transition count 267
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 21 place count 114 transition count 267
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 30 place count 105 transition count 246
Iterating global reduction 2 with 9 rules applied. Total rules applied 39 place count 105 transition count 246
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 44 place count 105 transition count 241
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 46 place count 104 transition count 240
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 46 place count 104 transition count 239
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 48 place count 103 transition count 239
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 78 place count 88 transition count 224
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 82 place count 84 transition count 212
Iterating global reduction 4 with 4 rules applied. Total rules applied 86 place count 84 transition count 212
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 89 place count 84 transition count 209
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -13
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 103 place count 77 transition count 222
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 106 place count 77 transition count 219
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 107 place count 76 transition count 216
Iterating global reduction 5 with 1 rules applied. Total rules applied 108 place count 76 transition count 216
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 109 place count 76 transition count 215
Free-agglomeration rule applied 20 times.
Iterating global reduction 6 with 20 rules applied. Total rules applied 129 place count 76 transition count 195
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 23 rules applied. Total rules applied 152 place count 56 transition count 192
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 155 place count 56 transition count 189
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 156 place count 55 transition count 188
Applied a total of 156 rules in 114 ms. Remains 55 /138 variables (removed 83) and now considering 188/305 (removed 117) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 55/138 places, 188/305 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :1
Finished Best-First random walk after 8482 steps, including 6 resets, run visited all 1 properties in 17 ms. (steps per millisecond=498 )
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 11 stabilizing places and 16 stable transitions
FORMULA MedleyA-PT-20-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X(p1))))'
Support contains 5 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 305/305 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 128 transition count 285
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 128 transition count 285
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 128 transition count 284
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 27 place count 122 transition count 270
Iterating global reduction 1 with 6 rules applied. Total rules applied 33 place count 122 transition count 270
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 34 place count 122 transition count 269
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 37 place count 119 transition count 261
Iterating global reduction 2 with 3 rules applied. Total rules applied 40 place count 119 transition count 261
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 119 transition count 259
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 43 place count 118 transition count 256
Iterating global reduction 3 with 1 rules applied. Total rules applied 44 place count 118 transition count 256
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 45 place count 118 transition count 255
Applied a total of 45 rules in 13 ms. Remains 118 /138 variables (removed 20) and now considering 255/305 (removed 50) transitions.
// Phase 1: matrix 255 rows 118 cols
[2024-06-02 22:28:55] [INFO ] Computed 11 invariants in 5 ms
[2024-06-02 22:28:55] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-06-02 22:28:55] [INFO ] Invariant cache hit.
[2024-06-02 22:28:56] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
[2024-06-02 22:28:56] [INFO ] Invariant cache hit.
[2024-06-02 22:28:56] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 118/138 places, 255/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 616 ms. Remains : 118/138 places, 255/305 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 405 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : MedleyA-PT-20-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s59 1) (EQ s95 1)), p1:(AND (EQ s6 1) (EQ s15 1) (EQ s47 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 3 ms.
FORMULA MedleyA-PT-20-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-20-LTLFireability-00 finished in 1110 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)&&F(((p2&&F(p3))||p1))))'
Support contains 6 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 305/305 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 129 transition count 288
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 129 transition count 288
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 125 transition count 278
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 125 transition count 278
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 125 transition count 277
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 124 transition count 275
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 124 transition count 275
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 123 transition count 272
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 123 transition count 272
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 32 place count 123 transition count 271
Applied a total of 32 rules in 15 ms. Remains 123 /138 variables (removed 15) and now considering 271/305 (removed 34) transitions.
// Phase 1: matrix 271 rows 123 cols
[2024-06-02 22:28:56] [INFO ] Computed 11 invariants in 4 ms
[2024-06-02 22:28:56] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-06-02 22:28:56] [INFO ] Invariant cache hit.
[2024-06-02 22:28:57] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
[2024-06-02 22:28:57] [INFO ] Invariant cache hit.
[2024-06-02 22:28:57] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 123/138 places, 271/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 536 ms. Remains : 123/138 places, 271/305 transitions.
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), true]
Running random walk in product with property : MedleyA-PT-20-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s6 0) (EQ s12 0) (EQ s26 0)), p2:(OR (EQ s6 0) (EQ s12 0) (EQ s60 0)), p3:(OR (EQ s6 0) (EQ s12 0) (EQ s34 0)), p0:(OR (EQ s6 0) (EQ s117 0))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 396 ms.
Product exploration explored 100000 steps with 50000 reset in 314 ms.
Computed a total of 10 stabilizing places and 15 stable transitions
Computed a total of 10 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND p1 p2 p3 p0), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X (NOT (AND (NOT p1) p2 (NOT p3)))), true, (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 21 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-20-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-20-LTLFireability-02 finished in 1533 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((X(p1)&&p0)))'
Support contains 5 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 305/305 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 127 transition count 282
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 127 transition count 282
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 127 transition count 281
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 28 place count 122 transition count 269
Iterating global reduction 1 with 5 rules applied. Total rules applied 33 place count 122 transition count 269
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 36 place count 119 transition count 261
Iterating global reduction 1 with 3 rules applied. Total rules applied 39 place count 119 transition count 261
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 41 place count 119 transition count 259
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 118 transition count 256
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 118 transition count 256
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 118 transition count 255
Applied a total of 44 rules in 12 ms. Remains 118 /138 variables (removed 20) and now considering 255/305 (removed 50) transitions.
// Phase 1: matrix 255 rows 118 cols
[2024-06-02 22:28:58] [INFO ] Computed 11 invariants in 3 ms
[2024-06-02 22:28:58] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-02 22:28:58] [INFO ] Invariant cache hit.
[2024-06-02 22:28:58] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
[2024-06-02 22:28:58] [INFO ] Invariant cache hit.
[2024-06-02 22:28:58] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 118/138 places, 255/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 494 ms. Remains : 118/138 places, 255/305 transitions.
Stuttering acceptance computed with spot in 85 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : MedleyA-PT-20-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s81 1) (EQ s94 1)), p1:(AND (EQ s6 1) (EQ s12 1) (EQ s67 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 141 ms.
Stack based approach found an accepted trace after 30 steps with 0 reset with depth 31 and stack size 31 in 0 ms.
FORMULA MedleyA-PT-20-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-20-LTLFireability-03 finished in 738 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(X(G((!p0||X(X(!p0))))))))'
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 305/305 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 126 transition count 279
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 126 transition count 279
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 126 transition count 278
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 31 place count 120 transition count 264
Iterating global reduction 1 with 6 rules applied. Total rules applied 37 place count 120 transition count 264
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 38 place count 120 transition count 263
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 41 place count 117 transition count 255
Iterating global reduction 2 with 3 rules applied. Total rules applied 44 place count 117 transition count 255
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 46 place count 117 transition count 253
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 47 place count 116 transition count 250
Iterating global reduction 3 with 1 rules applied. Total rules applied 48 place count 116 transition count 250
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 49 place count 116 transition count 249
Applied a total of 49 rules in 7 ms. Remains 116 /138 variables (removed 22) and now considering 249/305 (removed 56) transitions.
// Phase 1: matrix 249 rows 116 cols
[2024-06-02 22:28:59] [INFO ] Computed 11 invariants in 2 ms
[2024-06-02 22:28:59] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-06-02 22:28:59] [INFO ] Invariant cache hit.
[2024-06-02 22:28:59] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
[2024-06-02 22:28:59] [INFO ] Invariant cache hit.
[2024-06-02 22:28:59] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 116/138 places, 249/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 479 ms. Remains : 116/138 places, 249/305 transitions.
Stuttering acceptance computed with spot in 259 ms :[true, p0, p0, p0, p0, p0, p0]
Running random walk in product with property : MedleyA-PT-20-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 6}], [{ cond=p0, acceptance={0} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 5}], [{ cond=p0, acceptance={} source=4 dest: 1}, { cond=(NOT p0), acceptance={} source=4 dest: 2}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=p0, acceptance={} source=6 dest: 4}, { cond=(NOT p0), acceptance={} source=6 dest: 6}]], initial=3, aps=[p0:(EQ s64 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 93 steps with 3 reset in 1 ms.
FORMULA MedleyA-PT-20-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-20-LTLFireability-04 finished in 766 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((X((G((p1||G(p2))) U (!p1&&G((p1||G(p2))))))||p0))))'
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 305/305 transitions.
Graph (trivial) has 91 edges and 138 vertex of which 11 / 138 are part of one of the 2 SCC in 1 ms
Free SCC test removed 9 places
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 128 transition count 288
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 126 transition count 287
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 6 place count 126 transition count 280
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 20 place count 119 transition count 280
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 32 place count 107 transition count 253
Iterating global reduction 2 with 12 rules applied. Total rules applied 44 place count 107 transition count 253
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 48 place count 107 transition count 249
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 50 place count 106 transition count 248
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 50 place count 106 transition count 247
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 52 place count 105 transition count 247
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 56 place count 101 transition count 237
Iterating global reduction 4 with 4 rules applied. Total rules applied 60 place count 101 transition count 237
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 61 place count 101 transition count 236
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 62 place count 100 transition count 234
Iterating global reduction 5 with 1 rules applied. Total rules applied 63 place count 100 transition count 234
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 64 place count 99 transition count 231
Iterating global reduction 5 with 1 rules applied. Total rules applied 65 place count 99 transition count 231
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 66 place count 99 transition count 230
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 94 place count 85 transition count 216
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 95 place count 85 transition count 215
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 97 place count 83 transition count 209
Iterating global reduction 7 with 2 rules applied. Total rules applied 99 place count 83 transition count 209
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 101 place count 83 transition count 207
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 8 with 16 rules applied. Total rules applied 117 place count 75 transition count 220
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 118 place count 75 transition count 219
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 124 place count 75 transition count 213
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 126 place count 73 transition count 207
Iterating global reduction 9 with 2 rules applied. Total rules applied 128 place count 73 transition count 207
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 130 place count 73 transition count 205
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 132 place count 71 transition count 203
Applied a total of 132 rules in 97 ms. Remains 71 /138 variables (removed 67) and now considering 203/305 (removed 102) transitions.
[2024-06-02 22:28:59] [INFO ] Flow matrix only has 195 transitions (discarded 8 similar events)
// Phase 1: matrix 195 rows 71 cols
[2024-06-02 22:28:59] [INFO ] Computed 11 invariants in 2 ms
[2024-06-02 22:29:00] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-06-02 22:29:00] [INFO ] Flow matrix only has 195 transitions (discarded 8 similar events)
[2024-06-02 22:29:00] [INFO ] Invariant cache hit.
[2024-06-02 22:29:00] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 22:29:00] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
[2024-06-02 22:29:00] [INFO ] Redundant transitions in 10 ms returned []
[2024-06-02 22:29:00] [INFO ] Flow matrix only has 195 transitions (discarded 8 similar events)
[2024-06-02 22:29:00] [INFO ] Invariant cache hit.
[2024-06-02 22:29:00] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 71/138 places, 203/305 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 538 ms. Remains : 71/138 places, 203/305 transitions.
Stuttering acceptance computed with spot in 245 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : MedleyA-PT-20-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={1, 2} source=0 dest: 0}, { cond=(NOT p0), acceptance={0, 1, 2} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={1, 2} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={1, 2} source=1 dest: 1}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p2))), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0, 2} source=1 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={1} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0, 1} source=1 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={2} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={1, 2} source=2 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={1, 2} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=2 dest: 1}, { cond=(AND p0 p1 p2), acceptance={2} source=2 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={0, 2} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={2} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={1, 2} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0, 2} source=3 dest: 2}, { cond=(OR (AND p0 p1) (AND p0 p2)), acceptance={1} source=3 dest: 3}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={2} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={1, 2} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=4 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0, 2} source=4 dest: 2}, { cond=p2, acceptance={2} source=4 dest: 4}]], initial=0, aps=[p0:(OR (NEQ s2 1) (NEQ s10 1) (NEQ s19 1)), p1:(AND (EQ s2 1) (EQ s10 1) (EQ s19 1)), p2:(EQ s52 1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 7 reset in 198 ms.
Product exploration explored 100000 steps with 8 reset in 282 ms.
Computed a total of 1 stabilizing places and 6 stable transitions
Computed a total of 1 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 p1)))), true, (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (OR (AND p0 p1) (AND p0 p2)))), (X (X (NOT (OR (AND p0 p1) (AND p0 p2))))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 15 factoid took 1302 ms. Reduced automaton from 5 states, 25 edges and 3 AP (stutter insensitive) to 5 states, 32 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 255 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 394 ms. (steps per millisecond=25 ) properties (out of 15) seen :5
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 7) seen :1
Running SMT prover for 6 properties.
[2024-06-02 22:29:03] [INFO ] Flow matrix only has 195 transitions (discarded 8 similar events)
[2024-06-02 22:29:04] [INFO ] Invariant cache hit.
[2024-06-02 22:29:04] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :6 sat :0
Fused 6 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 6 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 p1)))), true, (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (G (NOT (AND p1 p0 (NOT p2)))), (G (NOT (AND (NOT p1) (NOT p0) p2))), (G (NOT (AND p1 p0))), (G (OR p1 p0 p2)), (G (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (G (NOT (AND p1 p0 p2)))]
False Knowledge obtained : [(X (AND p0 (NOT p1) p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (OR (AND p0 p1) (AND p0 p2)))), (X (X (NOT (OR (AND p0 p1) (AND p0 p2))))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p2))), (X (X p2)), (F (AND (NOT p1) p0 p2)), (F (AND p1 (NOT p0) (NOT p2))), (F (NOT (AND (NOT p1) p0 (NOT p2)))), (F (OR (AND p1 p2) (AND p0 p2))), (F (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))))), (F (AND p1 (NOT p0))), (F (OR (AND p1 p0) (AND p0 p2))), (F (OR (AND p1 (NOT p0)) (AND (NOT p0) p2))), (F (AND p1 (NOT p0) p2))]
Knowledge based reduction with 21 factoid took 2629 ms. Reduced automaton from 5 states, 32 edges and 3 AP (stutter insensitive) to 5 states, 18 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 233 ms :[p1, p1, (AND p1 (NOT p2)), false, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 235 ms :[p1, p1, (AND p1 (NOT p2)), false, (AND p1 (NOT p2))]
Support contains 4 out of 71 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 71/71 places, 203/203 transitions.
Applied a total of 0 rules in 7 ms. Remains 71 /71 variables (removed 0) and now considering 203/203 (removed 0) transitions.
[2024-06-02 22:29:07] [INFO ] Flow matrix only has 195 transitions (discarded 8 similar events)
[2024-06-02 22:29:07] [INFO ] Invariant cache hit.
[2024-06-02 22:29:07] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-06-02 22:29:07] [INFO ] Flow matrix only has 195 transitions (discarded 8 similar events)
[2024-06-02 22:29:07] [INFO ] Invariant cache hit.
[2024-06-02 22:29:07] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 22:29:07] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
[2024-06-02 22:29:07] [INFO ] Redundant transitions in 10 ms returned []
[2024-06-02 22:29:07] [INFO ] Flow matrix only has 195 transitions (discarded 8 similar events)
[2024-06-02 22:29:07] [INFO ] Invariant cache hit.
[2024-06-02 22:29:07] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 487 ms. Remains : 71/71 places, 203/203 transitions.
Computed a total of 1 stabilizing places and 6 stable transitions
Computed a total of 1 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT p1)), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 6 factoid took 420 ms. Reduced automaton from 5 states, 18 edges and 2 AP (stutter insensitive) to 5 states, 18 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 225 ms :[p1, p1, (AND p1 (NOT p2)), false, (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 6) seen :3
Finished Best-First random walk after 361 steps, including 3 resets, run visited all 3 properties in 2 ms. (steps per millisecond=180 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT p1)), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p2))), (X (X p2)), (F (AND p2 p1)), (F (AND (NOT p2) p1)), (F p2), (F p1), (F (AND p2 (NOT p1))), (F (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 6 factoid took 602 ms. Reduced automaton from 5 states, 18 edges and 2 AP (stutter insensitive) to 5 states, 18 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 217 ms :[p1, p1, (AND p1 (NOT p2)), false, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 229 ms :[p1, p1, (AND p1 (NOT p2)), false, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 238 ms :[p1, p1, (AND p1 (NOT p2)), false, (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 7 reset in 176 ms.
Product exploration explored 100000 steps with 1 reset in 196 ms.
Built C files in :
/tmp/ltsmin15749293826346976775
[2024-06-02 22:29:10] [INFO ] Computing symmetric may disable matrix : 203 transitions.
[2024-06-02 22:29:10] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:29:10] [INFO ] Computing symmetric may enable matrix : 203 transitions.
[2024-06-02 22:29:10] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:29:10] [INFO ] Computing Do-Not-Accords matrix : 203 transitions.
[2024-06-02 22:29:10] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:29:10] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15749293826346976775
Running compilation step : cd /tmp/ltsmin15749293826346976775;'/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 836 ms.
Running link step : cd /tmp/ltsmin15749293826346976775;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin15749293826346976775;'/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/stateBased9771159767584146583.hoa' '--buchi-type=spotba'
LTSmin run took 712 ms.
FORMULA MedleyA-PT-20-LTLFireability-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-20-LTLFireability-05 finished in 12064 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(p0)||X((p1||F(G(p1))))))'
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 305/305 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 127 transition count 282
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 127 transition count 282
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 127 transition count 281
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 28 place count 122 transition count 269
Iterating global reduction 1 with 5 rules applied. Total rules applied 33 place count 122 transition count 269
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 34 place count 122 transition count 268
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 37 place count 119 transition count 260
Iterating global reduction 2 with 3 rules applied. Total rules applied 40 place count 119 transition count 260
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 119 transition count 258
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 43 place count 118 transition count 255
Iterating global reduction 3 with 1 rules applied. Total rules applied 44 place count 118 transition count 255
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 45 place count 118 transition count 254
Applied a total of 45 rules in 12 ms. Remains 118 /138 variables (removed 20) and now considering 254/305 (removed 51) transitions.
// Phase 1: matrix 254 rows 118 cols
[2024-06-02 22:29:11] [INFO ] Computed 11 invariants in 2 ms
[2024-06-02 22:29:11] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-06-02 22:29:11] [INFO ] Invariant cache hit.
[2024-06-02 22:29:12] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
[2024-06-02 22:29:12] [INFO ] Invariant cache hit.
[2024-06-02 22:29:12] [INFO ] Dead Transitions using invariants and state equation in 210 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 118/138 places, 254/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 577 ms. Remains : 118/138 places, 254/305 transitions.
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-20-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s6 1) (EQ s12 1) (EQ s69 1)), p1:(EQ s42 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 32 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-20-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-20-LTLFireability-07 finished in 829 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((!p0 U p1))&&X(G(p0))))'
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 305/305 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 128 transition count 283
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 128 transition count 283
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 128 transition count 282
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 25 place count 124 transition count 273
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 124 transition count 273
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 30 place count 124 transition count 272
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 33 place count 121 transition count 264
Iterating global reduction 2 with 3 rules applied. Total rules applied 36 place count 121 transition count 264
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 38 place count 121 transition count 262
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 39 place count 120 transition count 259
Iterating global reduction 3 with 1 rules applied. Total rules applied 40 place count 120 transition count 259
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 41 place count 120 transition count 258
Applied a total of 41 rules in 14 ms. Remains 120 /138 variables (removed 18) and now considering 258/305 (removed 47) transitions.
// Phase 1: matrix 258 rows 120 cols
[2024-06-02 22:29:12] [INFO ] Computed 11 invariants in 3 ms
[2024-06-02 22:29:12] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-06-02 22:29:12] [INFO ] Invariant cache hit.
[2024-06-02 22:29:13] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
[2024-06-02 22:29:13] [INFO ] Invariant cache hit.
[2024-06-02 22:29:13] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 120/138 places, 258/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 563 ms. Remains : 120/138 places, 258/305 transitions.
Stuttering acceptance computed with spot in 113 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-20-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 0}, { cond=(OR p1 (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s82 1), p0:(AND (EQ s6 1) (EQ s15 1) (EQ s69 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-20-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-20-LTLFireability-08 finished in 697 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 305/305 transitions.
Graph (trivial) has 108 edges and 138 vertex of which 18 / 138 are part of one of the 3 SCC in 0 ms
Free SCC test removed 15 places
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 122 transition count 278
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 120 transition count 276
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 7 place count 120 transition count 268
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 23 place count 112 transition count 268
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 34 place count 101 transition count 243
Iterating global reduction 2 with 11 rules applied. Total rules applied 45 place count 101 transition count 243
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 50 place count 101 transition count 238
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 52 place count 100 transition count 237
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 52 place count 100 transition count 236
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 54 place count 99 transition count 236
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 80 place count 86 transition count 223
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 85 place count 81 transition count 208
Iterating global reduction 4 with 5 rules applied. Total rules applied 90 place count 81 transition count 208
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 93 place count 81 transition count 205
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 111 place count 72 transition count 220
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 120 place count 72 transition count 211
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 123 place count 69 transition count 202
Iterating global reduction 5 with 3 rules applied. Total rules applied 126 place count 69 transition count 202
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 129 place count 69 transition count 199
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 131 place count 67 transition count 197
Applied a total of 131 rules in 57 ms. Remains 67 /138 variables (removed 71) and now considering 197/305 (removed 108) transitions.
[2024-06-02 22:29:13] [INFO ] Flow matrix only has 189 transitions (discarded 8 similar events)
// Phase 1: matrix 189 rows 67 cols
[2024-06-02 22:29:13] [INFO ] Computed 11 invariants in 1 ms
[2024-06-02 22:29:13] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-02 22:29:13] [INFO ] Flow matrix only has 189 transitions (discarded 8 similar events)
[2024-06-02 22:29:13] [INFO ] Invariant cache hit.
[2024-06-02 22:29:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:29:13] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
[2024-06-02 22:29:13] [INFO ] Redundant transitions in 3 ms returned []
[2024-06-02 22:29:13] [INFO ] Flow matrix only has 189 transitions (discarded 8 similar events)
[2024-06-02 22:29:13] [INFO ] Invariant cache hit.
[2024-06-02 22:29:13] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 67/138 places, 197/305 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 482 ms. Remains : 67/138 places, 197/305 transitions.
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-20-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s41 1) (EQ s61 1)), p1:(OR (EQ s42 0) (EQ s56 0))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 3 reset in 188 ms.
Product exploration explored 100000 steps with 3 reset in 174 ms.
Computed a total of 1 stabilizing places and 6 stable transitions
Computed a total of 1 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 114 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 84 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :3
Running SMT prover for 1 properties.
[2024-06-02 22:29:14] [INFO ] Flow matrix only has 189 transitions (discarded 8 similar events)
[2024-06-02 22:29:14] [INFO ] Invariant cache hit.
[2024-06-02 22:29:14] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:29:14] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-02 22:29:14] [INFO ] [Nat]Absence check using 10 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-02 22:29:14] [INFO ] After 39ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 p1)), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 10 factoid took 245 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p1)]
Support contains 2 out of 67 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 197/197 transitions.
Applied a total of 0 rules in 6 ms. Remains 67 /67 variables (removed 0) and now considering 197/197 (removed 0) transitions.
[2024-06-02 22:29:15] [INFO ] Flow matrix only has 189 transitions (discarded 8 similar events)
[2024-06-02 22:29:15] [INFO ] Invariant cache hit.
[2024-06-02 22:29:15] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-02 22:29:15] [INFO ] Flow matrix only has 189 transitions (discarded 8 similar events)
[2024-06-02 22:29:15] [INFO ] Invariant cache hit.
[2024-06-02 22:29:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:29:15] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
[2024-06-02 22:29:15] [INFO ] Redundant transitions in 2 ms returned []
[2024-06-02 22:29:15] [INFO ] Flow matrix only has 189 transitions (discarded 8 similar events)
[2024-06-02 22:29:15] [INFO ] Invariant cache hit.
[2024-06-02 22:29:15] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 446 ms. Remains : 67/67 places, 197/197 transitions.
Computed a total of 1 stabilizing places and 6 stable transitions
Computed a total of 1 stabilizing places and 6 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 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 38 ms :[(NOT p1)]
Incomplete random walk after 10000 steps, including 10 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1061 steps, run visited all 1 properties in 20 ms. (steps per millisecond=53 )
Probabilistic random walk after 1061 steps, saw 812 distinct states, run finished after 20 ms. (steps per millisecond=53 ) 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 115 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 40 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p1)]
Product exploration explored 100000 steps with 1 reset in 206 ms.
Product exploration explored 100000 steps with 2 reset in 203 ms.
Built C files in :
/tmp/ltsmin7036921844311288199
[2024-06-02 22:29:16] [INFO ] Computing symmetric may disable matrix : 197 transitions.
[2024-06-02 22:29:16] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:29:16] [INFO ] Computing symmetric may enable matrix : 197 transitions.
[2024-06-02 22:29:16] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:29:16] [INFO ] Computing Do-Not-Accords matrix : 197 transitions.
[2024-06-02 22:29:16] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:29:16] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7036921844311288199
Running compilation step : cd /tmp/ltsmin7036921844311288199;'/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 623 ms.
Running link step : cd /tmp/ltsmin7036921844311288199;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin7036921844311288199;'/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/stateBased13821756294971459033.hoa' '--buchi-type=spotba'
LTSmin run took 293 ms.
FORMULA MedleyA-PT-20-LTLFireability-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-20-LTLFireability-09 finished in 4462 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 305/305 transitions.
Graph (trivial) has 107 edges and 138 vertex of which 18 / 138 are part of one of the 3 SCC in 0 ms
Free SCC test removed 15 places
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 122 transition count 278
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 120 transition count 276
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 7 place count 120 transition count 267
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 25 place count 111 transition count 267
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 36 place count 100 transition count 242
Iterating global reduction 2 with 11 rules applied. Total rules applied 47 place count 100 transition count 242
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 51 place count 100 transition count 238
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 51 place count 100 transition count 237
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 53 place count 99 transition count 237
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 79 place count 86 transition count 224
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 84 place count 81 transition count 209
Iterating global reduction 3 with 5 rules applied. Total rules applied 89 place count 81 transition count 209
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 92 place count 81 transition count 206
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 110 place count 72 transition count 221
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 119 place count 72 transition count 212
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 122 place count 69 transition count 203
Iterating global reduction 4 with 3 rules applied. Total rules applied 125 place count 69 transition count 203
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 128 place count 69 transition count 200
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 130 place count 67 transition count 198
Applied a total of 130 rules in 45 ms. Remains 67 /138 variables (removed 71) and now considering 198/305 (removed 107) transitions.
[2024-06-02 22:29:17] [INFO ] Flow matrix only has 188 transitions (discarded 10 similar events)
// Phase 1: matrix 188 rows 67 cols
[2024-06-02 22:29:17] [INFO ] Computed 11 invariants in 1 ms
[2024-06-02 22:29:17] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-02 22:29:17] [INFO ] Flow matrix only has 188 transitions (discarded 10 similar events)
[2024-06-02 22:29:17] [INFO ] Invariant cache hit.
[2024-06-02 22:29:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:29:18] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2024-06-02 22:29:18] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 22:29:18] [INFO ] Flow matrix only has 188 transitions (discarded 10 similar events)
[2024-06-02 22:29:18] [INFO ] Invariant cache hit.
[2024-06-02 22:29:18] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 67/138 places, 198/305 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 432 ms. Remains : 67/138 places, 198/305 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-20-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-20-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-20-LTLFireability-11 finished in 495 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(p0)||F(p1)))'
Support contains 3 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 305/305 transitions.
Graph (trivial) has 109 edges and 138 vertex of which 18 / 138 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 122 transition count 278
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 120 transition count 276
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 7 place count 120 transition count 267
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 25 place count 111 transition count 267
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 36 place count 100 transition count 242
Iterating global reduction 2 with 11 rules applied. Total rules applied 47 place count 100 transition count 242
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 52 place count 100 transition count 237
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 54 place count 99 transition count 236
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 54 place count 99 transition count 235
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 56 place count 98 transition count 235
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 80 place count 86 transition count 223
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 85 place count 81 transition count 208
Iterating global reduction 4 with 5 rules applied. Total rules applied 90 place count 81 transition count 208
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 93 place count 81 transition count 205
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 109 place count 73 transition count 219
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 118 place count 73 transition count 210
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 121 place count 70 transition count 201
Iterating global reduction 5 with 3 rules applied. Total rules applied 124 place count 70 transition count 201
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 127 place count 70 transition count 198
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 128 place count 69 transition count 197
Applied a total of 128 rules in 44 ms. Remains 69 /138 variables (removed 69) and now considering 197/305 (removed 108) transitions.
[2024-06-02 22:29:18] [INFO ] Flow matrix only has 187 transitions (discarded 10 similar events)
// Phase 1: matrix 187 rows 69 cols
[2024-06-02 22:29:18] [INFO ] Computed 11 invariants in 3 ms
[2024-06-02 22:29:18] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-02 22:29:18] [INFO ] Flow matrix only has 187 transitions (discarded 10 similar events)
[2024-06-02 22:29:18] [INFO ] Invariant cache hit.
[2024-06-02 22:29:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:29:18] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
[2024-06-02 22:29:18] [INFO ] Redundant transitions in 0 ms returned []
[2024-06-02 22:29:18] [INFO ] Flow matrix only has 187 transitions (discarded 10 similar events)
[2024-06-02 22:29:18] [INFO ] Invariant cache hit.
[2024-06-02 22:29:18] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/138 places, 197/305 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 415 ms. Remains : 69/138 places, 197/305 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-20-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(AND (EQ s6 1) (EQ s32 1)), p0:(EQ s50 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-20-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-20-LTLFireability-14 finished in 511 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 305/305 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 127 transition count 280
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 127 transition count 280
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 127 transition count 279
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 29 place count 121 transition count 265
Iterating global reduction 1 with 6 rules applied. Total rules applied 35 place count 121 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 36 place count 121 transition count 264
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 39 place count 118 transition count 256
Iterating global reduction 2 with 3 rules applied. Total rules applied 42 place count 118 transition count 256
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 44 place count 118 transition count 254
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 45 place count 117 transition count 251
Iterating global reduction 3 with 1 rules applied. Total rules applied 46 place count 117 transition count 251
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 47 place count 117 transition count 250
Applied a total of 47 rules in 11 ms. Remains 117 /138 variables (removed 21) and now considering 250/305 (removed 55) transitions.
// Phase 1: matrix 250 rows 117 cols
[2024-06-02 22:29:18] [INFO ] Computed 11 invariants in 3 ms
[2024-06-02 22:29:18] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-06-02 22:29:18] [INFO ] Invariant cache hit.
[2024-06-02 22:29:19] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
[2024-06-02 22:29:19] [INFO ] Invariant cache hit.
[2024-06-02 22:29:19] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 117/138 places, 250/305 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 568 ms. Remains : 117/138 places, 250/305 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-20-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(NEQ s110 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 319 steps with 8 reset in 1 ms.
FORMULA MedleyA-PT-20-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-20-LTLFireability-15 finished in 712 ms.
All properties solved by simple procedures.
Total runtime 29034 ms.

BK_STOP 1717367360752

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

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