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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 5.6K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K 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 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 15K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 169K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K 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 89K 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-16-LTLFireability-00
FORMULA_NAME MedleyA-PT-16-LTLFireability-01
FORMULA_NAME MedleyA-PT-16-LTLFireability-02
FORMULA_NAME MedleyA-PT-16-LTLFireability-03
FORMULA_NAME MedleyA-PT-16-LTLFireability-04
FORMULA_NAME MedleyA-PT-16-LTLFireability-05
FORMULA_NAME MedleyA-PT-16-LTLFireability-06
FORMULA_NAME MedleyA-PT-16-LTLFireability-07
FORMULA_NAME MedleyA-PT-16-LTLFireability-08
FORMULA_NAME MedleyA-PT-16-LTLFireability-09
FORMULA_NAME MedleyA-PT-16-LTLFireability-10
FORMULA_NAME MedleyA-PT-16-LTLFireability-11
FORMULA_NAME MedleyA-PT-16-LTLFireability-12
FORMULA_NAME MedleyA-PT-16-LTLFireability-13
FORMULA_NAME MedleyA-PT-16-LTLFireability-14
FORMULA_NAME MedleyA-PT-16-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717362956439

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-16
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-06-02 21:15:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 21:15:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:15:59] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2024-06-02 21:15:59] [INFO ] Transformed 196 places.
[2024-06-02 21:15:59] [INFO ] Transformed 392 transitions.
[2024-06-02 21:15:59] [INFO ] Found NUPN structural information;
[2024-06-02 21:15:59] [INFO ] Parsed PT model containing 196 places and 392 transitions and 1186 arcs in 217 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
FORMULA MedleyA-PT-16-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-16-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-16-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-16-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 390/390 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 162 transition count 338
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 162 transition count 338
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 81 place count 162 transition count 325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 82 place count 161 transition count 324
Iterating global reduction 1 with 1 rules applied. Total rules applied 83 place count 161 transition count 324
Applied a total of 83 rules in 50 ms. Remains 161 /196 variables (removed 35) and now considering 324/390 (removed 66) transitions.
// Phase 1: matrix 324 rows 161 cols
[2024-06-02 21:15:59] [INFO ] Computed 7 invariants in 18 ms
[2024-06-02 21:15:59] [INFO ] Implicit Places using invariants in 280 ms returned []
[2024-06-02 21:15:59] [INFO ] Invariant cache hit.
[2024-06-02 21:16:00] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 615 ms to find 0 implicit places.
[2024-06-02 21:16:00] [INFO ] Invariant cache hit.
[2024-06-02 21:16:00] [INFO ] Dead Transitions using invariants and state equation in 265 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 161/196 places, 324/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 931 ms. Remains : 161/196 places, 324/390 transitions.
Support contains 31 out of 161 places after structural reductions.
[2024-06-02 21:16:00] [INFO ] Flatten gal took : 74 ms
[2024-06-02 21:16:00] [INFO ] Flatten gal took : 28 ms
[2024-06-02 21:16:00] [INFO ] Input system was already deterministic with 324 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 745 ms. (steps per millisecond=13 ) properties (out of 22) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=20 ) properties (out of 20) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 19) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
[2024-06-02 21:16:01] [INFO ] Invariant cache hit.
[2024-06-02 21:16:02] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 21:16:02] [INFO ] After 470ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2024-06-02 21:16:02] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 21:16:03] [INFO ] After 353ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2024-06-02 21:16:03] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 7 ms to minimize.
[2024-06-02 21:16:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2024-06-02 21:16:03] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 1 ms to minimize.
[2024-06-02 21:16:03] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 2 ms to minimize.
[2024-06-02 21:16:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 165 ms
[2024-06-02 21:16:03] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
[2024-06-02 21:16:03] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 2 ms to minimize.
[2024-06-02 21:16:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 202 ms
[2024-06-02 21:16:03] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 1 ms to minimize.
[2024-06-02 21:16:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2024-06-02 21:16:04] [INFO ] After 1352ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 295 ms.
[2024-06-02 21:16:04] [INFO ] After 1863ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Parikh walk visited 1 properties in 319 ms.
Support contains 22 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 324/324 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 161 transition count 304
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 22 rules applied. Total rules applied 42 place count 141 transition count 302
Reduce places removed 1 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 5 rules applied. Total rules applied 47 place count 140 transition count 298
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 51 place count 136 transition count 298
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 51 place count 136 transition count 289
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 69 place count 127 transition count 289
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 70 place count 127 transition count 288
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 73 place count 124 transition count 282
Iterating global reduction 5 with 3 rules applied. Total rules applied 76 place count 124 transition count 282
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 126 place count 99 transition count 257
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 129 place count 96 transition count 249
Iterating global reduction 5 with 3 rules applied. Total rules applied 132 place count 96 transition count 249
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -32
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 148 place count 88 transition count 281
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 151 place count 88 transition count 278
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 6 with 22 rules applied. Total rules applied 173 place count 88 transition count 256
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 174 place count 87 transition count 255
Iterating global reduction 6 with 1 rules applied. Total rules applied 175 place count 87 transition count 255
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 177 place count 86 transition count 254
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 183 place count 83 transition count 290
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 184 place count 83 transition count 289
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 185 place count 83 transition count 288
Free-agglomeration rule applied 11 times.
Iterating global reduction 7 with 11 rules applied. Total rules applied 196 place count 83 transition count 277
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 211 place count 72 transition count 273
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 214 place count 72 transition count 270
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 216 place count 72 transition count 270
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 218 place count 72 transition count 268
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 219 place count 72 transition count 268
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 220 place count 71 transition count 267
Iterating global reduction 8 with 1 rules applied. Total rules applied 221 place count 71 transition count 267
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 222 place count 70 transition count 266
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 14 edges and 68 vertex of which 4 / 68 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Iterating post reduction 8 with 3 rules applied. Total rules applied 225 place count 66 transition count 266
Drop transitions removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 9 with 15 rules applied. Total rules applied 240 place count 66 transition count 251
Drop transitions removed 61 transitions
Redundant transition composition rules discarded 61 transitions
Iterating global reduction 10 with 61 rules applied. Total rules applied 301 place count 66 transition count 190
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 303 place count 64 transition count 188
Iterating global reduction 10 with 2 rules applied. Total rules applied 305 place count 64 transition count 188
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 306 place count 63 transition count 181
Iterating global reduction 10 with 1 rules applied. Total rules applied 307 place count 63 transition count 181
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 309 place count 63 transition count 181
Applied a total of 309 rules in 184 ms. Remains 63 /161 variables (removed 98) and now considering 181/324 (removed 143) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 63/161 places, 181/324 transitions.
Incomplete random walk after 10000 steps, including 1345 resets, run finished after 293 ms. (steps per millisecond=34 ) properties (out of 16) seen :10
Incomplete Best-First random walk after 10001 steps, including 504 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 450 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10000 steps, including 451 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-06-02 21:16:05] [INFO ] Flow matrix only has 177 transitions (discarded 4 similar events)
// Phase 1: matrix 177 rows 63 cols
[2024-06-02 21:16:05] [INFO ] Computed 5 invariants in 3 ms
[2024-06-02 21:16:05] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-06-02 21:16:05] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 21:16:05] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-02 21:16:05] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-02 21:16:05] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-02 21:16:05] [INFO ] After 17ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-06-02 21:16:05] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-06-02 21:16:05] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-06-02 21:16:05] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 0 ms to minimize.
[2024-06-02 21:16:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 145 ms
[2024-06-02 21:16:05] [INFO ] After 188ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 15 ms.
[2024-06-02 21:16:05] [INFO ] After 314ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 1 properties in 1 ms.
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 181/181 transitions.
Graph (trivial) has 66 edges and 63 vertex of which 19 / 63 are part of one of the 6 SCC in 0 ms
Free SCC test removed 13 places
Drop transitions removed 26 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 50 transition count 148
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 47 transition count 148
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 7 place count 47 transition count 146
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 45 transition count 146
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 14 place count 42 transition count 138
Iterating global reduction 2 with 3 rules applied. Total rules applied 17 place count 42 transition count 138
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 23 place count 39 transition count 135
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 39 transition count 134
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 30 place count 36 transition count 151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 31 place count 36 transition count 150
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 4 with 17 rules applied. Total rules applied 48 place count 36 transition count 133
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 49 place count 36 transition count 132
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 50 place count 35 transition count 132
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 50 place count 35 transition count 131
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 52 place count 34 transition count 131
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 54 place count 33 transition count 130
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 56 place count 32 transition count 135
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 60 place count 32 transition count 131
Free-agglomeration rule applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 64 place count 32 transition count 127
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 68 place count 28 transition count 127
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 69 place count 28 transition count 126
Applied a total of 69 rules in 48 ms. Remains 28 /63 variables (removed 35) and now considering 126/181 (removed 55) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 28/63 places, 126/181 transitions.
Finished random walk after 143 steps, including 11 resets, run visited all 1 properties in 3 ms. (steps per millisecond=47 )
Parikh walk visited 0 properties in 0 ms.
FORMULA MedleyA-PT-16-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 14 stabilizing places and 14 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (G(!p0)||(!p0&&G(p1)))))'
Support contains 3 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 324/324 transitions.
Graph (trivial) has 155 edges and 161 vertex of which 13 / 161 are part of one of the 3 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 150 transition count 285
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 32 rules applied. Total rules applied 61 place count 122 transition count 281
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 63 place count 120 transition count 281
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 63 place count 120 transition count 272
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 81 place count 111 transition count 272
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 89 place count 103 transition count 256
Iterating global reduction 3 with 8 rules applied. Total rules applied 97 place count 103 transition count 256
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 99 place count 103 transition count 254
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 145 place count 80 transition count 231
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 148 place count 80 transition count 228
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 153 place count 75 transition count 215
Iterating global reduction 5 with 5 rules applied. Total rules applied 158 place count 75 transition count 215
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -78
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 186 place count 61 transition count 293
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 187 place count 61 transition count 292
Drop transitions removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 6 with 29 rules applied. Total rules applied 216 place count 61 transition count 263
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 218 place count 60 transition count 262
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 222 place count 58 transition count 288
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 223 place count 57 transition count 287
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 51 edges and 55 vertex of which 20 / 55 are part of one of the 8 SCC in 0 ms
Free SCC test removed 12 places
Iterating post reduction 6 with 3 rules applied. Total rules applied 226 place count 43 transition count 287
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 7 with 43 rules applied. Total rules applied 269 place count 43 transition count 244
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 271 place count 41 transition count 223
Iterating global reduction 8 with 2 rules applied. Total rules applied 273 place count 41 transition count 223
Drop transitions removed 70 transitions
Redundant transition composition rules discarded 70 transitions
Iterating global reduction 8 with 70 rules applied. Total rules applied 343 place count 41 transition count 153
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 345 place count 39 transition count 149
Iterating global reduction 8 with 2 rules applied. Total rules applied 347 place count 39 transition count 149
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 351 place count 37 transition count 147
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 352 place count 37 transition count 146
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 354 place count 36 transition count 152
Applied a total of 354 rules in 96 ms. Remains 36 /161 variables (removed 125) and now considering 152/324 (removed 172) transitions.
[2024-06-02 21:16:06] [INFO ] Flow matrix only has 137 transitions (discarded 15 similar events)
// Phase 1: matrix 137 rows 36 cols
[2024-06-02 21:16:06] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 21:16:06] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-06-02 21:16:06] [INFO ] Flow matrix only has 137 transitions (discarded 15 similar events)
[2024-06-02 21:16:06] [INFO ] Invariant cache hit.
[2024-06-02 21:16:06] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-06-02 21:16:06] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2024-06-02 21:16:06] [INFO ] Redundant transitions in 26 ms returned [104, 133, 135]
Found 3 redundant transitions using SMT.
Drop transitions removed 3 transitions
Redundant transitions reduction (with SMT) removed 3 transitions.
[2024-06-02 21:16:06] [INFO ] Flow matrix only has 134 transitions (discarded 15 similar events)
// Phase 1: matrix 134 rows 36 cols
[2024-06-02 21:16:06] [INFO ] Computed 5 invariants in 4 ms
[2024-06-02 21:16:06] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 36/161 places, 149/324 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 34 transition count 147
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 34 transition count 143
Applied a total of 8 rules in 10 ms. Remains 34 /36 variables (removed 2) and now considering 143/149 (removed 6) transitions.
[2024-06-02 21:16:06] [INFO ] Flow matrix only has 128 transitions (discarded 15 similar events)
// Phase 1: matrix 128 rows 34 cols
[2024-06-02 21:16:06] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 21:16:06] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-06-02 21:16:06] [INFO ] Flow matrix only has 128 transitions (discarded 15 similar events)
[2024-06-02 21:16:06] [INFO ] Invariant cache hit.
[2024-06-02 21:16:06] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-06-02 21:16:06] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 34/161 places, 143/324 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 536 ms. Remains : 34/161 places, 143/324 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 322 ms :[true, p0, (AND p0 (NOT p1)), (NOT p1)]
Running random walk in product with property : MedleyA-PT-16-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (EQ s4 1) (EQ s30 1)), p1:(NEQ s27 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 251 ms.
Product exploration explored 100000 steps with 0 reset in 145 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), true, (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 135 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 128 ms :[true, p0, (NOT p1), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2204 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 790 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-06-02 21:16:07] [INFO ] Flow matrix only has 128 transitions (discarded 15 similar events)
[2024-06-02 21:16:07] [INFO ] Invariant cache hit.
[2024-06-02 21:16:07] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-02 21:16:07] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), true, (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND p0 p1)), (F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 14 factoid took 350 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 128 ms :[true, p0, (NOT p1), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 129 ms :[true, p0, (NOT p1), (AND p0 (NOT p1))]
Support contains 3 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 143/143 transitions.
Applied a total of 0 rules in 6 ms. Remains 34 /34 variables (removed 0) and now considering 143/143 (removed 0) transitions.
[2024-06-02 21:16:08] [INFO ] Flow matrix only has 128 transitions (discarded 15 similar events)
[2024-06-02 21:16:08] [INFO ] Invariant cache hit.
[2024-06-02 21:16:08] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-02 21:16:08] [INFO ] Flow matrix only has 128 transitions (discarded 15 similar events)
[2024-06-02 21:16:08] [INFO ] Invariant cache hit.
[2024-06-02 21:16:08] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-06-02 21:16:08] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2024-06-02 21:16:08] [INFO ] Redundant transitions in 24 ms returned [96, 101]
Found 2 redundant transitions using SMT.
Drop transitions removed 2 transitions
Redundant transitions reduction (with SMT) removed 2 transitions.
[2024-06-02 21:16:08] [INFO ] Flow matrix only has 126 transitions (discarded 15 similar events)
// Phase 1: matrix 126 rows 34 cols
[2024-06-02 21:16:08] [INFO ] Computed 5 invariants in 5 ms
[2024-06-02 21:16:08] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 34/34 places, 141/143 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 0 with 1 rules applied. Total rules applied 1 place count 34 transition count 140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 33 transition count 140
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 10 place count 33 transition count 132
Applied a total of 10 rules in 8 ms. Remains 33 /34 variables (removed 1) and now considering 132/141 (removed 9) transitions.
[2024-06-02 21:16:08] [INFO ] Flow matrix only has 120 transitions (discarded 12 similar events)
// Phase 1: matrix 120 rows 33 cols
[2024-06-02 21:16:08] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 21:16:08] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-06-02 21:16:08] [INFO ] Flow matrix only has 120 transitions (discarded 12 similar events)
[2024-06-02 21:16:08] [INFO ] Invariant cache hit.
[2024-06-02 21:16:08] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-06-02 21:16:08] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 33/34 places, 132/143 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 481 ms. Remains : 33/34 places, 132/143 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), true, (X (X p1)), (X (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 p0)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 150 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 128 ms :[true, p0, (NOT p1), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2229 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10000 steps, including 785 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-06-02 21:16:09] [INFO ] Flow matrix only has 120 transitions (discarded 12 similar events)
[2024-06-02 21:16:09] [INFO ] Invariant cache hit.
[2024-06-02 21:16:09] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-02 21:16:09] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), true, (X (X p1)), (X (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 p0))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND p0 p1)), (F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 14 factoid took 372 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[true, p0, (NOT p1), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 130 ms :[true, p0, (NOT p1), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 133 ms :[true, p0, (NOT p1), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 157 ms.
Product exploration explored 100000 steps with 0 reset in 164 ms.
Built C files in :
/tmp/ltsmin6916702444681189711
[2024-06-02 21:16:10] [INFO ] Computing symmetric may disable matrix : 132 transitions.
[2024-06-02 21:16:10] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:16:10] [INFO ] Computing symmetric may enable matrix : 132 transitions.
[2024-06-02 21:16:10] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:16:10] [INFO ] Computing Do-Not-Accords matrix : 132 transitions.
[2024-06-02 21:16:10] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:16:10] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6916702444681189711
Running compilation step : cd /tmp/ltsmin6916702444681189711;'/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 786 ms.
Running link step : cd /tmp/ltsmin6916702444681189711;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin6916702444681189711;'/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/stateBased16759523680902585218.hoa' '--buchi-type=spotba'
LTSmin run took 160 ms.
FORMULA MedleyA-PT-16-LTLFireability-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-16-LTLFireability-01 finished in 5411 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(F(p1)))))'
Support contains 2 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 324/324 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 155 transition count 313
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 155 transition count 313
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 154 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 154 transition count 312
Applied a total of 14 rules in 10 ms. Remains 154 /161 variables (removed 7) and now considering 312/324 (removed 12) transitions.
// Phase 1: matrix 312 rows 154 cols
[2024-06-02 21:16:11] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 21:16:11] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-02 21:16:11] [INFO ] Invariant cache hit.
[2024-06-02 21:16:11] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
[2024-06-02 21:16:11] [INFO ] Invariant cache hit.
[2024-06-02 21:16:12] [INFO ] Dead Transitions using invariants and state equation in 229 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 154/161 places, 312/324 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 572 ms. Remains : 154/161 places, 312/324 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-16-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(EQ s100 1), p0:(AND (EQ s100 0) (EQ s39 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 280 ms.
Stack based approach found an accepted trace after 21 steps with 0 reset with depth 22 and stack size 22 in 0 ms.
FORMULA MedleyA-PT-16-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-16-LTLFireability-04 finished in 1037 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 324/324 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 155 transition count 313
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 155 transition count 313
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 155 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 154 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 154 transition count 310
Applied a total of 16 rules in 7 ms. Remains 154 /161 variables (removed 7) and now considering 310/324 (removed 14) transitions.
// Phase 1: matrix 310 rows 154 cols
[2024-06-02 21:16:12] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 21:16:12] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-02 21:16:12] [INFO ] Invariant cache hit.
[2024-06-02 21:16:12] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
[2024-06-02 21:16:12] [INFO ] Invariant cache hit.
[2024-06-02 21:16:13] [INFO ] Dead Transitions using invariants and state equation in 224 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 154/161 places, 310/324 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 501 ms. Remains : 154/161 places, 310/324 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-16-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (EQ s28 0) (EQ s41 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 271 ms.
Product exploration explored 100000 steps with 33333 reset in 288 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 15 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-16-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-16-LTLFireability-05 finished in 1216 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(p0&&F(p1))))))'
Support contains 2 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 324/324 transitions.
Graph (trivial) has 170 edges and 161 vertex of which 13 / 161 are part of one of the 3 SCC in 0 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 150 transition count 286
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 31 rules applied. Total rules applied 59 place count 123 transition count 282
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 63 place count 121 transition count 280
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 65 place count 119 transition count 280
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 65 place count 119 transition count 271
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 83 place count 110 transition count 271
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 92 place count 101 transition count 253
Iterating global reduction 4 with 9 rules applied. Total rules applied 101 place count 101 transition count 253
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 4 with 3 rules applied. Total rules applied 104 place count 101 transition count 250
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 105 place count 100 transition count 250
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 106 place count 99 transition count 248
Iterating global reduction 6 with 1 rules applied. Total rules applied 107 place count 99 transition count 248
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 6 with 46 rules applied. Total rules applied 153 place count 76 transition count 225
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 159 place count 76 transition count 219
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 162 place count 73 transition count 210
Iterating global reduction 7 with 3 rules applied. Total rules applied 165 place count 73 transition count 210
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -119
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 7 with 36 rules applied. Total rules applied 201 place count 55 transition count 329
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 202 place count 55 transition count 328
Drop transitions removed 31 transitions
Redundant transition composition rules discarded 31 transitions
Iterating global reduction 8 with 31 rules applied. Total rules applied 233 place count 55 transition count 297
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 237 place count 53 transition count 323
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 238 place count 52 transition count 322
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 51 edges and 50 vertex of which 16 / 50 are part of one of the 7 SCC in 0 ms
Free SCC test removed 9 places
Iterating post reduction 8 with 3 rules applied. Total rules applied 241 place count 41 transition count 322
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 9 with 28 rules applied. Total rules applied 269 place count 41 transition count 294
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 270 place count 40 transition count 280
Iterating global reduction 10 with 1 rules applied. Total rules applied 271 place count 40 transition count 280
Drop transitions removed 94 transitions
Redundant transition composition rules discarded 94 transitions
Iterating global reduction 10 with 94 rules applied. Total rules applied 365 place count 40 transition count 186
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 365 place count 40 transition count 185
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 367 place count 39 transition count 185
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 368 place count 38 transition count 179
Iterating global reduction 10 with 1 rules applied. Total rules applied 369 place count 38 transition count 179
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 371 place count 37 transition count 178
Applied a total of 371 rules in 55 ms. Remains 37 /161 variables (removed 124) and now considering 178/324 (removed 146) transitions.
[2024-06-02 21:16:13] [INFO ] Flow matrix only has 158 transitions (discarded 20 similar events)
// Phase 1: matrix 158 rows 37 cols
[2024-06-02 21:16:13] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 21:16:13] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-06-02 21:16:13] [INFO ] Flow matrix only has 158 transitions (discarded 20 similar events)
[2024-06-02 21:16:13] [INFO ] Invariant cache hit.
[2024-06-02 21:16:13] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 21:16:13] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2024-06-02 21:16:14] [INFO ] Redundant transitions in 66 ms returned [97, 131, 135, 172, 173, 174, 176]
Found 7 redundant transitions using SMT.
Drop transitions removed 7 transitions
Redundant transitions reduction (with SMT) removed 7 transitions.
[2024-06-02 21:16:14] [INFO ] Flow matrix only has 151 transitions (discarded 20 similar events)
// Phase 1: matrix 151 rows 37 cols
[2024-06-02 21:16:14] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 21:16:14] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 37/161 places, 171/324 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 36 transition count 170
Applied a total of 2 rules in 5 ms. Remains 36 /37 variables (removed 1) and now considering 170/171 (removed 1) transitions.
[2024-06-02 21:16:14] [INFO ] Flow matrix only has 150 transitions (discarded 20 similar events)
// Phase 1: matrix 150 rows 36 cols
[2024-06-02 21:16:14] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 21:16:14] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-06-02 21:16:14] [INFO ] Flow matrix only has 150 transitions (discarded 20 similar events)
[2024-06-02 21:16:14] [INFO ] Invariant cache hit.
[2024-06-02 21:16:14] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 21:16:14] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 36/161 places, 170/324 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 524 ms. Remains : 36/161 places, 170/324 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : MedleyA-PT-16-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(NEQ s29 1), p0:(NEQ s24 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 219 ms.
Product exploration explored 100000 steps with 0 reset in 204 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 100 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 2177 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-06-02 21:16:15] [INFO ] Flow matrix only has 150 transitions (discarded 20 similar events)
[2024-06-02 21:16:15] [INFO ] Invariant cache hit.
[2024-06-02 21:16:15] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-02 21:16:15] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0)))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (NOT p0))]
Knowledge based reduction with 8 factoid took 158 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 36 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 : 36/36 places, 170/170 transitions.
Applied a total of 0 rules in 3 ms. Remains 36 /36 variables (removed 0) and now considering 170/170 (removed 0) transitions.
[2024-06-02 21:16:15] [INFO ] Flow matrix only has 150 transitions (discarded 20 similar events)
[2024-06-02 21:16:15] [INFO ] Invariant cache hit.
[2024-06-02 21:16:15] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 21:16:15] [INFO ] Flow matrix only has 150 transitions (discarded 20 similar events)
[2024-06-02 21:16:15] [INFO ] Invariant cache hit.
[2024-06-02 21:16:15] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 21:16:15] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2024-06-02 21:16:15] [INFO ] Redundant transitions in 24 ms returned []
[2024-06-02 21:16:15] [INFO ] Flow matrix only has 150 transitions (discarded 20 similar events)
[2024-06-02 21:16:15] [INFO ] Invariant cache hit.
[2024-06-02 21:16:15] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 314 ms. Remains : 36/36 places, 170/170 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 203 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Finished random walk after 537 steps, including 127 resets, run visited all 1 properties in 2 ms. (steps per millisecond=268 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 43 ms.
Product exploration explored 100000 steps with 0 reset in 101 ms.
Built C files in :
/tmp/ltsmin16333044904681246477
[2024-06-02 21:16:16] [INFO ] Computing symmetric may disable matrix : 170 transitions.
[2024-06-02 21:16:16] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:16:16] [INFO ] Computing symmetric may enable matrix : 170 transitions.
[2024-06-02 21:16:16] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:16:16] [INFO ] Computing Do-Not-Accords matrix : 170 transitions.
[2024-06-02 21:16:16] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:16:16] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16333044904681246477
Running compilation step : cd /tmp/ltsmin16333044904681246477;'/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 537 ms.
Running link step : cd /tmp/ltsmin16333044904681246477;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin16333044904681246477;'/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/stateBased17607258359077516545.hoa' '--buchi-type=spotba'
LTSmin run took 180 ms.
FORMULA MedleyA-PT-16-LTLFireability-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-16-LTLFireability-06 finished in 3571 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X((G(F(!p1))||G((p0||G(p1))))))))'
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 324/324 transitions.
Graph (trivial) has 165 edges and 161 vertex of which 13 / 161 are part of one of the 3 SCC in 0 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 150 transition count 284
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 33 rules applied. Total rules applied 63 place count 121 transition count 280
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 119 transition count 280
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 65 place count 119 transition count 272
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 81 place count 111 transition count 272
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 89 place count 103 transition count 256
Iterating global reduction 3 with 8 rules applied. Total rules applied 97 place count 103 transition count 256
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 3 with 3 rules applied. Total rules applied 100 place count 103 transition count 253
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 101 place count 102 transition count 253
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 102 place count 101 transition count 251
Iterating global reduction 5 with 1 rules applied. Total rules applied 103 place count 101 transition count 251
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 145 place count 80 transition count 230
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 151 place count 80 transition count 224
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 155 place count 76 transition count 213
Iterating global reduction 6 with 4 rules applied. Total rules applied 159 place count 76 transition count 213
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -103
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 191 place count 60 transition count 316
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 192 place count 60 transition count 315
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 194 place count 59 transition count 332
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 7 with 26 rules applied. Total rules applied 220 place count 59 transition count 306
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 221 place count 58 transition count 305
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 55 edges and 56 vertex of which 19 / 56 are part of one of the 8 SCC in 1 ms
Free SCC test removed 11 places
Iterating post reduction 7 with 3 rules applied. Total rules applied 224 place count 45 transition count 305
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 8 with 43 rules applied. Total rules applied 267 place count 45 transition count 262
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 269 place count 43 transition count 240
Iterating global reduction 9 with 2 rules applied. Total rules applied 271 place count 43 transition count 240
Drop transitions removed 73 transitions
Redundant transition composition rules discarded 73 transitions
Iterating global reduction 9 with 73 rules applied. Total rules applied 344 place count 43 transition count 167
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 344 place count 43 transition count 166
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 346 place count 42 transition count 166
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 348 place count 40 transition count 158
Iterating global reduction 9 with 2 rules applied. Total rules applied 350 place count 40 transition count 158
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 354 place count 38 transition count 156
Applied a total of 354 rules in 42 ms. Remains 38 /161 variables (removed 123) and now considering 156/324 (removed 168) transitions.
[2024-06-02 21:16:17] [INFO ] Flow matrix only has 144 transitions (discarded 12 similar events)
// Phase 1: matrix 144 rows 38 cols
[2024-06-02 21:16:17] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 21:16:17] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-06-02 21:16:17] [INFO ] Flow matrix only has 144 transitions (discarded 12 similar events)
[2024-06-02 21:16:17] [INFO ] Invariant cache hit.
[2024-06-02 21:16:17] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-06-02 21:16:17] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2024-06-02 21:16:17] [INFO ] Redundant transitions in 22 ms returned [117, 155]
Found 2 redundant transitions using SMT.
Drop transitions removed 2 transitions
Redundant transitions reduction (with SMT) removed 2 transitions.
[2024-06-02 21:16:17] [INFO ] Flow matrix only has 142 transitions (discarded 12 similar events)
// Phase 1: matrix 142 rows 38 cols
[2024-06-02 21:16:17] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 21:16:17] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 38/161 places, 154/324 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 37 transition count 153
Applied a total of 2 rules in 3 ms. Remains 37 /38 variables (removed 1) and now considering 153/154 (removed 1) transitions.
[2024-06-02 21:16:17] [INFO ] Flow matrix only has 141 transitions (discarded 12 similar events)
// Phase 1: matrix 141 rows 37 cols
[2024-06-02 21:16:17] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 21:16:17] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-06-02 21:16:17] [INFO ] Flow matrix only has 141 transitions (discarded 12 similar events)
[2024-06-02 21:16:17] [INFO ] Invariant cache hit.
[2024-06-02 21:16:17] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-06-02 21:16:17] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 37/161 places, 153/324 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 440 ms. Remains : 37/161 places, 153/324 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), false, (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : MedleyA-PT-16-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(OR p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(NEQ s1 1), p1:(AND (EQ s10 1) (EQ s20 1) (EQ s36 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 65 ms.
Product exploration explored 100000 steps with 0 reset in 53 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (OR p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 90 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[false, (AND (NOT p0) p1), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 1507 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 683 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 682 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 523 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 585 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 4) seen :0
Probably explored full state space saw : 3230 states, properties seen :3
Probabilistic random walk after 18317 steps, saw 3230 distinct states, run finished after 65 ms. (steps per millisecond=281 ) properties seen :3
Explored full state space saw : 3230 states, properties seen :0
Exhaustive walk after 18317 steps, saw 3230 distinct states, run finished after 35 ms. (steps per millisecond=523 ) properties seen :0
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (OR p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p0)), (F (AND (NOT p0) (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 16 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-16-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-16-LTLFireability-07 finished in 1605 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 324/324 transitions.
Graph (trivial) has 166 edges and 161 vertex of which 9 / 161 are part of one of the 2 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 153 transition count 287
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 33 rules applied. Total rules applied 63 place count 124 transition count 283
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 122 transition count 283
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 65 place count 122 transition count 275
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 81 place count 114 transition count 275
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 90 place count 105 transition count 257
Iterating global reduction 3 with 9 rules applied. Total rules applied 99 place count 105 transition count 257
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 3 with 3 rules applied. Total rules applied 102 place count 105 transition count 254
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 103 place count 104 transition count 254
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 104 place count 103 transition count 252
Iterating global reduction 5 with 1 rules applied. Total rules applied 105 place count 103 transition count 252
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 153 place count 79 transition count 228
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 159 place count 79 transition count 222
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 162 place count 76 transition count 214
Iterating global reduction 6 with 3 rules applied. Total rules applied 165 place count 76 transition count 214
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -103
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 197 place count 60 transition count 317
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 198 place count 60 transition count 316
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 7 with 16 rules applied. Total rules applied 214 place count 60 transition count 300
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 218 place count 58 transition count 326
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 219 place count 57 transition count 325
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 50 edges and 55 vertex of which 17 / 55 are part of one of the 7 SCC in 0 ms
Free SCC test removed 10 places
Iterating post reduction 7 with 3 rules applied. Total rules applied 222 place count 45 transition count 325
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 8 with 41 rules applied. Total rules applied 263 place count 45 transition count 284
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 265 place count 43 transition count 262
Iterating global reduction 9 with 2 rules applied. Total rules applied 267 place count 43 transition count 262
Drop transitions removed 70 transitions
Redundant transition composition rules discarded 70 transitions
Iterating global reduction 9 with 70 rules applied. Total rules applied 337 place count 43 transition count 192
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 337 place count 43 transition count 191
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 339 place count 42 transition count 191
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 341 place count 40 transition count 182
Iterating global reduction 9 with 2 rules applied. Total rules applied 343 place count 40 transition count 182
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 347 place count 38 transition count 180
Applied a total of 347 rules in 46 ms. Remains 38 /161 variables (removed 123) and now considering 180/324 (removed 144) transitions.
[2024-06-02 21:16:18] [INFO ] Flow matrix only has 160 transitions (discarded 20 similar events)
// Phase 1: matrix 160 rows 38 cols
[2024-06-02 21:16:18] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 21:16:19] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-06-02 21:16:19] [INFO ] Flow matrix only has 160 transitions (discarded 20 similar events)
[2024-06-02 21:16:19] [INFO ] Invariant cache hit.
[2024-06-02 21:16:19] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 21:16:19] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2024-06-02 21:16:19] [INFO ] Redundant transitions in 26 ms returned [135, 136, 176, 177, 178, 179]
Found 6 redundant transitions using SMT.
Drop transitions removed 6 transitions
Redundant transitions reduction (with SMT) removed 6 transitions.
[2024-06-02 21:16:19] [INFO ] Flow matrix only has 154 transitions (discarded 20 similar events)
// Phase 1: matrix 154 rows 38 cols
[2024-06-02 21:16:19] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 21:16:19] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 38/161 places, 174/324 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 35 transition count 171
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 18 place count 35 transition count 159
Applied a total of 18 rules in 9 ms. Remains 35 /38 variables (removed 3) and now considering 159/174 (removed 15) transitions.
[2024-06-02 21:16:19] [INFO ] Flow matrix only has 146 transitions (discarded 13 similar events)
// Phase 1: matrix 146 rows 35 cols
[2024-06-02 21:16:19] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 21:16:19] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-06-02 21:16:19] [INFO ] Flow matrix only has 146 transitions (discarded 13 similar events)
[2024-06-02 21:16:19] [INFO ] Invariant cache hit.
[2024-06-02 21:16:19] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-06-02 21:16:19] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 35/161 places, 159/324 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 506 ms. Remains : 35/161 places, 159/324 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-16-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s6 1) (EQ s19 1) (EQ s33 1)), p1:(EQ s24 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-16-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-16-LTLFireability-09 finished in 650 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 324/324 transitions.
Graph (trivial) has 171 edges and 161 vertex of which 13 / 161 are part of one of the 3 SCC in 0 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 150 transition count 285
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 32 rules applied. Total rules applied 61 place count 122 transition count 281
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 63 place count 120 transition count 281
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 63 place count 120 transition count 272
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 81 place count 111 transition count 272
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 89 place count 103 transition count 256
Iterating global reduction 3 with 8 rules applied. Total rules applied 97 place count 103 transition count 256
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 3 with 3 rules applied. Total rules applied 100 place count 103 transition count 253
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 101 place count 102 transition count 253
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 102 place count 101 transition count 251
Iterating global reduction 5 with 1 rules applied. Total rules applied 103 place count 101 transition count 251
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 5 with 44 rules applied. Total rules applied 147 place count 79 transition count 229
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 152 place count 79 transition count 224
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 156 place count 75 transition count 213
Iterating global reduction 6 with 4 rules applied. Total rules applied 160 place count 75 transition count 213
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -106
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 36 rules applied. Total rules applied 196 place count 57 transition count 319
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 199 place count 57 transition count 316
Drop transitions removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 7 with 28 rules applied. Total rules applied 227 place count 57 transition count 288
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 231 place count 55 transition count 314
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 232 place count 54 transition count 313
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 55 edges and 52 vertex of which 19 / 52 are part of one of the 8 SCC in 0 ms
Free SCC test removed 11 places
Iterating post reduction 7 with 3 rules applied. Total rules applied 235 place count 41 transition count 313
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 8 with 43 rules applied. Total rules applied 278 place count 41 transition count 270
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 280 place count 39 transition count 248
Iterating global reduction 9 with 2 rules applied. Total rules applied 282 place count 39 transition count 248
Drop transitions removed 75 transitions
Redundant transition composition rules discarded 75 transitions
Iterating global reduction 9 with 75 rules applied. Total rules applied 357 place count 39 transition count 173
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 9 with 1 rules applied. Total rules applied 358 place count 39 transition count 172
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 359 place count 38 transition count 172
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 361 place count 36 transition count 164
Iterating global reduction 11 with 2 rules applied. Total rules applied 363 place count 36 transition count 164
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 367 place count 34 transition count 162
Applied a total of 367 rules in 59 ms. Remains 34 /161 variables (removed 127) and now considering 162/324 (removed 162) transitions.
[2024-06-02 21:16:19] [INFO ] Flow matrix only has 142 transitions (discarded 20 similar events)
// Phase 1: matrix 142 rows 34 cols
[2024-06-02 21:16:19] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 21:16:19] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-06-02 21:16:19] [INFO ] Flow matrix only has 142 transitions (discarded 20 similar events)
[2024-06-02 21:16:19] [INFO ] Invariant cache hit.
[2024-06-02 21:16:19] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 21:16:19] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2024-06-02 21:16:19] [INFO ] Redundant transitions in 26 ms returned [118, 161]
Found 2 redundant transitions using SMT.
Drop transitions removed 2 transitions
Redundant transitions reduction (with SMT) removed 2 transitions.
[2024-06-02 21:16:19] [INFO ] Flow matrix only has 140 transitions (discarded 20 similar events)
// Phase 1: matrix 140 rows 34 cols
[2024-06-02 21:16:19] [INFO ] Computed 5 invariants in 0 ms
[2024-06-02 21:16:19] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 34/161 places, 160/324 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 33 transition count 159
Applied a total of 2 rules in 4 ms. Remains 33 /34 variables (removed 1) and now considering 159/160 (removed 1) transitions.
[2024-06-02 21:16:19] [INFO ] Flow matrix only has 139 transitions (discarded 20 similar events)
// Phase 1: matrix 139 rows 33 cols
[2024-06-02 21:16:19] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 21:16:19] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-06-02 21:16:19] [INFO ] Flow matrix only has 139 transitions (discarded 20 similar events)
[2024-06-02 21:16:19] [INFO ] Invariant cache hit.
[2024-06-02 21:16:20] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 21:16:20] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 33/161 places, 159/324 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 501 ms. Remains : 33/161 places, 159/324 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-16-LTLFireability-10 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 s26 0)], nbAcceptance=1, 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 0 reset in 55 ms.
Product exploration explored 100000 steps with 0 reset in 59 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Finished random walk after 1232 steps, including 274 resets, run visited all 1 properties in 3 ms. (steps per millisecond=410 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Support contains 1 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 159/159 transitions.
Applied a total of 0 rules in 3 ms. Remains 33 /33 variables (removed 0) and now considering 159/159 (removed 0) transitions.
[2024-06-02 21:16:20] [INFO ] Flow matrix only has 139 transitions (discarded 20 similar events)
[2024-06-02 21:16:20] [INFO ] Invariant cache hit.
[2024-06-02 21:16:20] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-02 21:16:20] [INFO ] Flow matrix only has 139 transitions (discarded 20 similar events)
[2024-06-02 21:16:20] [INFO ] Invariant cache hit.
[2024-06-02 21:16:20] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-06-02 21:16:20] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2024-06-02 21:16:20] [INFO ] Redundant transitions in 17 ms returned []
[2024-06-02 21:16:20] [INFO ] Flow matrix only has 139 transitions (discarded 20 similar events)
[2024-06-02 21:16:20] [INFO ] Invariant cache hit.
[2024-06-02 21:16:20] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 316 ms. Remains : 33/33 places, 159/159 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 175 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 35 ms :[(NOT p0)]
Finished random walk after 679 steps, including 144 resets, run visited all 1 properties in 2 ms. (steps per millisecond=339 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 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 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 62 ms.
Product exploration explored 100000 steps with 0 reset in 63 ms.
Built C files in :
/tmp/ltsmin10621152399766072488
[2024-06-02 21:16:21] [INFO ] Computing symmetric may disable matrix : 159 transitions.
[2024-06-02 21:16:21] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:16:21] [INFO ] Computing symmetric may enable matrix : 159 transitions.
[2024-06-02 21:16:21] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:16:21] [INFO ] Computing Do-Not-Accords matrix : 159 transitions.
[2024-06-02 21:16:21] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:16:21] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10621152399766072488
Running compilation step : cd /tmp/ltsmin10621152399766072488;'/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 506 ms.
Running link step : cd /tmp/ltsmin10621152399766072488;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin10621152399766072488;'/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/stateBased7719343794130216008.hoa' '--buchi-type=spotba'
LTSmin run took 171 ms.
FORMULA MedleyA-PT-16-LTLFireability-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-16-LTLFireability-10 finished in 2675 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 324/324 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 155 transition count 313
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 155 transition count 313
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 154 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 154 transition count 312
Applied a total of 14 rules in 4 ms. Remains 154 /161 variables (removed 7) and now considering 312/324 (removed 12) transitions.
// Phase 1: matrix 312 rows 154 cols
[2024-06-02 21:16:22] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 21:16:22] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-06-02 21:16:22] [INFO ] Invariant cache hit.
[2024-06-02 21:16:22] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
[2024-06-02 21:16:22] [INFO ] Invariant cache hit.
[2024-06-02 21:16:22] [INFO ] Dead Transitions using invariants and state equation in 207 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 154/161 places, 312/324 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 558 ms. Remains : 154/161 places, 312/324 transitions.
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-16-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s115 1) (EQ s101 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-16-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-16-LTLFireability-11 finished in 668 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 U (G((p0||G(p1)))||((p0||G(p1))&&X(!p2))))))'
Support contains 3 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 324/324 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 155 transition count 313
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 155 transition count 313
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 155 transition count 311
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 154 transition count 310
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 154 transition count 310
Applied a total of 16 rules in 5 ms. Remains 154 /161 variables (removed 7) and now considering 310/324 (removed 14) transitions.
// Phase 1: matrix 310 rows 154 cols
[2024-06-02 21:16:22] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 21:16:23] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-02 21:16:23] [INFO ] Invariant cache hit.
[2024-06-02 21:16:23] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
[2024-06-02 21:16:23] [INFO ] Invariant cache hit.
[2024-06-02 21:16:23] [INFO ] Dead Transitions using invariants and state equation in 230 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 154/161 places, 310/324 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 640 ms. Remains : 154/161 places, 310/324 transitions.
Stuttering acceptance computed with spot in 168 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) p2), (NOT p1)]
Running random walk in product with property : MedleyA-PT-16-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 0}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(NEQ s68 1), p1:(NEQ s36 1), p2:(OR (EQ s68 1) (EQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 206 ms.
Product exploration explored 100000 steps with 33333 reset in 222 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 149 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-16-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-16-LTLFireability-12 finished in 1417 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 X((!p1||F(p2)))))'
Support contains 5 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 324/324 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 156 transition count 314
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 156 transition count 314
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 156 transition count 312
Applied a total of 12 rules in 5 ms. Remains 156 /161 variables (removed 5) and now considering 312/324 (removed 12) transitions.
// Phase 1: matrix 312 rows 156 cols
[2024-06-02 21:16:24] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 21:16:24] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-02 21:16:24] [INFO ] Invariant cache hit.
[2024-06-02 21:16:24] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
[2024-06-02 21:16:24] [INFO ] Invariant cache hit.
[2024-06-02 21:16:24] [INFO ] Dead Transitions using invariants and state equation in 222 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 156/161 places, 312/324 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 523 ms. Remains : 156/161 places, 312/324 transitions.
Stuttering acceptance computed with spot in 201 ms :[(AND p1 (NOT p2)), (AND (NOT p2) p1), (AND p1 (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : MedleyA-PT-16-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s21 1) (EQ s35 1) (EQ s153 1)), p1:(NEQ s7 1), p2:(NEQ s119 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 242 ms.
Product exploration explored 100000 steps with 50000 reset in 253 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 20 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-16-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-16-LTLFireability-13 finished in 1267 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0)) U (F(G(p1)) U p0)))'
Support contains 3 out of 161 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 : 161/161 places, 324/324 transitions.
Graph (trivial) has 151 edges and 161 vertex of which 8 / 161 are part of one of the 2 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 154 transition count 290
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 31 rules applied. Total rules applied 59 place count 127 transition count 286
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 62 place count 125 transition count 285
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 63 place count 124 transition count 285
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 63 place count 124 transition count 275
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 83 place count 114 transition count 275
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 92 place count 105 transition count 257
Iterating global reduction 4 with 9 rules applied. Total rules applied 101 place count 105 transition count 257
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 4 with 3 rules applied. Total rules applied 104 place count 105 transition count 254
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 105 place count 104 transition count 254
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 106 place count 103 transition count 252
Iterating global reduction 6 with 1 rules applied. Total rules applied 107 place count 103 transition count 252
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 6 with 44 rules applied. Total rules applied 151 place count 81 transition count 230
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 153 place count 81 transition count 228
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 157 place count 77 transition count 217
Iterating global reduction 7 with 4 rules applied. Total rules applied 161 place count 77 transition count 217
Performed 12 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 7 with 24 rules applied. Total rules applied 185 place count 65 transition count 292
Drop transitions removed 33 transitions
Redundant transition composition rules discarded 33 transitions
Iterating global reduction 7 with 33 rules applied. Total rules applied 218 place count 65 transition count 259
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 220 place count 64 transition count 258
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 222 place count 63 transition count 267
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 223 place count 62 transition count 266
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 57 edges and 60 vertex of which 21 / 60 are part of one of the 8 SCC in 0 ms
Free SCC test removed 13 places
Iterating post reduction 7 with 3 rules applied. Total rules applied 226 place count 47 transition count 266
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 8 with 45 rules applied. Total rules applied 271 place count 47 transition count 221
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 273 place count 45 transition count 200
Iterating global reduction 9 with 2 rules applied. Total rules applied 275 place count 45 transition count 200
Drop transitions removed 66 transitions
Redundant transition composition rules discarded 66 transitions
Iterating global reduction 9 with 66 rules applied. Total rules applied 341 place count 45 transition count 134
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 1 rules applied. Total rules applied 342 place count 45 transition count 133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 343 place count 44 transition count 133
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 346 place count 41 transition count 125
Iterating global reduction 11 with 3 rules applied. Total rules applied 349 place count 41 transition count 125
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 351 place count 40 transition count 124
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 353 place count 39 transition count 128
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 11 with 6 rules applied. Total rules applied 359 place count 39 transition count 122
Applied a total of 359 rules in 51 ms. Remains 39 /161 variables (removed 122) and now considering 122/324 (removed 202) transitions.
[2024-06-02 21:16:25] [INFO ] Flow matrix only has 118 transitions (discarded 4 similar events)
// Phase 1: matrix 118 rows 39 cols
[2024-06-02 21:16:25] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 21:16:25] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-06-02 21:16:25] [INFO ] Flow matrix only has 118 transitions (discarded 4 similar events)
[2024-06-02 21:16:25] [INFO ] Invariant cache hit.
[2024-06-02 21:16:25] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-02 21:16:25] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2024-06-02 21:16:25] [INFO ] Redundant transitions in 44 ms returned [91, 115]
Found 2 redundant transitions using SMT.
Drop transitions removed 2 transitions
Redundant transitions reduction (with SMT) removed 2 transitions.
[2024-06-02 21:16:25] [INFO ] Flow matrix only has 116 transitions (discarded 4 similar events)
// Phase 1: matrix 116 rows 39 cols
[2024-06-02 21:16:25] [INFO ] Computed 5 invariants in 0 ms
[2024-06-02 21:16:25] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 39/161 places, 120/324 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 37 transition count 118
Applied a total of 4 rules in 3 ms. Remains 37 /39 variables (removed 2) and now considering 118/120 (removed 2) transitions.
[2024-06-02 21:16:25] [INFO ] Flow matrix only has 114 transitions (discarded 4 similar events)
// Phase 1: matrix 114 rows 37 cols
[2024-06-02 21:16:25] [INFO ] Computed 5 invariants in 0 ms
[2024-06-02 21:16:25] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-06-02 21:16:25] [INFO ] Flow matrix only has 114 transitions (discarded 4 similar events)
[2024-06-02 21:16:25] [INFO ] Invariant cache hit.
[2024-06-02 21:16:26] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-02 21:16:26] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 37/161 places, 118/324 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 442 ms. Remains : 37/161 places, 118/324 transitions.
Stuttering acceptance computed with spot in 255 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-16-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s9 1) (EQ s26 1) (EQ s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-16-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-16-LTLFireability-14 finished in 715 ms.
All properties solved by simple procedures.
Total runtime 27282 ms.

BK_STOP 1717362987459

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

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