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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 6.6K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K 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 90K 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-08-LTLFireability-00
FORMULA_NAME MedleyA-PT-08-LTLFireability-01
FORMULA_NAME MedleyA-PT-08-LTLFireability-02
FORMULA_NAME MedleyA-PT-08-LTLFireability-03
FORMULA_NAME MedleyA-PT-08-LTLFireability-04
FORMULA_NAME MedleyA-PT-08-LTLFireability-05
FORMULA_NAME MedleyA-PT-08-LTLFireability-06
FORMULA_NAME MedleyA-PT-08-LTLFireability-07
FORMULA_NAME MedleyA-PT-08-LTLFireability-08
FORMULA_NAME MedleyA-PT-08-LTLFireability-09
FORMULA_NAME MedleyA-PT-08-LTLFireability-10
FORMULA_NAME MedleyA-PT-08-LTLFireability-11
FORMULA_NAME MedleyA-PT-08-LTLFireability-12
FORMULA_NAME MedleyA-PT-08-LTLFireability-13
FORMULA_NAME MedleyA-PT-08-LTLFireability-14
FORMULA_NAME MedleyA-PT-08-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717361954644

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-08
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-06-02 20:59:17] [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 20:59:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:59:17] [INFO ] Load time of PNML (sax parser for PT used): 146 ms
[2024-06-02 20:59:17] [INFO ] Transformed 147 places.
[2024-06-02 20:59:17] [INFO ] Transformed 312 transitions.
[2024-06-02 20:59:17] [INFO ] Found NUPN structural information;
[2024-06-02 20:59:17] [INFO ] Parsed PT model containing 147 places and 312 transitions and 1378 arcs in 294 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.
FORMULA MedleyA-PT-08-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 312/312 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 145 transition count 312
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 38 place count 109 transition count 268
Iterating global reduction 1 with 36 rules applied. Total rules applied 74 place count 109 transition count 268
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 77 place count 109 transition count 265
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 80 place count 106 transition count 262
Iterating global reduction 2 with 3 rules applied. Total rules applied 83 place count 106 transition count 262
Applied a total of 83 rules in 46 ms. Remains 106 /147 variables (removed 41) and now considering 262/312 (removed 50) transitions.
// Phase 1: matrix 262 rows 106 cols
[2024-06-02 20:59:18] [INFO ] Computed 10 invariants in 15 ms
[2024-06-02 20:59:18] [INFO ] Implicit Places using invariants in 278 ms returned []
[2024-06-02 20:59:18] [INFO ] Invariant cache hit.
[2024-06-02 20:59:18] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
[2024-06-02 20:59:18] [INFO ] Invariant cache hit.
[2024-06-02 20:59:19] [INFO ] Dead Transitions using invariants and state equation in 282 ms found 48 transitions.
Found 48 dead transitions using SMT.
Drop transitions removed 48 transitions
Dead transitions reduction (with SMT) removed 48 transitions
Starting structural reductions in LTL mode, iteration 1 : 106/147 places, 214/312 transitions.
Applied a total of 0 rules in 5 ms. Remains 106 /106 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 855 ms. Remains : 106/147 places, 214/312 transitions.
Support contains 40 out of 106 places after structural reductions.
[2024-06-02 20:59:19] [INFO ] Flatten gal took : 67 ms
[2024-06-02 20:59:19] [INFO ] Flatten gal took : 33 ms
[2024-06-02 20:59:19] [INFO ] Input system was already deterministic with 214 transitions.
Support contains 39 out of 106 places (down from 40) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 489 resets, run finished after 668 ms. (steps per millisecond=14 ) properties (out of 33) seen :8
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 13 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 13 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 16 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 13 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 15 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 14 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 14 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 17 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 15 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 13 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 14 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Running SMT prover for 25 properties.
// Phase 1: matrix 214 rows 106 cols
[2024-06-02 20:59:20] [INFO ] Computed 10 invariants in 8 ms
[2024-06-02 20:59:20] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-06-02 20:59:20] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 7 ms returned sat
[2024-06-02 20:59:21] [INFO ] After 618ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:22
[2024-06-02 20:59:21] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-06-02 20:59:21] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 3 ms returned sat
[2024-06-02 20:59:22] [INFO ] After 521ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :21
[2024-06-02 20:59:22] [INFO ] After 1111ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :21
Attempting to minimize the solution found.
Minimization took 437 ms.
[2024-06-02 20:59:23] [INFO ] After 1797ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :21
Fused 25 Parikh solutions to 21 different solutions.
Parikh walk visited 8 properties in 170 ms.
Support contains 19 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 214/214 transitions.
Graph (complete) has 390 edges and 106 vertex of which 101 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 101 transition count 192
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 29 place count 92 transition count 192
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 29 place count 92 transition count 190
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 33 place count 90 transition count 190
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 37 place count 86 transition count 183
Iterating global reduction 2 with 4 rules applied. Total rules applied 41 place count 86 transition count 183
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 17 rules applied. Total rules applied 58 place count 77 transition count 175
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 76 transition count 174
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 76 transition count 174
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -64
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 74 place count 69 transition count 238
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 90 place count 69 transition count 222
Drop transitions removed 43 transitions
Redundant transition composition rules discarded 43 transitions
Iterating global reduction 3 with 43 rules applied. Total rules applied 133 place count 69 transition count 179
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 133 place count 69 transition count 175
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 141 place count 65 transition count 175
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 144 place count 65 transition count 172
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 147 place count 62 transition count 172
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 150 place count 62 transition count 172
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 151 place count 62 transition count 171
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 152 place count 61 transition count 170
Applied a total of 152 rules in 99 ms. Remains 61 /106 variables (removed 45) and now considering 170/214 (removed 44) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 61/106 places, 170/214 transitions.
Incomplete random walk after 10000 steps, including 88 resets, run finished after 406 ms. (steps per millisecond=24 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 58 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 62 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 13) seen :6
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 52 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 170 rows 61 cols
[2024-06-02 20:59:24] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 20:59:24] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 20:59:24] [INFO ] [Real]Absence check using 7 positive and 3 generalized place invariants in 5 ms returned sat
[2024-06-02 20:59:24] [INFO ] After 253ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-06-02 20:59:24] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 20:59:24] [INFO ] [Nat]Absence check using 7 positive and 3 generalized place invariants in 2 ms returned sat
[2024-06-02 20:59:25] [INFO ] After 165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-06-02 20:59:25] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-02 20:59:25] [INFO ] After 99ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2024-06-02 20:59:25] [INFO ] After 275ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 94 ms.
[2024-06-02 20:59:25] [INFO ] After 621ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 1 properties in 11 ms.
Support contains 12 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 170/170 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 61 transition count 169
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 60 transition count 169
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 4 place count 58 transition count 160
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 58 transition count 160
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 57 transition count 159
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 55 transition count 177
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 55 transition count 176
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 54 transition count 176
Applied a total of 14 rules in 34 ms. Remains 54 /61 variables (removed 7) and now considering 176/170 (removed -6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 54/61 places, 176/170 transitions.
Incomplete random walk after 10000 steps, including 39 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 73 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 113 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 163 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 108 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 176 rows 54 cols
[2024-06-02 20:59:26] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 20:59:26] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 20:59:26] [INFO ] [Real]Absence check using 7 positive and 3 generalized place invariants in 1 ms returned sat
[2024-06-02 20:59:26] [INFO ] After 193ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-06-02 20:59:26] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 20:59:26] [INFO ] [Nat]Absence check using 7 positive and 3 generalized place invariants in 2 ms returned sat
[2024-06-02 20:59:26] [INFO ] After 136ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-06-02 20:59:26] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-06-02 20:59:26] [INFO ] After 87ms SMT Verify possible using 26 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-06-02 20:59:26] [INFO ] After 190ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 73 ms.
[2024-06-02 20:59:26] [INFO ] After 481ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 1 properties in 35 ms.
Support contains 10 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 176/176 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 53 transition count 175
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 52 transition count 177
Applied a total of 4 rules in 15 ms. Remains 52 /54 variables (removed 2) and now considering 177/176 (removed -1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 52/54 places, 177/176 transitions.
Incomplete random walk after 10000 steps, including 44 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 168 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Finished probabilistic random walk after 113175 steps, run visited all 4 properties in 281 ms. (steps per millisecond=402 )
Probabilistic random walk after 113175 steps, saw 27457 distinct states, run finished after 281 ms. (steps per millisecond=402 ) properties seen :4
Parikh walk visited 0 properties in 0 ms.
FORMULA MedleyA-PT-08-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
FORMULA MedleyA-PT-08-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 8 stabilizing places and 8 stable transitions
Graph (complete) has 390 edges and 106 vertex of which 101 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
FORMULA MedleyA-PT-08-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(F(p1)))))'
Support contains 5 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 214/214 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 96 transition count 193
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 96 transition count 193
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 96 transition count 192
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 26 place count 91 transition count 178
Iterating global reduction 1 with 5 rules applied. Total rules applied 31 place count 91 transition count 178
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 89 transition count 173
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 89 transition count 173
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 88 transition count 170
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 88 transition count 170
Applied a total of 37 rules in 15 ms. Remains 88 /106 variables (removed 18) and now considering 170/214 (removed 44) transitions.
// Phase 1: matrix 170 rows 88 cols
[2024-06-02 20:59:28] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 20:59:28] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-02 20:59:28] [INFO ] Invariant cache hit.
[2024-06-02 20:59:28] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2024-06-02 20:59:28] [INFO ] Invariant cache hit.
[2024-06-02 20:59:28] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 88/106 places, 170/214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 343 ms. Remains : 88/106 places, 170/214 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 452 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-08-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(OR (NEQ s9 1) (NEQ s18 1) (NEQ s42 1) (NEQ s66 1)), p0:(EQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 353 ms.
Product exploration explored 100000 steps with 33333 reset in 264 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Graph (complete) has 314 edges and 88 vertex of which 83 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Computed a total of 8 stabilizing places and 8 stable transitions
Detected a total of 8/88 stabilizing places and 8/170 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 35 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-08-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-08-LTLFireability-00 finished in 1541 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(((!p0&&X(F(!p1)))||G(F(!p1)))))||(X((p1||X(p2)))&&F(((!p0&&X(F(!p1)))||G(F(!p1))))))))'
Support contains 9 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 214/214 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 97 transition count 197
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 97 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 97 transition count 196
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 94 transition count 190
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 94 transition count 190
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 93 transition count 187
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 93 transition count 187
Applied a total of 27 rules in 11 ms. Remains 93 /106 variables (removed 13) and now considering 187/214 (removed 27) transitions.
// Phase 1: matrix 187 rows 93 cols
[2024-06-02 20:59:29] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 20:59:29] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-02 20:59:29] [INFO ] Invariant cache hit.
[2024-06-02 20:59:29] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
[2024-06-02 20:59:29] [INFO ] Invariant cache hit.
[2024-06-02 20:59:29] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 93/106 places, 187/214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 404 ms. Remains : 93/106 places, 187/214 transitions.
Stuttering acceptance computed with spot in 333 ms :[p1, p1, false, p1, (AND p1 (NOT p2)), false, (AND p1 (NOT p2))]
Running random walk in product with property : MedleyA-PT-08-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(OR p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(NOT p1), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 6}], [{ cond=(OR p1 (NOT p0)), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(OR (AND p1 (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={} source=6 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 3}]], initial=0, aps=[p1:(AND (EQ s45 1) (EQ s50 1) (EQ s63 1)), p0:(AND (EQ s9 1) (EQ s23 1) (EQ s30 1)), p2:(AND (EQ s9 1) (EQ s21 1) (EQ s43 1) (EQ s48 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33316 reset in 171 ms.
Product exploration explored 100000 steps with 33268 reset in 196 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Graph (complete) has 339 edges and 93 vertex of which 88 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (OR p1 (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (OR p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (OR (AND p1 (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 216 ms. Reduced automaton from 7 states, 15 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 329 ms :[false, p1, false, p1, (AND p1 (NOT p2)), false, (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 496 resets, run finished after 403 ms. (steps per millisecond=24 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 144 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 140 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 136 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 140 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 138 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-06-02 20:59:32] [INFO ] Invariant cache hit.
[2024-06-02 20:59:32] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-02 20:59:32] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 3 ms returned sat
[2024-06-02 20:59:32] [INFO ] After 210ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-06-02 20:59:32] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-02 20:59:32] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 3 ms returned sat
[2024-06-02 20:59:32] [INFO ] After 176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-06-02 20:59:32] [INFO ] After 325ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 122 ms.
[2024-06-02 20:59:32] [INFO ] After 525ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Finished Parikh walk after 147 steps, including 2 resets, run visited all 5 properties in 4 ms. (steps per millisecond=36 )
Parikh walk visited 5 properties in 43 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (OR p1 (NOT p0))), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (OR p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (OR (AND p1 (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (AND p1 (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F p1), (F p0), (F (NOT (OR (NOT p0) p1))), (F (AND p0 (NOT p2))), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))))]
Knowledge based reduction with 15 factoid took 684 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 415 ms :[false, p1, false, p1, (AND p1 (NOT p2)), false, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 311 ms :[false, p1, false, p1, (AND p1 (NOT p2)), false, (AND p1 (NOT p2))]
Support contains 9 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 187/187 transitions.
Applied a total of 0 rules in 1 ms. Remains 93 /93 variables (removed 0) and now considering 187/187 (removed 0) transitions.
[2024-06-02 20:59:34] [INFO ] Invariant cache hit.
[2024-06-02 20:59:34] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-02 20:59:34] [INFO ] Invariant cache hit.
[2024-06-02 20:59:34] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
[2024-06-02 20:59:34] [INFO ] Invariant cache hit.
[2024-06-02 20:59:34] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 399 ms. Remains : 93/93 places, 187/187 transitions.
Computed a total of 8 stabilizing places and 8 stable transitions
Graph (complete) has 339 edges and 93 vertex of which 88 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 124 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 323 ms :[false, p1, false, p1, (AND p1 (NOT p2)), false, (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 499 resets, run finished after 330 ms. (steps per millisecond=30 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 138 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 139 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 132 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 132 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 142 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 133 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 138 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 143 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 143 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 638475 steps, run timeout after 3001 ms. (steps per millisecond=212 ) properties seen :{0=1, 3=1, 4=1, 5=1}
Probabilistic random walk after 638475 steps, saw 112719 distinct states, run finished after 3004 ms. (steps per millisecond=212 ) properties seen :4
Running SMT prover for 5 properties.
[2024-06-02 20:59:39] [INFO ] Invariant cache hit.
[2024-06-02 20:59:39] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-06-02 20:59:39] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 3 ms returned sat
[2024-06-02 20:59:39] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-06-02 20:59:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-02 20:59:39] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 3 ms returned sat
[2024-06-02 20:59:39] [INFO ] After 159ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-06-02 20:59:40] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-06-02 20:59:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2024-06-02 20:59:40] [INFO ] After 359ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 106 ms.
[2024-06-02 20:59:40] [INFO ] After 551ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 40 ms.
Support contains 9 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 187/187 transitions.
Graph (complete) has 339 edges and 93 vertex of which 88 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 88 transition count 164
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 32 place count 78 transition count 163
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 32 place count 78 transition count 161
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 36 place count 76 transition count 161
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 23 rules applied. Total rules applied 59 place count 64 transition count 150
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 64 transition count 149
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 61 place count 63 transition count 148
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 63 transition count 148
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -39
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 72 place count 58 transition count 187
Drop transitions removed 49 transitions
Redundant transition composition rules discarded 49 transitions
Iterating global reduction 3 with 49 rules applied. Total rules applied 121 place count 58 transition count 138
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 121 place count 58 transition count 136
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 125 place count 56 transition count 136
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 129 place count 54 transition count 155
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 133 place count 54 transition count 151
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 137 place count 50 transition count 151
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 139 place count 50 transition count 198
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 141 place count 48 transition count 198
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 144 place count 48 transition count 198
Applied a total of 144 rules in 52 ms. Remains 48 /93 variables (removed 45) and now considering 198/187 (removed -11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 48/93 places, 198/187 transitions.
Incomplete random walk after 10000 steps, including 31 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 118 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 5) seen :0
Finished probabilistic random walk after 10963 steps, run visited all 5 properties in 88 ms. (steps per millisecond=124 )
Probabilistic random walk after 10963 steps, saw 3165 distinct states, run finished after 88 ms. (steps per millisecond=124 ) properties seen :5
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p2) p0)), (F (NOT (AND (NOT p1) (NOT p2)))), (F p1), (F p0), (F (NOT (OR p1 (NOT p0)))), (F (AND (NOT p2) p0)), (F (NOT (OR (AND p1 (NOT p2)) (AND (NOT p2) (NOT p0)))))]
Knowledge based reduction with 4 factoid took 371 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 292 ms :[false, p1, false, p1, (AND p1 (NOT p2)), false, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 278 ms :[false, p1, false, p1, (AND p1 (NOT p2)), false, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 283 ms :[false, p1, false, p1, (AND p1 (NOT p2)), false, (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 20016 reset in 184 ms.
Product exploration explored 100000 steps with 19991 reset in 242 ms.
Applying partial POR strategy [false, true, false, false, true, false, false]
Stuttering acceptance computed with spot in 281 ms :[false, p1, false, p1, (AND p1 (NOT p2)), false, (AND p1 (NOT p2))]
Support contains 9 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 187/187 transitions.
Graph (complete) has 339 edges and 93 vertex of which 88 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 88 transition count 184
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 11 place count 88 transition count 183
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 11 place count 88 transition count 185
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 88 transition count 185
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 16 place count 85 transition count 182
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 19 place count 85 transition count 182
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 30 place count 85 transition count 184
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 32 place count 85 transition count 182
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 36 place count 81 transition count 177
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 40 place count 81 transition count 177
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -54
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 3 with 6 rules applied. Total rules applied 46 place count 81 transition count 231
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 47 place count 80 transition count 229
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 48 place count 80 transition count 229
Deduced a syphon composed of 21 places in 0 ms
Drop transitions removed 49 transitions
Redundant transition composition rules discarded 49 transitions
Iterating global reduction 3 with 49 rules applied. Total rules applied 97 place count 80 transition count 180
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 97 place count 80 transition count 181
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 99 place count 80 transition count 181
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 100 place count 80 transition count 191
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 101 place count 79 transition count 189
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 102 place count 79 transition count 189
Deduced a syphon composed of 23 places in 0 ms
Applied a total of 102 rules in 41 ms. Remains 79 /93 variables (removed 14) and now considering 189/187 (removed -2) transitions.
[2024-06-02 20:59:43] [INFO ] Redundant transitions in 25 ms returned [162]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 188 rows 79 cols
[2024-06-02 20:59:43] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 20:59:43] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 79/93 places, 188/187 transitions.
Deduced a syphon composed of 23 places in 0 ms
Applied a total of 0 rules in 7 ms. Remains 79 /79 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 234 ms. Remains : 79/93 places, 188/187 transitions.
Built C files in :
/tmp/ltsmin10236788043608326816
[2024-06-02 20:59:43] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10236788043608326816
Running compilation step : cd /tmp/ltsmin10236788043608326816;'/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 652 ms.
Running link step : cd /tmp/ltsmin10236788043608326816;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin10236788043608326816;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4919420229912433009.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 9 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 187/187 transitions.
Applied a total of 0 rules in 2 ms. Remains 93 /93 variables (removed 0) and now considering 187/187 (removed 0) transitions.
// Phase 1: matrix 187 rows 93 cols
[2024-06-02 20:59:58] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 20:59:58] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-02 20:59:58] [INFO ] Invariant cache hit.
[2024-06-02 20:59:58] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2024-06-02 20:59:58] [INFO ] Invariant cache hit.
[2024-06-02 20:59:58] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 361 ms. Remains : 93/93 places, 187/187 transitions.
Built C files in :
/tmp/ltsmin4015513409985637047
[2024-06-02 20:59:58] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4015513409985637047
Running compilation step : cd /tmp/ltsmin4015513409985637047;'/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 469 ms.
Running link step : cd /tmp/ltsmin4015513409985637047;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin4015513409985637047;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9325988244107847626.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-06-02 21:00:13] [INFO ] Flatten gal took : 21 ms
[2024-06-02 21:00:14] [INFO ] Flatten gal took : 20 ms
[2024-06-02 21:00:14] [INFO ] Time to serialize gal into /tmp/LTL18311986827705930797.gal : 7 ms
[2024-06-02 21:00:14] [INFO ] Time to serialize properties into /tmp/LTL4082653833591031152.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18311986827705930797.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17941742982343962415.hoa' '-atoms' '/tmp/LTL4082653833591031152.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL4082653833591031152.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17941742982343962415.hoa
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t8, t9, t11, t12, t14, t15, t16, t18, t19, t24, t25, t26, t27, t32, t33, t35, t38, t3...538
Computing Next relation with stutter on 1196 deadlock states
Detected timeout of ITS tools.
[2024-06-02 21:00:29] [INFO ] Flatten gal took : 16 ms
[2024-06-02 21:00:29] [INFO ] Flatten gal took : 16 ms
[2024-06-02 21:00:29] [INFO ] Time to serialize gal into /tmp/LTL641760851880165856.gal : 5 ms
[2024-06-02 21:00:29] [INFO ] Time to serialize properties into /tmp/LTL11162611697986788492.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL641760851880165856.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11162611697986788492.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F((G(F((G(F("(((p83!=1)||(p89!=1))||(p103!=1))")))||(("(((p22!=1)||(p37!=1))||(p47!=1))")&&(X(F("(((p83!=1)||(p89!=1))||(p103!=1))"...399
Formula 0 simplified : G(FG!"(((p83!=1)||(p89!=1))||(p103!=1))" & (G(FG!"(((p83!=1)||(p89!=1))||(p103!=1))" & (!"(((p22!=1)||(p37!=1))||(p47!=1))" | XG!"((...284
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t8, t9, t11, t12, t14, t15, t16, t18, t19, t24, t25, t26, t27, t32, t33, t35, t38, t3...538
Computing Next relation with stutter on 1196 deadlock states
Detected timeout of ITS tools.
[2024-06-02 21:00:44] [INFO ] Flatten gal took : 17 ms
[2024-06-02 21:00:44] [INFO ] Applying decomposition
[2024-06-02 21:00:44] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph14733237212370657217.txt' '-o' '/tmp/graph14733237212370657217.bin' '-w' '/tmp/graph14733237212370657217.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14733237212370657217.bin' '-l' '-1' '-v' '-w' '/tmp/graph14733237212370657217.weights' '-q' '0' '-e' '0.001'
[2024-06-02 21:00:44] [INFO ] Decomposing Gal with order
[2024-06-02 21:00:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 21:00:44] [INFO ] Removed a total of 294 redundant transitions.
[2024-06-02 21:00:44] [INFO ] Flatten gal took : 83 ms
[2024-06-02 21:00:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 31 labels/synchronizations in 13 ms.
[2024-06-02 21:00:44] [INFO ] Time to serialize gal into /tmp/LTL7078273435571862521.gal : 5 ms
[2024-06-02 21:00:44] [INFO ] Time to serialize properties into /tmp/LTL5552924460043104991.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7078273435571862521.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5552924460043104991.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F((G(F((G(F("(((u13.p83!=1)||(i6.u15.p89!=1))||(u13.p103!=1))")))||(("(((i3.u3.p22!=1)||(i2.u6.p37!=1))||(i3.u10.p47!=1))")&&(X(F("...538
Formula 0 simplified : G(FG!"(((u13.p83!=1)||(i6.u15.p89!=1))||(u13.p103!=1))" & (G(FG!"(((u13.p83!=1)||(i6.u15.p89!=1))||(u13.p103!=1))" & (!"(((i3.u3.p22...389
Reverse transition relation is NOT exact ! Due to transitions t26, t67, t103, t110, t183, t185, t200, t201, t202, t203, u13.t25, u13.t27, u13.t32, u13.t33,...717
Computing Next relation with stutter on 1196 deadlock states
158 unique states visited
0 strongly connected components in search stack
210 transitions explored
46 items max in DFS search stack
388 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.91597,123196,1,0,187210,22724,2083,367385,724,189652,315900
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA MedleyA-PT-08-LTLFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property MedleyA-PT-08-LTLFireability-01 finished in 79643 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F(((p2||G((p3 U p4)))&&p1))))'
Support contains 8 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 214/214 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 98 transition count 198
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 98 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 98 transition count 197
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 21 place count 94 transition count 186
Iterating global reduction 1 with 4 rules applied. Total rules applied 25 place count 94 transition count 186
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 92 transition count 181
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 92 transition count 181
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 91 transition count 178
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 91 transition count 178
Applied a total of 31 rules in 5 ms. Remains 91 /106 variables (removed 15) and now considering 178/214 (removed 36) transitions.
// Phase 1: matrix 178 rows 91 cols
[2024-06-02 21:00:49] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 21:00:49] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-02 21:00:49] [INFO ] Invariant cache hit.
[2024-06-02 21:00:49] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2024-06-02 21:00:49] [INFO ] Invariant cache hit.
[2024-06-02 21:00:49] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 91/106 places, 178/214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 340 ms. Remains : 91/106 places, 178/214 transitions.
Stuttering acceptance computed with spot in 354 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p4))), (OR (NOT p1) (AND (NOT p2) (NOT p4))), (OR (AND (NOT p1) (NOT p4)) (AND (NOT p2) (NOT p4))), (OR (AND (NOT p1) (NOT p4)) (AND (NOT p2) (NOT p4)))]
Running random walk in product with property : MedleyA-PT-08-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) (AND (NOT p2) (NOT p4) (NOT p3))), acceptance={} source=0 dest: 1}, { cond=(OR (AND p1 (NOT p2) p4) (AND p1 (NOT p2) p3)), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p4) (NOT p3) (NOT p0))), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p4) p3 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(OR (AND p1 (NOT p2) p4 (NOT p0)) (AND p1 (NOT p2) p3 (NOT p0))), acceptance={} source=1 dest: 5}], [{ cond=(OR (AND (NOT p1) (NOT p4) (NOT p3) (NOT p0)) (AND (NOT p2) (NOT p4) (NOT p3) (NOT p0))), acceptance={} source=2 dest: 3}, { cond=(OR (AND (NOT p1) (NOT p4) p3 (NOT p0)) (AND (NOT p2) (NOT p4) p3 (NOT p0))), acceptance={} source=2 dest: 4}, { cond=(OR (AND (NOT p1) p4 (NOT p0)) (AND (NOT p1) p3 (NOT p0)) (AND (NOT p2) p4 (NOT p0)) (AND (NOT p2) p3 (NOT p0))), acceptance={} source=2 dest: 5}], [{ cond=(OR (NOT p1) (AND (NOT p2) (NOT p4) (NOT p3))), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p4) p3), acceptance={0} source=3 dest: 4}, { cond=(OR (AND p1 (NOT p2) p4) (AND p1 (NOT p2) p3)), acceptance={} source=3 dest: 5}], [{ cond=(OR (AND (NOT p1) (NOT p4) (NOT p3)) (AND (NOT p2) (NOT p4) (NOT p3))), acceptance={0} source=4 dest: 3}, { cond=(OR (AND (NOT p1) (NOT p4) p3) (AND (NOT p2) (NOT p4) p3)), acceptance={0} source=4 dest: 4}], [{ cond=(OR (AND (NOT p1) (NOT p4) (NOT p3)) (AND (NOT p2) (NOT p4) (NOT p3))), acceptance={0} source=5 dest: 3}, { cond=(OR (AND (NOT p1) (NOT p4) p3) (AND (NOT p2) (NOT p4) p3)), acceptance={0} source=5 dest: 4}, { cond=(OR (AND (NOT p1) p4) (AND (NOT p1) p3) (AND (NOT p2) p4) (AND (NOT p2) p3)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s43 1) (EQ s57 1) (EQ s67 1)), p2:(AND (EQ s9 1) (EQ s21 1) (EQ s43 1) (EQ s69 1)), p4:(EQ s40 1), p3:(AND (EQ s9 1) (EQ s21 1) (EQ s43 1) (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-08-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-08-LTLFireability-06 finished in 724 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)))))'
Support contains 4 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 214/214 transitions.
Graph (complete) has 390 edges and 106 vertex of which 101 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 100 transition count 199
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 89 transition count 198
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 24 place count 89 transition count 195
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 30 place count 86 transition count 195
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 37 place count 79 transition count 181
Iterating global reduction 2 with 7 rules applied. Total rules applied 44 place count 79 transition count 181
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 47 place count 76 transition count 175
Iterating global reduction 2 with 3 rules applied. Total rules applied 50 place count 76 transition count 175
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 75 transition count 172
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 75 transition count 172
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 80 place count 60 transition count 159
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 83 place count 60 transition count 156
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 85 place count 58 transition count 154
Iterating global reduction 3 with 2 rules applied. Total rules applied 87 place count 58 transition count 154
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -43
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 101 place count 51 transition count 197
Drop transitions removed 48 transitions
Redundant transition composition rules discarded 48 transitions
Iterating global reduction 3 with 48 rules applied. Total rules applied 149 place count 51 transition count 149
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 149 place count 51 transition count 147
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 153 place count 49 transition count 147
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 157 place count 47 transition count 170
Applied a total of 157 rules in 44 ms. Remains 47 /106 variables (removed 59) and now considering 170/214 (removed 44) transitions.
// Phase 1: matrix 170 rows 47 cols
[2024-06-02 21:00:49] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 21:00:50] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-06-02 21:00:50] [INFO ] Invariant cache hit.
[2024-06-02 21:00:50] [INFO ] State equation strengthened by 53 read => feed constraints.
[2024-06-02 21:00:50] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2024-06-02 21:00:50] [INFO ] Redundant transitions in 19 ms returned []
[2024-06-02 21:00:50] [INFO ] Invariant cache hit.
[2024-06-02 21:00:50] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/106 places, 170/214 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 380 ms. Remains : 47/106 places, 170/214 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-08-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s11 1), p1:(AND (EQ s20 1) (EQ s27 1) (EQ s34 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-08-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-08-LTLFireability-07 finished in 519 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)) U p1))'
Support contains 2 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 214/214 transitions.
Graph (complete) has 390 edges and 106 vertex of which 101 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 101 transition count 199
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 27 place count 89 transition count 197
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 27 place count 89 transition count 193
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 35 place count 85 transition count 193
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 44 place count 76 transition count 173
Iterating global reduction 2 with 9 rules applied. Total rules applied 53 place count 76 transition count 173
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 56 place count 73 transition count 165
Iterating global reduction 2 with 3 rules applied. Total rules applied 59 place count 73 transition count 165
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 61 place count 71 transition count 160
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 71 transition count 160
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 70 transition count 157
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 70 transition count 157
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 97 place count 53 transition count 142
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 101 place count 53 transition count 138
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 104 place count 50 transition count 133
Iterating global reduction 3 with 3 rules applied. Total rules applied 107 place count 50 transition count 133
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 121 place count 43 transition count 162
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 3 with 26 rules applied. Total rules applied 147 place count 43 transition count 136
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 153 place count 40 transition count 167
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 155 place count 40 transition count 165
Applied a total of 155 rules in 38 ms. Remains 40 /106 variables (removed 66) and now considering 165/214 (removed 49) transitions.
// Phase 1: matrix 165 rows 40 cols
[2024-06-02 21:00:50] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 21:00:50] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-06-02 21:00:50] [INFO ] Invariant cache hit.
[2024-06-02 21:00:50] [INFO ] State equation strengthened by 82 read => feed constraints.
[2024-06-02 21:00:50] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2024-06-02 21:00:50] [INFO ] Redundant transitions in 19 ms returned [93]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 164 rows 40 cols
[2024-06-02 21:00:50] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 21:00:50] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/106 places, 164/214 transitions.
Applied a total of 0 rules in 4 ms. Remains 40 /40 variables (removed 0) and now considering 164/164 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 369 ms. Remains : 40/106 places, 164/214 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : MedleyA-PT-08-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s11 1), p0:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-08-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-08-LTLFireability-08 finished in 465 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(p0)||X((p1||X((p2||F(p3))))))))'
Support contains 3 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 214/214 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 98 transition count 195
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 98 transition count 195
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 98 transition count 194
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 21 place count 94 transition count 183
Iterating global reduction 1 with 4 rules applied. Total rules applied 25 place count 94 transition count 183
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 92 transition count 178
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 92 transition count 178
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 91 transition count 175
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 91 transition count 175
Applied a total of 31 rules in 8 ms. Remains 91 /106 variables (removed 15) and now considering 175/214 (removed 39) transitions.
// Phase 1: matrix 175 rows 91 cols
[2024-06-02 21:00:50] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 21:00:51] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-02 21:00:51] [INFO ] Invariant cache hit.
[2024-06-02 21:00:51] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2024-06-02 21:00:51] [INFO ] Invariant cache hit.
[2024-06-02 21:00:51] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 91/106 places, 175/214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 370 ms. Remains : 91/106 places, 175/214 transitions.
Stuttering acceptance computed with spot in 326 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p2)), (NOT p3), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p0))]
Running random walk in product with property : MedleyA-PT-08-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=6 dest: 4}, { cond=(AND p0 (NOT p3)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s64 0), p1:(EQ s40 1), p2:(EQ s45 1), p3:(EQ s40 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25005 reset in 163 ms.
Product exploration explored 100000 steps with 25034 reset in 183 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Graph (complete) has 325 edges and 91 vertex of which 86 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.8 ms
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) p3), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 131 ms. Reduced automaton from 7 states, 12 edges and 4 AP (stutter sensitive) to 7 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 303 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p2)), (NOT p3), (AND (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p3) (NOT p0))]
Incomplete random walk after 10000 steps, including 494 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 10) seen :8
Incomplete Best-First random walk after 10000 steps, including 137 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 126 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-06-02 21:00:52] [INFO ] Invariant cache hit.
[2024-06-02 21:00:52] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 21:00:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-06-02 21:00:52] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 4 ms returned sat
[2024-06-02 21:00:52] [INFO ] After 49ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) p3), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (G (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (G (NOT (AND (NOT p0) (NOT p3))))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p3))), (F (NOT (AND p0 (NOT p1)))), (F (NOT p3)), (F (NOT p0)), (F (AND (NOT p0) (NOT p1))), (F p1), (F (AND p0 (NOT p2) (NOT p3))), (F (AND p0 (NOT p3)))]
Knowledge based reduction with 9 factoid took 364 ms. Reduced automaton from 7 states, 12 edges and 4 AP (stutter sensitive) to 5 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (NOT p3)]
Stuttering acceptance computed with spot in 220 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (NOT p3)]
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 175/175 transitions.
Applied a total of 0 rules in 0 ms. Remains 91 /91 variables (removed 0) and now considering 175/175 (removed 0) transitions.
[2024-06-02 21:00:53] [INFO ] Invariant cache hit.
[2024-06-02 21:00:53] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-02 21:00:53] [INFO ] Invariant cache hit.
[2024-06-02 21:00:53] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2024-06-02 21:00:53] [INFO ] Invariant cache hit.
[2024-06-02 21:00:53] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 361 ms. Remains : 91/91 places, 175/175 transitions.
Computed a total of 8 stabilizing places and 8 stable transitions
Graph (complete) has 325 edges and 91 vertex of which 86 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) p3), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 125 ms. Reduced automaton from 5 states, 7 edges and 4 AP (stutter sensitive) to 5 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (NOT p3)]
Incomplete random walk after 10000 steps, including 495 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 125 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 128 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 130 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-06-02 21:00:54] [INFO ] Invariant cache hit.
[2024-06-02 21:00:54] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-02 21:00:54] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 4 ms returned sat
[2024-06-02 21:00:54] [INFO ] After 75ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2024-06-02 21:00:54] [INFO ] After 91ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:2
Attempting to minimize the solution found.
Minimization took 12 ms.
[2024-06-02 21:00:54] [INFO ] After 162ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-02 21:00:54] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-02 21:00:54] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 4 ms returned sat
[2024-06-02 21:00:54] [INFO ] After 94ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-02 21:00:54] [INFO ] After 145ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 28 ms.
[2024-06-02 21:00:54] [INFO ] After 232ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 175/175 transitions.
Graph (complete) has 325 edges and 91 vertex of which 86 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 86 transition count 150
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 37 place count 74 transition count 148
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 37 place count 74 transition count 144
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 45 place count 70 transition count 144
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 69 transition count 141
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 69 transition count 141
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 33 rules applied. Total rules applied 80 place count 52 transition count 125
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 82 place count 52 transition count 123
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 84 place count 50 transition count 121
Iterating global reduction 3 with 2 rules applied. Total rules applied 86 place count 50 transition count 121
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 98 place count 44 transition count 145
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 108 place count 44 transition count 135
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 112 place count 42 transition count 158
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 116 place count 42 transition count 154
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 120 place count 38 transition count 154
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 122 place count 38 transition count 152
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 124 place count 36 transition count 152
Applied a total of 124 rules in 32 ms. Remains 36 /91 variables (removed 55) and now considering 152/175 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 36/91 places, 152/175 transitions.
Finished random walk after 43 steps, including 8 resets, run visited all 3 properties in 1 ms. (steps per millisecond=43 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2) p3), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p3)))))]
False Knowledge obtained : [(F (NOT p3)), (F (AND (NOT p2) (NOT p3))), (F (NOT p0)), (F (AND (NOT p0) (NOT p1))), (F p1)]
Knowledge based reduction with 4 factoid took 240 ms. Reduced automaton from 5 states, 7 edges and 4 AP (stutter sensitive) to 5 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (NOT p3)]
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (NOT p3)]
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (NOT p3)]
Product exploration explored 100000 steps with 33321 reset in 121 ms.
Product exploration explored 100000 steps with 33225 reset in 139 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (NOT p3)]
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 175/175 transitions.
Graph (complete) has 325 edges and 91 vertex of which 86 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 86 transition count 172
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 14 place count 86 transition count 170
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 14 place count 86 transition count 172
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 86 transition count 172
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 19 place count 83 transition count 169
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 22 place count 83 transition count 169
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 2 with 18 rules applied. Total rules applied 40 place count 83 transition count 172
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 43 place count 83 transition count 169
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 49 place count 77 transition count 161
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 3 with 6 rules applied. Total rules applied 55 place count 77 transition count 161
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 3 with 7 rules applied. Total rules applied 62 place count 77 transition count 199
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 65 place count 74 transition count 193
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 68 place count 74 transition count 193
Deduced a syphon composed of 28 places in 0 ms
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 80 place count 74 transition count 181
Deduced a syphon composed of 28 places in 1 ms
Applied a total of 80 rules in 22 ms. Remains 74 /91 variables (removed 17) and now considering 181/175 (removed -6) transitions.
[2024-06-02 21:00:56] [INFO ] Redundant transitions in 20 ms returned [177]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 180 rows 74 cols
[2024-06-02 21:00:56] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 21:00:56] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 74/91 places, 180/175 transitions.
Deduced a syphon composed of 28 places in 0 ms
Applied a total of 0 rules in 4 ms. Remains 74 /74 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 183 ms. Remains : 74/91 places, 180/175 transitions.
Built C files in :
/tmp/ltsmin9481746644214804729
[2024-06-02 21:00:56] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9481746644214804729
Running compilation step : cd /tmp/ltsmin9481746644214804729;'/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 471 ms.
Running link step : cd /tmp/ltsmin9481746644214804729;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin9481746644214804729;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12014053219183695759.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 175/175 transitions.
Applied a total of 0 rules in 2 ms. Remains 91 /91 variables (removed 0) and now considering 175/175 (removed 0) transitions.
// Phase 1: matrix 175 rows 91 cols
[2024-06-02 21:01:11] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 21:01:11] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-02 21:01:11] [INFO ] Invariant cache hit.
[2024-06-02 21:01:11] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2024-06-02 21:01:11] [INFO ] Invariant cache hit.
[2024-06-02 21:01:12] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 363 ms. Remains : 91/91 places, 175/175 transitions.
Built C files in :
/tmp/ltsmin12058519945521031115
[2024-06-02 21:01:12] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12058519945521031115
Running compilation step : cd /tmp/ltsmin12058519945521031115;'/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 504 ms.
Running link step : cd /tmp/ltsmin12058519945521031115;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin12058519945521031115;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8090177308110636460.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-06-02 21:01:27] [INFO ] Flatten gal took : 14 ms
[2024-06-02 21:01:27] [INFO ] Flatten gal took : 13 ms
[2024-06-02 21:01:27] [INFO ] Time to serialize gal into /tmp/LTL15699909092201790959.gal : 3 ms
[2024-06-02 21:01:27] [INFO ] Time to serialize properties into /tmp/LTL17913138436796403056.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15699909092201790959.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1644835011140233173.hoa' '-atoms' '/tmp/LTL17913138436796403056.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17913138436796403056.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1644835011140233173.hoa
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t8, t9, t11, t12, t14, t15, t16, t18, t19, t24, t25, t26, t27, t32, t33, t34, t35, t3...447
Computing Next relation with stutter on 976 deadlock states
94 unique states visited
0 strongly connected components in search stack
142 transitions explored
35 items max in DFS search stack
800 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,8.0452,164312,1,0,475,592188,388,291,4858,735376,996
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA MedleyA-PT-08-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property MedleyA-PT-08-LTLFireability-09 finished in 45239 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p1)||X(X(G(p2)))||p0)))'
Support contains 7 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 214/214 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 97 transition count 194
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 97 transition count 194
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 97 transition count 193
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 92 transition count 179
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 92 transition count 179
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 31 place count 90 transition count 174
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 90 transition count 174
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 89 transition count 171
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 89 transition count 171
Applied a total of 35 rules in 6 ms. Remains 89 /106 variables (removed 17) and now considering 171/214 (removed 43) transitions.
// Phase 1: matrix 171 rows 89 cols
[2024-06-02 21:01:36] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 21:01:36] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-02 21:01:36] [INFO ] Invariant cache hit.
[2024-06-02 21:01:36] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2024-06-02 21:01:36] [INFO ] Invariant cache hit.
[2024-06-02 21:01:36] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 89/106 places, 171/214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 313 ms. Remains : 89/106 places, 171/214 transitions.
Stuttering acceptance computed with spot in 318 ms :[(NOT p1), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : MedleyA-PT-08-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(OR (EQ s7 0) (EQ s14 0) (EQ s10 0) (EQ s22 0) (EQ s43 0) (EQ s67 0)), p0:(OR (EQ s10 0) (EQ s22 0) (EQ s43 0) (EQ s67 0)), p2:(EQ s16 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 132 ms.
Product exploration explored 100000 steps with 50000 reset in 135 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Graph (complete) has 318 edges and 89 vertex of which 84 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 15 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-08-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-08-LTLFireability-10 finished in 939 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 3 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 214/214 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 98 transition count 196
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 98 transition count 196
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 98 transition count 195
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 21 place count 94 transition count 186
Iterating global reduction 1 with 4 rules applied. Total rules applied 25 place count 94 transition count 186
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 93 transition count 183
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 93 transition count 183
Applied a total of 27 rules in 9 ms. Remains 93 /106 variables (removed 13) and now considering 183/214 (removed 31) transitions.
// Phase 1: matrix 183 rows 93 cols
[2024-06-02 21:01:37] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 21:01:37] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-02 21:01:37] [INFO ] Invariant cache hit.
[2024-06-02 21:01:37] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2024-06-02 21:01:37] [INFO ] Invariant cache hit.
[2024-06-02 21:01:37] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 93/106 places, 183/214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 386 ms. Remains : 93/106 places, 183/214 transitions.
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-08-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s30 1) (EQ s44 1) (EQ s51 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-08-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-08-LTLFireability-11 finished in 538 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0)&&F((p1&&G(p0))))||X(G(p0))))'
Support contains 4 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 214/214 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 97 transition count 197
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 97 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 97 transition count 196
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 23 place count 93 transition count 185
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 93 transition count 185
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 91 transition count 180
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 91 transition count 180
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 90 transition count 177
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 90 transition count 177
Applied a total of 33 rules in 7 ms. Remains 90 /106 variables (removed 16) and now considering 177/214 (removed 37) transitions.
// Phase 1: matrix 177 rows 90 cols
[2024-06-02 21:01:37] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 21:01:37] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-02 21:01:37] [INFO ] Invariant cache hit.
[2024-06-02 21:01:37] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2024-06-02 21:01:37] [INFO ] Invariant cache hit.
[2024-06-02 21:01:37] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 90/106 places, 177/214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 341 ms. Remains : 90/106 places, 177/214 transitions.
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (NOT p0), (NOT p0), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-08-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=4 dest: 2}, { cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s9 1) (EQ s14 1) (EQ s27 1)), p1:(EQ s72 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-08-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-08-LTLFireability-12 finished in 542 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&(G(p1) U G(p2))&&X(G(p2)))))'
Support contains 4 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 214/214 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 98 transition count 200
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 98 transition count 200
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 98 transition count 199
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 95 transition count 192
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 95 transition count 192
Applied a total of 23 rules in 4 ms. Remains 95 /106 variables (removed 11) and now considering 192/214 (removed 22) transitions.
// Phase 1: matrix 192 rows 95 cols
[2024-06-02 21:01:38] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 21:01:38] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-02 21:01:38] [INFO ] Invariant cache hit.
[2024-06-02 21:01:38] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
[2024-06-02 21:01:38] [INFO ] Invariant cache hit.
[2024-06-02 21:01:38] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 95/106 places, 192/214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 416 ms. Remains : 95/106 places, 192/214 transitions.
Stuttering acceptance computed with spot in 300 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p2), true, (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : MedleyA-PT-08-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 1}, { cond=(AND p0 p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 5}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=0 dest: 6}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p2), acceptance={0} source=1 dest: 2}, { cond=(NOT p2), acceptance={0} source=1 dest: 3}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}], [{ cond=(OR (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p0) p2 p1), acceptance={0} source=5 dest: 5}, { cond=(AND p0 p2 p1), acceptance={0} source=5 dest: 6}], [{ cond=(OR (NOT p2) (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(AND p2 p1), acceptance={} source=6 dest: 6}]], initial=4, aps=[p0:(AND (EQ s45 1) (EQ s50 1)), p2:(EQ s70 1), p1:(EQ s30 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-08-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-08-LTLFireability-13 finished in 740 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 214/214 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 97 transition count 194
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 97 transition count 194
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 97 transition count 193
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 23 place count 93 transition count 180
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 93 transition count 180
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 91 transition count 175
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 91 transition count 175
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 90 transition count 172
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 90 transition count 172
Applied a total of 33 rules in 6 ms. Remains 90 /106 variables (removed 16) and now considering 172/214 (removed 42) transitions.
// Phase 1: matrix 172 rows 90 cols
[2024-06-02 21:01:38] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 21:01:39] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-02 21:01:39] [INFO ] Invariant cache hit.
[2024-06-02 21:01:39] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
[2024-06-02 21:01:39] [INFO ] Invariant cache hit.
[2024-06-02 21:01:39] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 90/106 places, 172/214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 358 ms. Remains : 90/106 places, 172/214 transitions.
Stuttering acceptance computed with spot in 174 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-08-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(EQ s40 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]]
Product exploration explored 100000 steps with 4937 reset in 195 ms.
Product exploration explored 100000 steps with 4951 reset in 233 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Graph (complete) has 320 edges and 90 vertex of which 85 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 497 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 141 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 92026 steps, run visited all 1 properties in 152 ms. (steps per millisecond=605 )
Probabilistic random walk after 92026 steps, saw 19840 distinct states, run finished after 157 ms. (steps per millisecond=586 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 102 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 166 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 172/172 transitions.
Applied a total of 0 rules in 1 ms. Remains 90 /90 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2024-06-02 21:01:40] [INFO ] Invariant cache hit.
[2024-06-02 21:01:40] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-02 21:01:40] [INFO ] Invariant cache hit.
[2024-06-02 21:01:41] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
[2024-06-02 21:01:41] [INFO ] Invariant cache hit.
[2024-06-02 21:01:41] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 382 ms. Remains : 90/90 places, 172/172 transitions.
Computed a total of 8 stabilizing places and 8 stable transitions
Graph (complete) has 320 edges and 90 vertex of which 85 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 488 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 133 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 92026 steps, run visited all 1 properties in 151 ms. (steps per millisecond=609 )
Probabilistic random walk after 92026 steps, saw 19840 distinct states, run finished after 151 ms. (steps per millisecond=609 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 209 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4958 reset in 126 ms.
Product exploration explored 100000 steps with 4966 reset in 147 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 172/172 transitions.
Graph (complete) has 320 edges and 90 vertex of which 85 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 85 transition count 169
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 14 place count 85 transition count 167
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 14 place count 85 transition count 170
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 85 transition count 170
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 19 place count 82 transition count 167
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 22 place count 82 transition count 167
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 2 with 18 rules applied. Total rules applied 40 place count 82 transition count 170
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 43 place count 82 transition count 167
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 49 place count 76 transition count 159
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 3 with 6 rules applied. Total rules applied 55 place count 76 transition count 159
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 3 with 7 rules applied. Total rules applied 62 place count 76 transition count 197
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 65 place count 73 transition count 191
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 3 with 3 rules applied. Total rules applied 68 place count 73 transition count 191
Deduced a syphon composed of 28 places in 0 ms
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 3 with 14 rules applied. Total rules applied 82 place count 73 transition count 177
Deduced a syphon composed of 28 places in 0 ms
Applied a total of 82 rules in 30 ms. Remains 73 /90 variables (removed 17) and now considering 177/172 (removed -5) transitions.
[2024-06-02 21:01:42] [INFO ] Redundant transitions in 17 ms returned [173]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 176 rows 73 cols
[2024-06-02 21:01:42] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 21:01:43] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 73/90 places, 176/172 transitions.
Deduced a syphon composed of 28 places in 0 ms
Applied a total of 0 rules in 4 ms. Remains 73 /73 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 206 ms. Remains : 73/90 places, 176/172 transitions.
Built C files in :
/tmp/ltsmin14377085381232569279
[2024-06-02 21:01:43] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14377085381232569279
Running compilation step : cd /tmp/ltsmin14377085381232569279;'/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 485 ms.
Running link step : cd /tmp/ltsmin14377085381232569279;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin14377085381232569279;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1613718482739778418.hoa' '--buchi-type=spotba'
LTSmin run took 1909 ms.
FORMULA MedleyA-PT-08-LTLFireability-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-08-LTLFireability-14 finished in 6593 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 5 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 214/214 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 97 transition count 194
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 97 transition count 194
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 93 transition count 183
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 93 transition count 183
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 91 transition count 178
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 91 transition count 178
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 90 transition count 175
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 90 transition count 175
Applied a total of 32 rules in 3 ms. Remains 90 /106 variables (removed 16) and now considering 175/214 (removed 39) transitions.
// Phase 1: matrix 175 rows 90 cols
[2024-06-02 21:01:45] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 21:01:45] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-02 21:01:45] [INFO ] Invariant cache hit.
[2024-06-02 21:01:45] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2024-06-02 21:01:45] [INFO ] Invariant cache hit.
[2024-06-02 21:01:45] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 90/106 places, 175/214 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 333 ms. Remains : 90/106 places, 175/214 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-08-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (EQ s9 1) (EQ s21 1) (EQ s42 1) (EQ s68 1) (EQ s61 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-08-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-08-LTLFireability-15 finished in 488 ms.
All properties solved by simple procedures.
Total runtime 148387 ms.

BK_STOP 1717362107217

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

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