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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 14K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K 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 184K 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-19-LTLFireability-00
FORMULA_NAME MedleyA-PT-19-LTLFireability-01
FORMULA_NAME MedleyA-PT-19-LTLFireability-02
FORMULA_NAME MedleyA-PT-19-LTLFireability-03
FORMULA_NAME MedleyA-PT-19-LTLFireability-04
FORMULA_NAME MedleyA-PT-19-LTLFireability-05
FORMULA_NAME MedleyA-PT-19-LTLFireability-06
FORMULA_NAME MedleyA-PT-19-LTLFireability-07
FORMULA_NAME MedleyA-PT-19-LTLFireability-08
FORMULA_NAME MedleyA-PT-19-LTLFireability-09
FORMULA_NAME MedleyA-PT-19-LTLFireability-10
FORMULA_NAME MedleyA-PT-19-LTLFireability-11
FORMULA_NAME MedleyA-PT-19-LTLFireability-12
FORMULA_NAME MedleyA-PT-19-LTLFireability-13
FORMULA_NAME MedleyA-PT-19-LTLFireability-14
FORMULA_NAME MedleyA-PT-19-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717363617312

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-19
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-06-02 21:26: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:27:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:27:00] [INFO ] Load time of PNML (sax parser for PT used): 136 ms
[2024-06-02 21:27:00] [INFO ] Transformed 272 places.
[2024-06-02 21:27:00] [INFO ] Transformed 586 transitions.
[2024-06-02 21:27:00] [INFO ] Found NUPN structural information;
[2024-06-02 21:27:00] [INFO ] Parsed PT model containing 272 places and 586 transitions and 2889 arcs in 252 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 3 places in 10 ms
Reduce places removed 3 places and 3 transitions.
FORMULA MedleyA-PT-19-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 583/583 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 267 transition count 583
Discarding 75 places :
Symmetric choice reduction at 1 with 75 rule applications. Total rules 77 place count 192 transition count 496
Iterating global reduction 1 with 75 rules applied. Total rules applied 152 place count 192 transition count 496
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 155 place count 189 transition count 490
Iterating global reduction 1 with 3 rules applied. Total rules applied 158 place count 189 transition count 490
Applied a total of 158 rules in 80 ms. Remains 189 /269 variables (removed 80) and now considering 490/583 (removed 93) transitions.
// Phase 1: matrix 490 rows 189 cols
[2024-06-02 21:27:00] [INFO ] Computed 22 invariants in 19 ms
[2024-06-02 21:27:00] [INFO ] Implicit Places using invariants in 288 ms returned []
[2024-06-02 21:27:00] [INFO ] Invariant cache hit.
[2024-06-02 21:27:01] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 717 ms to find 0 implicit places.
[2024-06-02 21:27:01] [INFO ] Invariant cache hit.
[2024-06-02 21:27:01] [INFO ] Dead Transitions using invariants and state equation in 322 ms found 120 transitions.
Found 120 dead transitions using SMT.
Drop transitions removed 120 transitions
Dead transitions reduction (with SMT) removed 120 transitions
Starting structural reductions in LTL mode, iteration 1 : 189/269 places, 370/583 transitions.
Applied a total of 0 rules in 10 ms. Remains 189 /189 variables (removed 0) and now considering 370/370 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1131 ms. Remains : 189/269 places, 370/583 transitions.
Support contains 40 out of 189 places after structural reductions.
[2024-06-02 21:27:01] [INFO ] Flatten gal took : 85 ms
[2024-06-02 21:27:01] [INFO ] Flatten gal took : 43 ms
[2024-06-02 21:27:02] [INFO ] Input system was already deterministic with 370 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 615 ms. (steps per millisecond=16 ) properties (out of 29) seen :5
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) 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 24) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :1
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Running SMT prover for 21 properties.
// Phase 1: matrix 370 rows 189 cols
[2024-06-02 21:27:03] [INFO ] Computed 22 invariants in 9 ms
[2024-06-02 21:27:03] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-06-02 21:27:03] [INFO ] [Real]Absence check using 6 positive and 16 generalized place invariants in 9 ms returned sat
[2024-06-02 21:27:03] [INFO ] After 290ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:19
[2024-06-02 21:27:03] [INFO ] [Nat]Absence check using 6 positive place invariants in 9 ms returned sat
[2024-06-02 21:27:03] [INFO ] [Nat]Absence check using 6 positive and 16 generalized place invariants in 8 ms returned sat
[2024-06-02 21:27:04] [INFO ] After 561ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :17
[2024-06-02 21:27:04] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 8 ms to minimize.
[2024-06-02 21:27:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 122 ms
[2024-06-02 21:27:04] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 1 ms to minimize.
[2024-06-02 21:27:04] [INFO ] Deduced a trap composed of 51 places in 95 ms of which 2 ms to minimize.
[2024-06-02 21:27:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 258 ms
[2024-06-02 21:27:04] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 2 ms to minimize.
[2024-06-02 21:27:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2024-06-02 21:27:05] [INFO ] After 1572ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :17
Attempting to minimize the solution found.
Minimization took 331 ms.
[2024-06-02 21:27:05] [INFO ] After 2194ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :17
Fused 21 Parikh solutions to 17 different solutions.
Parikh walk visited 3 properties in 143 ms.
Support contains 23 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 370/370 transitions.
Graph (complete) has 660 edges and 189 vertex of which 187 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 187 transition count 345
Reduce places removed 23 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 25 rules applied. Total rules applied 49 place count 164 transition count 343
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 51 place count 163 transition count 342
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 52 place count 162 transition count 342
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 52 place count 162 transition count 333
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 70 place count 153 transition count 333
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 75 place count 148 transition count 325
Iterating global reduction 4 with 5 rules applied. Total rules applied 80 place count 148 transition count 325
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 132 place count 121 transition count 300
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 134 place count 121 transition count 298
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 144 place count 116 transition count 327
Drop transitions removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 5 with 22 rules applied. Total rules applied 166 place count 116 transition count 305
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 2 rules applied. Total rules applied 168 place count 116 transition count 303
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 170 place count 114 transition count 303
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 172 place count 113 transition count 313
Free-agglomeration rule applied 6 times.
Iterating global reduction 7 with 6 rules applied. Total rules applied 178 place count 113 transition count 307
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 184 place count 107 transition count 307
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 8 with 12 rules applied. Total rules applied 196 place count 107 transition count 353
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 22 rules applied. Total rules applied 218 place count 95 transition count 343
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 9 with 12 rules applied. Total rules applied 230 place count 95 transition count 343
Applied a total of 230 rules in 140 ms. Remains 95 /189 variables (removed 94) and now considering 343/370 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 95/189 places, 343/370 transitions.
Incomplete random walk after 10000 steps, including 730 resets, run finished after 275 ms. (steps per millisecond=36 ) properties (out of 14) seen :4
Incomplete Best-First random walk after 10001 steps, including 136 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10001 steps, including 133 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 129 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 72 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 133 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 142 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 343 rows 95 cols
[2024-06-02 21:27:06] [INFO ] Computed 20 invariants in 3 ms
[2024-06-02 21:27:06] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-02 21:27:06] [INFO ] [Real]Absence check using 10 positive and 10 generalized place invariants in 4 ms returned sat
[2024-06-02 21:27:06] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-06-02 21:27:06] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-02 21:27:06] [INFO ] [Nat]Absence check using 10 positive and 10 generalized place invariants in 4 ms returned sat
[2024-06-02 21:27:07] [INFO ] After 239ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-06-02 21:27:07] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-02 21:27:07] [INFO ] After 148ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2024-06-02 21:27:07] [INFO ] After 352ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 132 ms.
[2024-06-02 21:27:07] [INFO ] After 806ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 1 properties in 30 ms.
Support contains 13 out of 95 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 95/95 places, 343/343 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 95 transition count 341
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 93 transition count 341
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 92 transition count 340
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 92 transition count 340
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 14 place count 88 transition count 336
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 88 transition count 334
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 18 place count 86 transition count 334
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 21 place count 86 transition count 426
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 45 place count 83 transition count 405
Applied a total of 45 rules in 46 ms. Remains 83 /95 variables (removed 12) and now considering 405/343 (removed -62) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 83/95 places, 405/343 transitions.
Incomplete random walk after 10000 steps, including 780 resets, run finished after 242 ms. (steps per millisecond=41 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 149 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 136 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 117 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 143 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10000 steps, including 103 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 405 rows 83 cols
[2024-06-02 21:27:08] [INFO ] Computed 20 invariants in 4 ms
[2024-06-02 21:27:08] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-02 21:27:08] [INFO ] [Real]Absence check using 10 positive and 10 generalized place invariants in 4 ms returned sat
[2024-06-02 21:27:08] [INFO ] After 254ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2024-06-02 21:27:08] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-02 21:27:08] [INFO ] After 18ms SMT Verify possible using 16 Read/Feed constraints in real domain returned unsat :0 sat :0 real:5
[2024-06-02 21:27:08] [INFO ] After 341ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-06-02 21:27:08] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-02 21:27:08] [INFO ] [Nat]Absence check using 10 positive and 10 generalized place invariants in 5 ms returned sat
[2024-06-02 21:27:08] [INFO ] After 255ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-06-02 21:27:08] [INFO ] After 121ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-06-02 21:27:09] [INFO ] After 284ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 118 ms.
[2024-06-02 21:27:09] [INFO ] After 724ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 3 properties in 27 ms.
Support contains 4 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 405/405 transitions.
Drop transitions 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 0 with 2 rules applied. Total rules applied 2 place count 83 transition count 403
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 82 transition count 403
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 3 place count 82 transition count 401
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 7 place count 80 transition count 401
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 15 rules applied. Total rules applied 22 place count 72 transition count 394
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 72 transition count 416
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 36 place count 71 transition count 404
Applied a total of 36 rules in 50 ms. Remains 71 /83 variables (removed 12) and now considering 404/405 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 71/83 places, 404/405 transitions.
Incomplete random walk after 10000 steps, including 1404 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 206 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 152 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1352721 steps, run timeout after 3001 ms. (steps per millisecond=450 ) properties seen :{1=1}
Probabilistic random walk after 1352721 steps, saw 209284 distinct states, run finished after 3002 ms. (steps per millisecond=450 ) properties seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 404 rows 71 cols
[2024-06-02 21:27:12] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 21:27:12] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-06-02 21:27:12] [INFO ] [Real]Absence check using 15 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-02 21:27:12] [INFO ] After 124ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-02 21:27:12] [INFO ] State equation strengthened by 174 read => feed constraints.
[2024-06-02 21:27:12] [INFO ] After 33ms SMT Verify possible using 174 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:27:12] [INFO ] After 207ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:27:12] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2024-06-02 21:27:12] [INFO ] [Nat]Absence check using 15 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-02 21:27:12] [INFO ] After 126ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 21:27:12] [INFO ] After 36ms SMT Verify possible using 174 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 21:27:12] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2024-06-02 21:27:12] [INFO ] After 242ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 18 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=18 )
Parikh walk visited 1 properties in 1 ms.
FORMULA MedleyA-PT-19-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
FORMULA MedleyA-PT-19-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-19-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 19 stabilizing places and 19 stable transitions
Graph (complete) has 660 edges and 189 vertex of which 187 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 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) U p1))))'
Support contains 2 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 370/370 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 184 transition count 365
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 184 transition count 365
Applied a total of 10 rules in 7 ms. Remains 184 /189 variables (removed 5) and now considering 365/370 (removed 5) transitions.
// Phase 1: matrix 365 rows 184 cols
[2024-06-02 21:27:13] [INFO ] Computed 22 invariants in 5 ms
[2024-06-02 21:27:13] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-06-02 21:27:13] [INFO ] Invariant cache hit.
[2024-06-02 21:27:13] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
[2024-06-02 21:27:13] [INFO ] Invariant cache hit.
[2024-06-02 21:27:14] [INFO ] Dead Transitions using invariants and state equation in 257 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 184/189 places, 365/370 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 633 ms. Remains : 184/189 places, 365/370 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 348 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : MedleyA-PT-19-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s135 1), p0:(EQ s33 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 36 steps with 0 reset in 3 ms.
FORMULA MedleyA-PT-19-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-19-LTLFireability-00 finished in 1062 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0)||F(p1)) U (p2||X(X(F(p1))))))'
Support contains 7 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 370/370 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 185 transition count 366
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 185 transition count 366
Applied a total of 8 rules in 8 ms. Remains 185 /189 variables (removed 4) and now considering 366/370 (removed 4) transitions.
// Phase 1: matrix 366 rows 185 cols
[2024-06-02 21:27:14] [INFO ] Computed 22 invariants in 3 ms
[2024-06-02 21:27:14] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-06-02 21:27:14] [INFO ] Invariant cache hit.
[2024-06-02 21:27:14] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
[2024-06-02 21:27:14] [INFO ] Invariant cache hit.
[2024-06-02 21:27:15] [INFO ] Dead Transitions using invariants and state equation in 258 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 185/189 places, 366/370 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 624 ms. Remains : 185/189 places, 366/370 transitions.
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : MedleyA-PT-19-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p2) p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s62 1) (EQ s65 1) (EQ s113 1) (EQ s140 1)), p0:(AND (EQ s113 1) (EQ s128 1) (EQ s146 1)), p1:(EQ s160 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]]
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-19-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-19-LTLFireability-01 finished in 845 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))'
Support contains 4 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 370/370 transitions.
Graph (complete) has 660 edges and 189 vertex of which 187 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 186 transition count 337
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 1 with 36 rules applied. Total rules applied 67 place count 156 transition count 331
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 70 place count 153 transition count 331
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 70 place count 153 transition count 320
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 92 place count 142 transition count 320
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 100 place count 134 transition count 309
Iterating global reduction 3 with 8 rules applied. Total rules applied 108 place count 134 transition count 309
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 108 place count 134 transition count 308
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 110 place count 133 transition count 308
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 63 rules applied. Total rules applied 173 place count 100 transition count 278
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 183 place count 95 transition count 307
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 3 with 20 rules applied. Total rules applied 203 place count 95 transition count 287
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 205 place count 94 transition count 297
Applied a total of 205 rules in 73 ms. Remains 94 /189 variables (removed 95) and now considering 297/370 (removed 73) transitions.
[2024-06-02 21:27:15] [INFO ] Flow matrix only has 296 transitions (discarded 1 similar events)
// Phase 1: matrix 296 rows 94 cols
[2024-06-02 21:27:15] [INFO ] Computed 19 invariants in 2 ms
[2024-06-02 21:27:15] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-02 21:27:15] [INFO ] Flow matrix only has 296 transitions (discarded 1 similar events)
[2024-06-02 21:27:15] [INFO ] Invariant cache hit.
[2024-06-02 21:27:15] [INFO ] State equation strengthened by 103 read => feed constraints.
[2024-06-02 21:27:15] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
[2024-06-02 21:27:15] [INFO ] Redundant transitions in 68 ms returned []
[2024-06-02 21:27:15] [INFO ] Flow matrix only has 296 transitions (discarded 1 similar events)
[2024-06-02 21:27:15] [INFO ] Invariant cache hit.
[2024-06-02 21:27:15] [INFO ] Dead Transitions using invariants and state equation in 209 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 94/189 places, 297/370 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 625 ms. Remains : 94/189 places, 297/370 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-19-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s53 1) (EQ s76 1) (EQ s79 1) (EQ s92 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 9 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-19-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-19-LTLFireability-02 finished in 678 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||X(p1))))&&F(p0)))'
Support contains 5 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 370/370 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 185 transition count 366
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 185 transition count 366
Applied a total of 8 rules in 4 ms. Remains 185 /189 variables (removed 4) and now considering 366/370 (removed 4) transitions.
// Phase 1: matrix 366 rows 185 cols
[2024-06-02 21:27:15] [INFO ] Computed 22 invariants in 3 ms
[2024-06-02 21:27:15] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-02 21:27:15] [INFO ] Invariant cache hit.
[2024-06-02 21:27:16] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
[2024-06-02 21:27:16] [INFO ] Invariant cache hit.
[2024-06-02 21:27:16] [INFO ] Dead Transitions using invariants and state equation in 262 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 185/189 places, 366/370 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 610 ms. Remains : 185/189 places, 366/370 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-19-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s108 1), p1:(AND (EQ s62 1) (EQ s103 1) (EQ s158 1) (EQ s181 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 245 ms.
Stuttering criterion allowed to conclude after 47 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-19-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-19-LTLFireability-03 finished in 1013 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))'
Support contains 4 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 370/370 transitions.
Graph (complete) has 660 edges and 189 vertex of which 187 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 186 transition count 336
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 1 with 37 rules applied. Total rules applied 69 place count 155 transition count 330
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 72 place count 152 transition count 330
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 72 place count 152 transition count 318
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 96 place count 140 transition count 318
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 104 place count 132 transition count 307
Iterating global reduction 3 with 8 rules applied. Total rules applied 112 place count 132 transition count 307
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 112 place count 132 transition count 306
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 114 place count 131 transition count 306
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 172 place count 101 transition count 278
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 182 place count 96 transition count 307
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 3 with 20 rules applied. Total rules applied 202 place count 96 transition count 287
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 204 place count 95 transition count 297
Applied a total of 204 rules in 47 ms. Remains 95 /189 variables (removed 94) and now considering 297/370 (removed 73) transitions.
// Phase 1: matrix 297 rows 95 cols
[2024-06-02 21:27:16] [INFO ] Computed 20 invariants in 1 ms
[2024-06-02 21:27:17] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-02 21:27:17] [INFO ] Invariant cache hit.
[2024-06-02 21:27:17] [INFO ] State equation strengthened by 130 read => feed constraints.
[2024-06-02 21:27:17] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
[2024-06-02 21:27:17] [INFO ] Redundant transitions in 52 ms returned []
[2024-06-02 21:27:17] [INFO ] Invariant cache hit.
[2024-06-02 21:27:17] [INFO ] Dead Transitions using invariants and state equation in 207 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 95/189 places, 297/370 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 596 ms. Remains : 95/189 places, 297/370 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-19-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s28 1) (EQ s31 1) (EQ s80 1) (EQ s91 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 18 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-19-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-19-LTLFireability-04 finished in 646 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p0)&&F(G(p1)))) U (p2 U p3)))'
Support contains 5 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 370/370 transitions.
Graph (complete) has 660 edges and 189 vertex of which 187 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 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 186 transition count 339
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 1 with 34 rules applied. Total rules applied 63 place count 158 transition count 333
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 67 place count 155 transition count 332
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 68 place count 154 transition count 332
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 68 place count 154 transition count 320
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 92 place count 142 transition count 320
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 99 place count 135 transition count 310
Iterating global reduction 4 with 7 rules applied. Total rules applied 106 place count 135 transition count 310
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 106 place count 135 transition count 309
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 108 place count 134 transition count 309
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 4 with 65 rules applied. Total rules applied 173 place count 100 transition count 278
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 183 place count 95 transition count 307
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 4 with 20 rules applied. Total rules applied 203 place count 95 transition count 287
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 205 place count 94 transition count 297
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 206 place count 94 transition count 297
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 207 place count 93 transition count 296
Applied a total of 207 rules in 57 ms. Remains 93 /189 variables (removed 96) and now considering 296/370 (removed 74) transitions.
[2024-06-02 21:27:17] [INFO ] Flow matrix only has 295 transitions (discarded 1 similar events)
// Phase 1: matrix 295 rows 93 cols
[2024-06-02 21:27:17] [INFO ] Computed 19 invariants in 2 ms
[2024-06-02 21:27:17] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-02 21:27:17] [INFO ] Flow matrix only has 295 transitions (discarded 1 similar events)
[2024-06-02 21:27:17] [INFO ] Invariant cache hit.
[2024-06-02 21:27:17] [INFO ] State equation strengthened by 136 read => feed constraints.
[2024-06-02 21:27:17] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
[2024-06-02 21:27:17] [INFO ] Redundant transitions in 46 ms returned []
[2024-06-02 21:27:17] [INFO ] Flow matrix only has 295 transitions (discarded 1 similar events)
[2024-06-02 21:27:17] [INFO ] Invariant cache hit.
[2024-06-02 21:27:18] [INFO ] Dead Transitions using invariants and state equation in 212 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 93/189 places, 296/370 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 642 ms. Remains : 93/189 places, 296/370 transitions.
Stuttering acceptance computed with spot in 345 ms :[(NOT p3), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-19-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p3:(EQ s6 1), p2:(EQ s1 1), p0:(AND (EQ s62 1) (EQ s65 1)), p1:(EQ s80 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-19-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-19-LTLFireability-05 finished in 1007 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((G(F(p0)) U p1)))'
Support contains 6 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 370/370 transitions.
Graph (complete) has 660 edges and 189 vertex of which 187 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 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 186 transition count 338
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 157 transition count 334
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 155 transition count 334
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 65 place count 155 transition count 322
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 89 place count 143 transition count 322
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 97 place count 135 transition count 311
Iterating global reduction 3 with 8 rules applied. Total rules applied 105 place count 135 transition count 311
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 105 place count 135 transition count 310
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 107 place count 134 transition count 310
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 163 place count 105 transition count 283
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 173 place count 100 transition count 312
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 3 with 21 rules applied. Total rules applied 194 place count 100 transition count 291
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 1 rules applied. Total rules applied 195 place count 100 transition count 290
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 196 place count 99 transition count 290
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 198 place count 98 transition count 300
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 200 place count 98 transition count 300
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 201 place count 97 transition count 299
Iterating global reduction 5 with 1 rules applied. Total rules applied 202 place count 97 transition count 299
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 203 place count 96 transition count 298
Applied a total of 203 rules in 55 ms. Remains 96 /189 variables (removed 93) and now considering 298/370 (removed 72) transitions.
[2024-06-02 21:27:18] [INFO ] Flow matrix only has 297 transitions (discarded 1 similar events)
// Phase 1: matrix 297 rows 96 cols
[2024-06-02 21:27:18] [INFO ] Computed 20 invariants in 1 ms
[2024-06-02 21:27:18] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-02 21:27:18] [INFO ] Flow matrix only has 297 transitions (discarded 1 similar events)
[2024-06-02 21:27:18] [INFO ] Invariant cache hit.
[2024-06-02 21:27:18] [INFO ] State equation strengthened by 97 read => feed constraints.
[2024-06-02 21:27:18] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
[2024-06-02 21:27:18] [INFO ] Redundant transitions in 42 ms returned []
[2024-06-02 21:27:18] [INFO ] Flow matrix only has 297 transitions (discarded 1 similar events)
[2024-06-02 21:27:18] [INFO ] Invariant cache hit.
[2024-06-02 21:27:19] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 96/189 places, 298/370 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 599 ms. Remains : 96/189 places, 298/370 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-19-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 p1), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s3 1) (EQ s19 1) (EQ s57 1) (EQ s60 1)), p0:(AND (EQ s3 1) (EQ s7 1) (EQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-19-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-19-LTLFireability-06 finished in 758 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 4 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 370/370 transitions.
Graph (complete) has 660 edges and 189 vertex of which 187 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 186 transition count 336
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 1 with 37 rules applied. Total rules applied 69 place count 155 transition count 330
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 72 place count 152 transition count 330
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 72 place count 152 transition count 318
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 96 place count 140 transition count 318
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 104 place count 132 transition count 307
Iterating global reduction 3 with 8 rules applied. Total rules applied 112 place count 132 transition count 307
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 112 place count 132 transition count 306
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 114 place count 131 transition count 306
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 172 place count 101 transition count 278
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 182 place count 96 transition count 307
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 3 with 20 rules applied. Total rules applied 202 place count 96 transition count 287
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 204 place count 95 transition count 297
Applied a total of 204 rules in 34 ms. Remains 95 /189 variables (removed 94) and now considering 297/370 (removed 73) transitions.
// Phase 1: matrix 297 rows 95 cols
[2024-06-02 21:27:19] [INFO ] Computed 20 invariants in 1 ms
[2024-06-02 21:27:19] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-02 21:27:19] [INFO ] Invariant cache hit.
[2024-06-02 21:27:19] [INFO ] State equation strengthened by 130 read => feed constraints.
[2024-06-02 21:27:19] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
[2024-06-02 21:27:19] [INFO ] Redundant transitions in 40 ms returned []
[2024-06-02 21:27:19] [INFO ] Invariant cache hit.
[2024-06-02 21:27:19] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 95/189 places, 297/370 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 554 ms. Remains : 95/189 places, 297/370 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-19-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s28 0) (EQ s31 0) (EQ s80 0) (EQ s91 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 1 reset in 135 ms.
Product exploration explored 100000 steps with 1 reset in 159 ms.
Computed a total of 10 stabilizing places and 127 stable transitions
Computed a total of 10 stabilizing places and 127 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 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 34 ms :[(NOT p0)]
Finished random walk after 69 steps, including 4 resets, run visited all 1 properties in 2 ms. (steps per millisecond=34 )
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 91 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 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Support contains 4 out of 95 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 95/95 places, 297/297 transitions.
Applied a total of 0 rules in 6 ms. Remains 95 /95 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2024-06-02 21:27:20] [INFO ] Invariant cache hit.
[2024-06-02 21:27:20] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-02 21:27:20] [INFO ] Invariant cache hit.
[2024-06-02 21:27:20] [INFO ] State equation strengthened by 130 read => feed constraints.
[2024-06-02 21:27:20] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2024-06-02 21:27:20] [INFO ] Redundant transitions in 40 ms returned []
[2024-06-02 21:27:20] [INFO ] Invariant cache hit.
[2024-06-02 21:27:21] [INFO ] Dead Transitions using invariants and state equation in 163 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 553 ms. Remains : 95/95 places, 297/297 transitions.
Computed a total of 10 stabilizing places and 127 stable transitions
Computed a total of 10 stabilizing places and 127 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 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)]
Finished random walk after 21 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=21 )
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 99 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 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2 reset in 140 ms.
Product exploration explored 100000 steps with 0 reset in 212 ms.
Built C files in :
/tmp/ltsmin14408095762518430043
[2024-06-02 21:27:21] [INFO ] Computing symmetric may disable matrix : 297 transitions.
[2024-06-02 21:27:21] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:27:21] [INFO ] Computing symmetric may enable matrix : 297 transitions.
[2024-06-02 21:27:21] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:27:21] [INFO ] Computing Do-Not-Accords matrix : 297 transitions.
[2024-06-02 21:27:21] [INFO ] Computation of Completed DNA matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:27:21] [INFO ] Built C files in 77ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14408095762518430043
Running compilation step : cd /tmp/ltsmin14408095762518430043;'/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 1103 ms.
Running link step : cd /tmp/ltsmin14408095762518430043;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin14408095762518430043;'/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/stateBased17531630992518805230.hoa' '--buchi-type=spotba'
LTSmin run took 670 ms.
FORMULA MedleyA-PT-19-LTLFireability-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-19-LTLFireability-07 finished in 4373 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((p0||F(p1)))&&G(p2))))'
Support contains 7 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 370/370 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 184 transition count 365
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 184 transition count 365
Applied a total of 10 rules in 4 ms. Remains 184 /189 variables (removed 5) and now considering 365/370 (removed 5) transitions.
// Phase 1: matrix 365 rows 184 cols
[2024-06-02 21:27:23] [INFO ] Computed 22 invariants in 2 ms
[2024-06-02 21:27:23] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-02 21:27:23] [INFO ] Invariant cache hit.
[2024-06-02 21:27:24] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2024-06-02 21:27:24] [INFO ] Invariant cache hit.
[2024-06-02 21:27:24] [INFO ] Dead Transitions using invariants and state equation in 217 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 184/189 places, 365/370 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 539 ms. Remains : 184/189 places, 365/370 transitions.
Stuttering acceptance computed with spot in 214 ms :[(NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), true]
Running random walk in product with property : MedleyA-PT-19-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 5}], [{ cond=(OR (AND p2 p0) (AND p2 p1)), acceptance={} source=1 dest: 0}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 5}], [{ cond=(AND p2 p1), acceptance={0} source=2 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 5}], [{ cond=p2, acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p2:(OR (AND (EQ s8 1) (EQ s14 1)) (EQ s113 0) (EQ s154 0) (EQ s157 0) (EQ s175 0)), p0:(AND (EQ s113 1) (EQ s154 1) (EQ s157 1) (EQ s175 1)), p1:(EQ s169 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 4 reset in 173 ms.
Product exploration explored 100000 steps with 14 reset in 135 ms.
Computed a total of 19 stabilizing places and 19 stable transitions
Graph (complete) has 647 edges and 184 vertex of which 182 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Computed a total of 19 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), true, (X (X p2)), (X (X (NOT (OR (AND p2 p0) (AND p2 p1))))), (X (X (AND p2 (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 96 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(NOT p2), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 12 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:27:25] [INFO ] Invariant cache hit.
[2024-06-02 21:27:25] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 21:27:25] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-06-02 21:27:25] [INFO ] [Nat]Absence check using 6 positive and 16 generalized place invariants in 8 ms returned sat
[2024-06-02 21:27:25] [INFO ] After 154ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 21:27:25] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-06-02 21:27:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2024-06-02 21:27:25] [INFO ] After 274ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2024-06-02 21:27:25] [INFO ] After 364ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 365/365 transitions.
Graph (complete) has 647 edges and 184 vertex of which 182 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 182 transition count 331
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 1 with 37 rules applied. Total rules applied 70 place count 151 transition count 325
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 73 place count 148 transition count 325
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 73 place count 148 transition count 314
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 95 place count 137 transition count 314
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 98 place count 134 transition count 308
Iterating global reduction 3 with 3 rules applied. Total rules applied 101 place count 134 transition count 308
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 163 place count 102 transition count 278
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 164 place count 102 transition count 277
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 174 place count 97 transition count 306
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 4 with 20 rules applied. Total rules applied 194 place count 97 transition count 286
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 196 place count 96 transition count 296
Free-agglomeration rule applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 202 place count 96 transition count 290
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 208 place count 90 transition count 290
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 5 with 18 rules applied. Total rules applied 226 place count 90 transition count 494
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 5 with 72 rules applied. Total rules applied 298 place count 72 transition count 440
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 300 place count 72 transition count 440
Applied a total of 300 rules in 62 ms. Remains 72 /184 variables (removed 112) and now considering 440/365 (removed -75) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 72/184 places, 440/365 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 444364 steps, run visited all 1 properties in 1232 ms. (steps per millisecond=360 )
Probabilistic random walk after 444364 steps, saw 70095 distinct states, run finished after 1232 ms. (steps per millisecond=360 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), true, (X (X p2)), (X (X (NOT (OR (AND p2 p0) (AND p2 p1))))), (X (X (AND p2 (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT (AND p2 (NOT p1)))), (F (AND p2 p1))]
Property proved to be false thanks to negative knowledge :(F (NOT p2))
Knowledge based reduction with 6 factoid took 123 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-19-LTLFireability-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-19-LTLFireability-08 finished in 3297 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(F(p0))||(F(p0)&&F(p1)))))'
Support contains 7 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 370/370 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 184 transition count 365
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 184 transition count 365
Applied a total of 10 rules in 8 ms. Remains 184 /189 variables (removed 5) and now considering 365/370 (removed 5) transitions.
[2024-06-02 21:27:27] [INFO ] Invariant cache hit.
[2024-06-02 21:27:27] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-02 21:27:27] [INFO ] Invariant cache hit.
[2024-06-02 21:27:27] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2024-06-02 21:27:27] [INFO ] Invariant cache hit.
[2024-06-02 21:27:27] [INFO ] Dead Transitions using invariants and state equation in 268 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 184/189 places, 365/370 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 589 ms. Remains : 184/189 places, 365/370 transitions.
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-19-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s62 1) (EQ s103 1) (EQ s157 1) (EQ s173 1)), p1:(AND (EQ s62 1) (EQ s89 1) (EQ s113 1) (EQ s154 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]]
Stuttering criterion allowed to conclude after 47 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-19-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-19-LTLFireability-09 finished in 788 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&G(p1)))))'
Support contains 2 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 370/370 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 185 transition count 366
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 185 transition count 366
Applied a total of 8 rules in 5 ms. Remains 185 /189 variables (removed 4) and now considering 366/370 (removed 4) transitions.
// Phase 1: matrix 366 rows 185 cols
[2024-06-02 21:27:27] [INFO ] Computed 22 invariants in 5 ms
[2024-06-02 21:27:27] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-02 21:27:27] [INFO ] Invariant cache hit.
[2024-06-02 21:27:28] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
[2024-06-02 21:27:28] [INFO ] Invariant cache hit.
[2024-06-02 21:27:28] [INFO ] Dead Transitions using invariants and state equation in 220 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 185/189 places, 366/370 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 579 ms. Remains : 185/189 places, 366/370 transitions.
Stuttering acceptance computed with spot in 241 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-19-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(EQ s109 1), p0:(EQ s163 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-19-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-19-LTLFireability-11 finished in 836 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 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 370/370 transitions.
Graph (complete) has 660 edges and 189 vertex of which 187 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 186 transition count 336
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 1 with 37 rules applied. Total rules applied 69 place count 155 transition count 330
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 72 place count 152 transition count 330
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 72 place count 152 transition count 318
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 96 place count 140 transition count 318
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 104 place count 132 transition count 307
Iterating global reduction 3 with 8 rules applied. Total rules applied 112 place count 132 transition count 307
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 112 place count 132 transition count 306
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 114 place count 131 transition count 306
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 67 rules applied. Total rules applied 181 place count 96 transition count 274
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 191 place count 91 transition count 303
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 3 with 20 rules applied. Total rules applied 211 place count 91 transition count 283
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 213 place count 90 transition count 293
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 214 place count 89 transition count 292
Applied a total of 214 rules in 42 ms. Remains 89 /189 variables (removed 100) and now considering 292/370 (removed 78) transitions.
[2024-06-02 21:27:28] [INFO ] Flow matrix only has 291 transitions (discarded 1 similar events)
// Phase 1: matrix 291 rows 89 cols
[2024-06-02 21:27:28] [INFO ] Computed 19 invariants in 1 ms
[2024-06-02 21:27:28] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-02 21:27:28] [INFO ] Flow matrix only has 291 transitions (discarded 1 similar events)
[2024-06-02 21:27:28] [INFO ] Invariant cache hit.
[2024-06-02 21:27:28] [INFO ] State equation strengthened by 136 read => feed constraints.
[2024-06-02 21:27:28] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
[2024-06-02 21:27:29] [INFO ] Redundant transitions in 42 ms returned []
[2024-06-02 21:27:29] [INFO ] Flow matrix only has 291 transitions (discarded 1 similar events)
[2024-06-02 21:27:29] [INFO ] Invariant cache hit.
[2024-06-02 21:27:29] [INFO ] Dead Transitions using invariants and state equation in 164 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/189 places, 292/370 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 577 ms. Remains : 89/189 places, 292/370 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-19-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s48 1)], 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 1 reset in 56 ms.
Product exploration explored 100000 steps with 1 reset in 178 ms.
Computed a total of 11 stabilizing places and 144 stable transitions
Computed a total of 11 stabilizing places and 144 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 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 36 ms :[(NOT p0)]
Finished random walk after 440 steps, including 48 resets, run visited all 1 properties in 6 ms. (steps per millisecond=73 )
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 92 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 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Support contains 1 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 292/292 transitions.
Applied a total of 0 rules in 5 ms. Remains 89 /89 variables (removed 0) and now considering 292/292 (removed 0) transitions.
[2024-06-02 21:27:29] [INFO ] Flow matrix only has 291 transitions (discarded 1 similar events)
[2024-06-02 21:27:29] [INFO ] Invariant cache hit.
[2024-06-02 21:27:29] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-02 21:27:29] [INFO ] Flow matrix only has 291 transitions (discarded 1 similar events)
[2024-06-02 21:27:29] [INFO ] Invariant cache hit.
[2024-06-02 21:27:29] [INFO ] State equation strengthened by 136 read => feed constraints.
[2024-06-02 21:27:30] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
[2024-06-02 21:27:30] [INFO ] Redundant transitions in 39 ms returned []
[2024-06-02 21:27:30] [INFO ] Flow matrix only has 291 transitions (discarded 1 similar events)
[2024-06-02 21:27:30] [INFO ] Invariant cache hit.
[2024-06-02 21:27:30] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 504 ms. Remains : 89/89 places, 292/292 transitions.
Computed a total of 11 stabilizing places and 144 stable transitions
Computed a total of 11 stabilizing places and 144 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 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 296 steps, including 31 resets, run visited all 1 properties in 3 ms. (steps per millisecond=98 )
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 94 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 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1 reset in 68 ms.
Product exploration explored 100000 steps with 1 reset in 71 ms.
Built C files in :
/tmp/ltsmin17252043853859904394
[2024-06-02 21:27:30] [INFO ] Computing symmetric may disable matrix : 292 transitions.
[2024-06-02 21:27:30] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:27:30] [INFO ] Computing symmetric may enable matrix : 292 transitions.
[2024-06-02 21:27:30] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:27:30] [INFO ] Computing Do-Not-Accords matrix : 292 transitions.
[2024-06-02 21:27:30] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:27:30] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17252043853859904394
Running compilation step : cd /tmp/ltsmin17252043853859904394;'/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 904 ms.
Running link step : cd /tmp/ltsmin17252043853859904394;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin17252043853859904394;'/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/stateBased1295440695765816363.hoa' '--buchi-type=spotba'
LTSmin run took 555 ms.
FORMULA MedleyA-PT-19-LTLFireability-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-19-LTLFireability-15 finished in 3681 ms.
All properties solved by simple procedures.
Total runtime 32304 ms.

BK_STOP 1717363653420

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

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