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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 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 12K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K 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 33K 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-06-LTLFireability-00
FORMULA_NAME MedleyA-PT-06-LTLFireability-01
FORMULA_NAME MedleyA-PT-06-LTLFireability-02
FORMULA_NAME MedleyA-PT-06-LTLFireability-03
FORMULA_NAME MedleyA-PT-06-LTLFireability-04
FORMULA_NAME MedleyA-PT-06-LTLFireability-05
FORMULA_NAME MedleyA-PT-06-LTLFireability-06
FORMULA_NAME MedleyA-PT-06-LTLFireability-07
FORMULA_NAME MedleyA-PT-06-LTLFireability-08
FORMULA_NAME MedleyA-PT-06-LTLFireability-09
FORMULA_NAME MedleyA-PT-06-LTLFireability-10
FORMULA_NAME MedleyA-PT-06-LTLFireability-11
FORMULA_NAME MedleyA-PT-06-LTLFireability-12
FORMULA_NAME MedleyA-PT-06-LTLFireability-13
FORMULA_NAME MedleyA-PT-06-LTLFireability-14
FORMULA_NAME MedleyA-PT-06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717361773760

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-06
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-06-02 20:56:16] [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:56:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:56:16] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2024-06-02 20:56:16] [INFO ] Transformed 124 places.
[2024-06-02 20:56:16] [INFO ] Transformed 118 transitions.
[2024-06-02 20:56:16] [INFO ] Found NUPN structural information;
[2024-06-02 20:56:16] [INFO ] Parsed PT model containing 124 places and 118 transitions and 372 arcs in 202 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA MedleyA-PT-06-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-06-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 118/118 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 120 transition count 118
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 14 place count 110 transition count 108
Iterating global reduction 1 with 10 rules applied. Total rules applied 24 place count 110 transition count 108
Applied a total of 24 rules in 35 ms. Remains 110 /124 variables (removed 14) and now considering 108/118 (removed 10) transitions.
// Phase 1: matrix 108 rows 110 cols
[2024-06-02 20:56:17] [INFO ] Computed 20 invariants in 11 ms
[2024-06-02 20:56:17] [INFO ] Implicit Places using invariants in 301 ms returned [24, 30]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 350 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 108/124 places, 108/118 transitions.
Applied a total of 0 rules in 6 ms. Remains 108 /108 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 392 ms. Remains : 108/124 places, 108/118 transitions.
Support contains 33 out of 108 places after structural reductions.
[2024-06-02 20:56:17] [INFO ] Flatten gal took : 50 ms
[2024-06-02 20:56:17] [INFO ] Flatten gal took : 20 ms
[2024-06-02 20:56:18] [INFO ] Input system was already deterministic with 108 transitions.
Support contains 30 out of 108 places (down from 33) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 275 resets, run finished after 757 ms. (steps per millisecond=13 ) properties (out of 26) seen :19
Incomplete Best-First random walk after 10001 steps, including 82 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 71 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 82 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 82 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 108 rows 108 cols
[2024-06-02 20:56:19] [INFO ] Computed 18 invariants in 7 ms
[2024-06-02 20:56:19] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-06-02 20:56:19] [INFO ] [Real]Absence check using 11 positive and 7 generalized place invariants in 5 ms returned sat
[2024-06-02 20:56:19] [INFO ] After 138ms SMT Verify possible using state equation in real domain returned unsat :1 sat :3 real:2
[2024-06-02 20:56:19] [INFO ] After 212ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :2 real:3
Attempting to minimize the solution found.
Minimization took 35 ms.
[2024-06-02 20:56:19] [INFO ] After 411ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :2 real:3
[2024-06-02 20:56:19] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-06-02 20:56:19] [INFO ] [Nat]Absence check using 11 positive and 7 generalized place invariants in 6 ms returned sat
[2024-06-02 20:56:20] [INFO ] After 126ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2024-06-02 20:56:20] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-06-02 20:56:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2024-06-02 20:56:20] [INFO ] After 305ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 62 ms.
[2024-06-02 20:56:20] [INFO ] After 498ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 33 ms.
Support contains 6 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 108/108 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 107 transition count 101
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 100 transition count 101
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 15 place count 100 transition count 94
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 29 place count 93 transition count 94
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 36 place count 86 transition count 87
Iterating global reduction 2 with 7 rules applied. Total rules applied 43 place count 86 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 46 place count 85 transition count 85
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 47 place count 84 transition count 85
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 47 place count 84 transition count 84
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 49 place count 83 transition count 84
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 50 place count 82 transition count 83
Iterating global reduction 4 with 1 rules applied. Total rules applied 51 place count 82 transition count 83
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 52 place count 81 transition count 82
Iterating global reduction 4 with 1 rules applied. Total rules applied 53 place count 81 transition count 82
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 95 place count 60 transition count 61
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 103 place count 56 transition count 62
Free-agglomeration rule applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 109 place count 56 transition count 56
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 115 place count 50 transition count 56
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 118 place count 50 transition count 53
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 121 place count 47 transition count 53
Applied a total of 121 rules in 66 ms. Remains 47 /108 variables (removed 61) and now considering 53/108 (removed 55) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 47/108 places, 53/108 transitions.
Finished random walk after 6485 steps, including 513 resets, run visited all 5 properties in 86 ms. (steps per millisecond=75 )
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 11 stabilizing places and 11 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((!p0&&X((!p0 U (!p1||G(!p0))))))))'
Support contains 4 out of 108 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 108/108 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 107 transition count 108
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 100 transition count 101
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 100 transition count 101
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 99 transition count 100
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 99 transition count 100
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 98 transition count 99
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 98 transition count 99
Applied a total of 19 rules in 23 ms. Remains 98 /108 variables (removed 10) and now considering 99/108 (removed 9) transitions.
// Phase 1: matrix 99 rows 98 cols
[2024-06-02 20:56:21] [INFO ] Computed 17 invariants in 3 ms
[2024-06-02 20:56:21] [INFO ] Implicit Places using invariants in 114 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 125 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 97/108 places, 99/108 transitions.
Applied a total of 0 rules in 3 ms. Remains 97 /97 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 151 ms. Remains : 97/108 places, 99/108 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 270 ms :[true, p0, p0]
Running random walk in product with property : MedleyA-PT-06-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s14 1) (EQ s21 1) (EQ s25 1) (EQ s30 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2803 reset in 402 ms.
Product exploration explored 100000 steps with 2782 reset in 294 ms.
Computed a total of 9 stabilizing places and 9 stable transitions
Computed a total of 9 stabilizing places and 9 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 166 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[true, p0]
Incomplete random walk after 10000 steps, including 276 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2307787 steps, run timeout after 3001 ms. (steps per millisecond=769 ) properties seen :{}
Probabilistic random walk after 2307787 steps, saw 357835 distinct states, run finished after 3002 ms. (steps per millisecond=768 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 99 rows 97 cols
[2024-06-02 20:56:25] [INFO ] Computed 16 invariants in 5 ms
[2024-06-02 20:56:25] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-06-02 20:56:25] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 20:56:25] [INFO ] After 87ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-06-02 20:56:25] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 2 ms to minimize.
[2024-06-02 20:56:25] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 1 ms to minimize.
[2024-06-02 20:56:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 197 ms
[2024-06-02 20:56:25] [INFO ] After 314ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 20:56:25] [INFO ] After 400ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 20:56:25] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-06-02 20:56:25] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 4 ms returned sat
[2024-06-02 20:56:26] [INFO ] After 59ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 20:56:26] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2024-06-02 20:56:26] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-06-02 20:56:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 118 ms
[2024-06-02 20:56:26] [INFO ] After 186ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-06-02 20:56:26] [INFO ] After 261ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 99/99 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 97 transition count 92
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 90 transition count 91
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 15 place count 90 transition count 81
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 35 place count 80 transition count 81
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 36 place count 79 transition count 81
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 78 place count 58 transition count 60
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -3
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 88 place count 53 transition count 63
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 93 place count 53 transition count 58
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 98 place count 48 transition count 58
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 101 place count 48 transition count 55
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 104 place count 45 transition count 55
Applied a total of 104 rules in 26 ms. Remains 45 /97 variables (removed 52) and now considering 55/99 (removed 44) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 45/97 places, 55/99 transitions.
Finished random walk after 6203 steps, including 494 resets, run visited all 1 properties in 12 ms. (steps per millisecond=516 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Property proved to be false thanks to negative knowledge :(F p0)
Knowledge based reduction with 4 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-06-LTLFireability-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-06-LTLFireability-00 finished in 5313 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 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 108/108 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 106 transition count 100
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 99 transition count 100
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 15 place count 99 transition count 93
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 29 place count 92 transition count 93
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 40 place count 81 transition count 71
Iterating global reduction 2 with 11 rules applied. Total rules applied 51 place count 81 transition count 71
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 54 place count 80 transition count 69
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 55 place count 79 transition count 69
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 55 place count 79 transition count 67
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 59 place count 77 transition count 67
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 60 place count 76 transition count 66
Iterating global reduction 4 with 1 rules applied. Total rules applied 61 place count 76 transition count 66
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 62 place count 75 transition count 65
Iterating global reduction 4 with 1 rules applied. Total rules applied 63 place count 75 transition count 65
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 109 place count 52 transition count 42
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 117 place count 48 transition count 45
Applied a total of 117 rules in 29 ms. Remains 48 /108 variables (removed 60) and now considering 45/108 (removed 63) transitions.
// Phase 1: matrix 45 rows 48 cols
[2024-06-02 20:56:26] [INFO ] Computed 16 invariants in 1 ms
[2024-06-02 20:56:26] [INFO ] Implicit Places using invariants in 63 ms returned [16, 23, 25, 27, 31, 41]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 64 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/108 places, 45/108 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 42 transition count 43
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 40 transition count 43
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 38 transition count 41
Applied a total of 8 rules in 5 ms. Remains 38 /42 variables (removed 4) and now considering 41/45 (removed 4) transitions.
// Phase 1: matrix 41 rows 38 cols
[2024-06-02 20:56:26] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 20:56:26] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-02 20:56:26] [INFO ] Invariant cache hit.
[2024-06-02 20:56:26] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-02 20:56:26] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 38/108 places, 41/108 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 237 ms. Remains : 38/108 places, 41/108 transitions.
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-06-LTLFireability-01 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 s7 0), p1:(EQ s25 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 11 steps with 1 reset in 0 ms.
FORMULA MedleyA-PT-06-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-06-LTLFireability-01 finished in 424 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((X(G((p0 U p1)))||F(!p0))) U X(p1)))'
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 108/108 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 107 transition count 108
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 97 transition count 87
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 97 transition count 87
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 96 transition count 86
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 96 transition count 86
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 95 transition count 85
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 95 transition count 85
Applied a total of 25 rules in 9 ms. Remains 95 /108 variables (removed 13) and now considering 85/108 (removed 23) transitions.
// Phase 1: matrix 85 rows 95 cols
[2024-06-02 20:56:26] [INFO ] Computed 17 invariants in 2 ms
[2024-06-02 20:56:26] [INFO ] Implicit Places using invariants in 93 ms returned [54]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 94 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 94/108 places, 85/108 transitions.
Applied a total of 0 rules in 1 ms. Remains 94 /94 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 104 ms. Remains : 94/108 places, 85/108 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : MedleyA-PT-06-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s60 1), p0:(EQ s42 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2815 reset in 308 ms.
Product exploration explored 100000 steps with 2794 reset in 244 ms.
Computed a total of 9 stabilizing places and 9 stable transitions
Computed a total of 9 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), true, (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 109 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 6 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 262 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, false]
Incomplete random walk after 10000 steps, including 268 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :3
Finished Best-First random walk after 625 steps, including 3 resets, run visited all 1 properties in 2 ms. (steps per millisecond=312 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), true, (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F p1), (F (AND p0 p1))]
Knowledge based reduction with 5 factoid took 215 ms. Reduced automaton from 6 states, 13 edges and 2 AP (stutter insensitive) to 6 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 254 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, false]
Stuttering acceptance computed with spot in 263 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, false]
// Phase 1: matrix 85 rows 94 cols
[2024-06-02 20:56:28] [INFO ] Computed 16 invariants in 5 ms
[2024-06-02 20:56:28] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-06-02 20:56:28] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 5 ms returned sat
[2024-06-02 20:56:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 20:56:28] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2024-06-02 20:56:28] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:56:28] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-06-02 20:56:28] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 5 ms returned sat
[2024-06-02 20:56:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 20:56:29] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2024-06-02 20:56:29] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-06-02 20:56:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2024-06-02 20:56:29] [INFO ] Computed and/alt/rep : 84/156/84 causal constraints (skipped 0 transitions) in 13 ms.
[2024-06-02 20:56:29] [INFO ] Added : 84 causal constraints over 18 iterations in 237 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 85/85 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 93 transition count 77
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 86 transition count 76
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 15 place count 86 transition count 65
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 37 place count 75 transition count 65
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 74 transition count 65
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 82 place count 52 transition count 43
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -9
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 92 place count 47 transition count 52
Applied a total of 92 rules in 16 ms. Remains 47 /94 variables (removed 47) and now considering 52/85 (removed 33) transitions.
// Phase 1: matrix 52 rows 47 cols
[2024-06-02 20:56:29] [INFO ] Computed 15 invariants in 1 ms
[2024-06-02 20:56:29] [INFO ] Implicit Places using invariants in 59 ms returned [14, 22, 26, 30, 40]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 61 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/94 places, 52/85 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 42 transition count 50
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 40 transition count 50
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 38 transition count 48
Applied a total of 8 rules in 6 ms. Remains 38 /42 variables (removed 4) and now considering 48/52 (removed 4) transitions.
// Phase 1: matrix 48 rows 38 cols
[2024-06-02 20:56:29] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 20:56:29] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-02 20:56:29] [INFO ] Invariant cache hit.
[2024-06-02 20:56:29] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-02 20:56:29] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 38/94 places, 48/85 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 219 ms. Remains : 38/94 places, 48/85 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 8 factoid took 240 ms. Reduced automaton from 6 states, 13 edges and 2 AP (stutter insensitive) to 6 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 275 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, false]
Finished random walk after 104 steps, including 9 resets, run visited all 4 properties in 2 ms. (steps per millisecond=52 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X p1)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F p1), (F (AND p0 p1))]
Knowledge based reduction with 8 factoid took 374 ms. Reduced automaton from 6 states, 13 edges and 2 AP (stutter insensitive) to 6 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 272 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, false]
Stuttering acceptance computed with spot in 257 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, false]
[2024-06-02 20:56:30] [INFO ] Invariant cache hit.
[2024-06-02 20:56:31] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 20:56:31] [INFO ] [Real]Absence check using 8 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-02 20:56:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 20:56:31] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-06-02 20:56:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:56:31] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 20:56:31] [INFO ] [Nat]Absence check using 8 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-02 20:56:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 20:56:31] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-06-02 20:56:31] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-02 20:56:31] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2024-06-02 20:56:31] [INFO ] Computed and/alt/rep : 19/60/19 causal constraints (skipped 21 transitions) in 6 ms.
[2024-06-02 20:56:31] [INFO ] Added : 9 causal constraints over 3 iterations in 31 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 275 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), false, false]
Stuttering criterion allowed to conclude after 1987 steps with 202 reset in 4 ms.
FORMULA MedleyA-PT-06-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-06-LTLFireability-02 finished in 4747 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 6 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 108/108 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 107 transition count 108
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 100 transition count 101
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 100 transition count 101
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 99 transition count 100
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 99 transition count 100
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 98 transition count 99
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 98 transition count 99
Applied a total of 19 rules in 10 ms. Remains 98 /108 variables (removed 10) and now considering 99/108 (removed 9) transitions.
// Phase 1: matrix 99 rows 98 cols
[2024-06-02 20:56:31] [INFO ] Computed 17 invariants in 1 ms
[2024-06-02 20:56:31] [INFO ] Implicit Places using invariants in 84 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 86 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 97/108 places, 99/108 transitions.
Applied a total of 0 rules in 2 ms. Remains 97 /97 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 99 ms. Remains : 97/108 places, 99/108 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-06-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (EQ s14 1) (EQ s21 1) (EQ s24 1) (EQ s30 1)), p0:(OR (AND (EQ s14 1) (EQ s21 1) (EQ s24 1) (EQ s30 1)) (EQ s83 0) (EQ s92 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 360 steps with 9 reset in 1 ms.
FORMULA MedleyA-PT-06-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-06-LTLFireability-03 finished in 243 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 1 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 108/108 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 107 transition count 108
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 97 transition count 87
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 97 transition count 87
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 96 transition count 86
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 96 transition count 86
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 95 transition count 85
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 95 transition count 85
Applied a total of 25 rules in 8 ms. Remains 95 /108 variables (removed 13) and now considering 85/108 (removed 23) transitions.
// Phase 1: matrix 85 rows 95 cols
[2024-06-02 20:56:31] [INFO ] Computed 17 invariants in 2 ms
[2024-06-02 20:56:31] [INFO ] Implicit Places using invariants in 80 ms returned [53]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 82 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 94/108 places, 85/108 transitions.
Applied a total of 0 rules in 1 ms. Remains 94 /94 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 93 ms. Remains : 94/108 places, 85/108 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-06-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(EQ s82 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-06-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-06-LTLFireability-05 finished in 262 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U X(p1)))'
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 108/108 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 107 transition count 108
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 97 transition count 87
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 97 transition count 87
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 96 transition count 86
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 96 transition count 86
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 95 transition count 85
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 95 transition count 85
Applied a total of 25 rules in 6 ms. Remains 95 /108 variables (removed 13) and now considering 85/108 (removed 23) transitions.
// Phase 1: matrix 85 rows 95 cols
[2024-06-02 20:56:32] [INFO ] Computed 17 invariants in 2 ms
[2024-06-02 20:56:32] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-02 20:56:32] [INFO ] Invariant cache hit.
[2024-06-02 20:56:32] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2024-06-02 20:56:32] [INFO ] Invariant cache hit.
[2024-06-02 20:56:32] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 95/108 places, 85/108 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 308 ms. Remains : 95/108 places, 85/108 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : MedleyA-PT-06-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(OR (AND (EQ s23 1) (EQ s53 1)) (EQ s72 1)), p1:(EQ s72 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 7355 reset in 165 ms.
Product exploration explored 100000 steps with 7375 reset in 307 ms.
Computed a total of 10 stabilizing places and 10 stable transitions
Computed a total of 10 stabilizing places and 10 stable transitions
Detected a total of 10/95 stabilizing places and 10/85 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 141 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 271 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-06-02 20:56:33] [INFO ] Invariant cache hit.
[2024-06-02 20:56:33] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-06-02 20:56:33] [INFO ] [Real]Absence check using 11 positive and 6 generalized place invariants in 4 ms returned sat
[2024-06-02 20:56:33] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 20:56:33] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-06-02 20:56:33] [INFO ] [Nat]Absence check using 11 positive and 6 generalized place invariants in 3 ms returned sat
[2024-06-02 20:56:33] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 20:56:33] [INFO ] After 63ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-06-02 20:56:33] [INFO ] After 122ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 95 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 95/95 places, 85/85 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 95 transition count 78
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 88 transition count 77
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 15 place count 88 transition count 69
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 31 place count 80 transition count 69
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 79 transition count 69
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 76 place count 57 transition count 47
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -9
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 88 place count 51 transition count 56
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 92 place count 51 transition count 52
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 96 place count 47 transition count 52
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 99 place count 47 transition count 49
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 102 place count 44 transition count 49
Applied a total of 102 rules in 22 ms. Remains 44 /95 variables (removed 51) and now considering 49/85 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 44/95 places, 49/85 transitions.
Finished random walk after 82 steps, including 5 resets, run visited all 1 properties in 1 ms. (steps per millisecond=82 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 9 factoid took 255 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 133 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
[2024-06-02 20:56:34] [INFO ] Invariant cache hit.
[2024-06-02 20:56:34] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-06-02 20:56:34] [INFO ] [Real]Absence check using 11 positive and 6 generalized place invariants in 4 ms returned sat
[2024-06-02 20:56:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 20:56:34] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2024-06-02 20:56:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:56:34] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-06-02 20:56:34] [INFO ] [Nat]Absence check using 11 positive and 6 generalized place invariants in 4 ms returned sat
[2024-06-02 20:56:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 20:56:34] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2024-06-02 20:56:34] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-06-02 20:56:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2024-06-02 20:56:34] [INFO ] Computed and/alt/rep : 84/157/84 causal constraints (skipped 0 transitions) in 9 ms.
[2024-06-02 20:56:34] [INFO ] Added : 80 causal constraints over 17 iterations in 203 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 3 out of 95 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 85/85 transitions.
Applied a total of 0 rules in 6 ms. Remains 95 /95 variables (removed 0) and now considering 85/85 (removed 0) transitions.
[2024-06-02 20:56:34] [INFO ] Invariant cache hit.
[2024-06-02 20:56:34] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-02 20:56:34] [INFO ] Invariant cache hit.
[2024-06-02 20:56:34] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2024-06-02 20:56:34] [INFO ] Invariant cache hit.
[2024-06-02 20:56:34] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 287 ms. Remains : 95/95 places, 85/85 transitions.
Computed a total of 10 stabilizing places and 10 stable transitions
Computed a total of 10 stabilizing places and 10 stable transitions
Detected a total of 10/95 stabilizing places and 10/85 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 136 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 282 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 60 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-06-02 20:56:35] [INFO ] Invariant cache hit.
[2024-06-02 20:56:35] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-06-02 20:56:35] [INFO ] [Real]Absence check using 11 positive and 6 generalized place invariants in 3 ms returned sat
[2024-06-02 20:56:35] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 20:56:35] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-06-02 20:56:35] [INFO ] [Nat]Absence check using 11 positive and 6 generalized place invariants in 3 ms returned sat
[2024-06-02 20:56:35] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 20:56:35] [INFO ] After 57ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-06-02 20:56:35] [INFO ] After 111ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 95 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 95/95 places, 85/85 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 95 transition count 78
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 88 transition count 77
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 15 place count 88 transition count 69
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 31 place count 80 transition count 69
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 79 transition count 69
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 76 place count 57 transition count 47
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -9
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 88 place count 51 transition count 56
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 92 place count 51 transition count 52
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 96 place count 47 transition count 52
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 99 place count 47 transition count 49
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 102 place count 44 transition count 49
Applied a total of 102 rules in 22 ms. Remains 44 /95 variables (removed 51) and now considering 49/85 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 44/95 places, 49/85 transitions.
Finished random walk after 92 steps, including 7 resets, run visited all 1 properties in 1 ms. (steps per millisecond=92 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 245 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
[2024-06-02 20:56:35] [INFO ] Invariant cache hit.
[2024-06-02 20:56:35] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-06-02 20:56:35] [INFO ] [Real]Absence check using 11 positive and 6 generalized place invariants in 5 ms returned sat
[2024-06-02 20:56:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 20:56:35] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2024-06-02 20:56:35] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 20:56:36] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-06-02 20:56:36] [INFO ] [Nat]Absence check using 11 positive and 6 generalized place invariants in 4 ms returned sat
[2024-06-02 20:56:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 20:56:36] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2024-06-02 20:56:36] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-06-02 20:56:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2024-06-02 20:56:36] [INFO ] Computed and/alt/rep : 84/157/84 causal constraints (skipped 0 transitions) in 9 ms.
[2024-06-02 20:56:36] [INFO ] Added : 80 causal constraints over 17 iterations in 193 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 132 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 7317 reset in 216 ms.
Product exploration explored 100000 steps with 7374 reset in 273 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Support contains 3 out of 95 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 95/95 places, 85/85 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 95 transition count 85
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 95 transition count 84
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 8 place count 95 transition count 88
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 95 transition count 88
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 18 place count 93 transition count 86
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 93 transition count 86
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 41 place count 93 transition count 86
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 92 transition count 85
Deduced a syphon composed of 33 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 92 transition count 85
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 38 places in 0 ms
Iterating global reduction 2 with 5 rules applied. Total rules applied 48 place count 92 transition count 120
Deduced a syphon composed of 38 places in 0 ms
Applied a total of 48 rules in 41 ms. Remains 92 /95 variables (removed 3) and now considering 120/85 (removed -35) transitions.
[2024-06-02 20:56:37] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 120 rows 92 cols
[2024-06-02 20:56:37] [INFO ] Computed 17 invariants in 2 ms
[2024-06-02 20:56:37] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 92/95 places, 120/85 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 169 ms. Remains : 92/95 places, 120/85 transitions.
Built C files in :
/tmp/ltsmin6518946988912000170
[2024-06-02 20:56:37] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6518946988912000170
Running compilation step : cd /tmp/ltsmin6518946988912000170;'/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 522 ms.
Running link step : cd /tmp/ltsmin6518946988912000170;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin6518946988912000170;'/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/stateBased13760995832654611431.hoa' '--buchi-type=spotba'
LTSmin run took 140 ms.
FORMULA MedleyA-PT-06-LTLFireability-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-06-LTLFireability-06 finished in 6281 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 108/108 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 106 transition count 100
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 99 transition count 100
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 15 place count 99 transition count 93
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 29 place count 92 transition count 93
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 40 place count 81 transition count 71
Iterating global reduction 2 with 11 rules applied. Total rules applied 51 place count 81 transition count 71
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 54 place count 80 transition count 69
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 55 place count 79 transition count 69
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 55 place count 79 transition count 67
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 59 place count 77 transition count 67
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 60 place count 76 transition count 66
Iterating global reduction 4 with 1 rules applied. Total rules applied 61 place count 76 transition count 66
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 62 place count 75 transition count 65
Iterating global reduction 4 with 1 rules applied. Total rules applied 63 place count 75 transition count 65
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 105 place count 54 transition count 44
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 117 place count 48 transition count 53
Applied a total of 117 rules in 21 ms. Remains 48 /108 variables (removed 60) and now considering 53/108 (removed 55) transitions.
// Phase 1: matrix 53 rows 48 cols
[2024-06-02 20:56:38] [INFO ] Computed 16 invariants in 1 ms
[2024-06-02 20:56:38] [INFO ] Implicit Places using invariants in 69 ms returned [15, 22, 24, 26, 29]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 70 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/108 places, 53/108 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 43 transition count 52
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 42 transition count 52
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 41 transition count 51
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 40 transition count 57
Applied a total of 6 rules in 6 ms. Remains 40 /43 variables (removed 3) and now considering 57/53 (removed -4) transitions.
// Phase 1: matrix 57 rows 40 cols
[2024-06-02 20:56:38] [INFO ] Computed 11 invariants in 2 ms
[2024-06-02 20:56:38] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-02 20:56:38] [INFO ] Invariant cache hit.
[2024-06-02 20:56:38] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-06-02 20:56:38] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 40/108 places, 57/108 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 242 ms. Remains : 40/108 places, 57/108 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-06-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s32 1) (EQ s36 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-06-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-06-LTLFireability-07 finished in 307 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(((X(p0) U G(p1))&&(p1 U p2))))))'
Support contains 8 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 108/108 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 107 transition count 108
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 101 transition count 102
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 101 transition count 102
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 100 transition count 101
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 100 transition count 101
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 99 transition count 100
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 99 transition count 100
Applied a total of 17 rules in 6 ms. Remains 99 /108 variables (removed 9) and now considering 100/108 (removed 8) transitions.
// Phase 1: matrix 100 rows 99 cols
[2024-06-02 20:56:38] [INFO ] Computed 17 invariants in 2 ms
[2024-06-02 20:56:38] [INFO ] Implicit Places using invariants in 75 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 77 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/108 places, 100/108 transitions.
Applied a total of 0 rules in 1 ms. Remains 98 /98 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 85 ms. Remains : 98/108 places, 100/108 transitions.
Stuttering acceptance computed with spot in 385 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), true, (NOT p0), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : MedleyA-PT-06-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 6}, { cond=p1, acceptance={} source=2 dest: 7}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}, { cond=p1, acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 8}], [{ cond=(NOT p1), acceptance={} source=8 dest: 3}, { cond=p1, acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(AND (EQ s15 1) (EQ s21 1) (EQ s24 1) (EQ s31 1)), p2:(AND (EQ s15 1) (EQ s20 1) (EQ s25 1) (EQ s30 1)), p0:(EQ s76 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-06-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-06-LTLFireability-08 finished in 498 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G(F(((!p2&&X(G((G(p4)||p3))))||p1)))))'
Support contains 7 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 108/108 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 106 transition count 100
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 99 transition count 100
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 15 place count 99 transition count 93
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 29 place count 92 transition count 93
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 36 place count 85 transition count 86
Iterating global reduction 2 with 7 rules applied. Total rules applied 43 place count 85 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 46 place count 84 transition count 84
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 47 place count 83 transition count 84
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 47 place count 83 transition count 83
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 49 place count 82 transition count 83
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 50 place count 81 transition count 82
Iterating global reduction 4 with 1 rules applied. Total rules applied 51 place count 81 transition count 82
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 52 place count 80 transition count 81
Iterating global reduction 4 with 1 rules applied. Total rules applied 53 place count 80 transition count 81
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 93 place count 60 transition count 61
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 99 place count 57 transition count 61
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 100 place count 57 transition count 61
Applied a total of 100 rules in 29 ms. Remains 57 /108 variables (removed 51) and now considering 61/108 (removed 47) transitions.
// Phase 1: matrix 61 rows 57 cols
[2024-06-02 20:56:39] [INFO ] Computed 16 invariants in 1 ms
[2024-06-02 20:56:39] [INFO ] Implicit Places using invariants in 69 ms returned [23, 32, 35, 37, 40, 50]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 71 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/108 places, 61/108 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 51 transition count 58
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 48 transition count 58
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 45 transition count 55
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 14 place count 44 transition count 55
Applied a total of 14 rules in 5 ms. Remains 44 /51 variables (removed 7) and now considering 55/61 (removed 6) transitions.
// Phase 1: matrix 55 rows 44 cols
[2024-06-02 20:56:39] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 20:56:39] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-06-02 20:56:39] [INFO ] Invariant cache hit.
[2024-06-02 20:56:39] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-02 20:56:39] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 44/108 places, 55/108 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 228 ms. Remains : 44/108 places, 55/108 transitions.
Stuttering acceptance computed with spot in 393 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) p2)), (NOT p0), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) p2)), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) p2)), (AND (NOT p1) (NOT p3) (NOT p4)), (AND (NOT p1) (NOT p3) (NOT p4)), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) p2 (NOT p4)))]
Running random walk in product with property : MedleyA-PT-06-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND p2 (NOT p1)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 4}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND p2 (NOT p1) (NOT p3) (NOT p4)), acceptance={0, 1} source=4 dest: 2}, { cond=(OR (AND (NOT p1) p3) (AND (NOT p1) p4)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1) (NOT p3) (NOT p4)), acceptance={0, 1} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1) (NOT p3) p4), acceptance={1} source=4 dest: 5}, { cond=(AND p2 (NOT p1) (NOT p3) p4), acceptance={1} source=4 dest: 6}], [{ cond=(AND p2 (NOT p1) (NOT p3) (NOT p4)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND (NOT p1) p3 (NOT p4)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p2) (NOT p1) (NOT p3) (NOT p4)), acceptance={0, 1} source=5 dest: 4}, { cond=(AND (NOT p1) p3 p4), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p2) (NOT p1) (NOT p3) p4), acceptance={1} source=5 dest: 5}, { cond=(AND p2 (NOT p1) (NOT p3) p4), acceptance={1} source=5 dest: 6}], [{ cond=(AND p2 (NOT p1) (NOT p4)), acceptance={0, 1} source=6 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p4)), acceptance={0, 1} source=6 dest: 4}, { cond=(AND (NOT p2) (NOT p1) p4), acceptance={1} source=6 dest: 5}, { cond=(AND p2 (NOT p1) p4), acceptance={1} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s23 1) (EQ s25 1)), p2:(AND (EQ s7 1) (EQ s12 1) (EQ s15 1) (EQ s17 1)), p1:(OR (EQ s7 0) (EQ s12 0) (EQ s15 0) (EQ s17 0)), p3:(OR (NEQ s7 1)...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 28 steps with 1 reset in 0 ms.
FORMULA MedleyA-PT-06-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-06-LTLFireability-09 finished in 653 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(p1)||X(G(p2))))'
Support contains 7 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 108/108 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 107 transition count 108
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 101 transition count 102
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 101 transition count 102
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 100 transition count 101
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 100 transition count 101
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 99 transition count 100
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 99 transition count 100
Applied a total of 17 rules in 9 ms. Remains 99 /108 variables (removed 9) and now considering 100/108 (removed 8) transitions.
// Phase 1: matrix 100 rows 99 cols
[2024-06-02 20:56:39] [INFO ] Computed 17 invariants in 1 ms
[2024-06-02 20:56:39] [INFO ] Implicit Places using invariants in 78 ms returned [58]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 80 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 98/108 places, 100/108 transitions.
Applied a total of 0 rules in 1 ms. Remains 98 /98 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 92 ms. Remains : 98/108 places, 100/108 transitions.
Stuttering acceptance computed with spot in 335 ms :[true, (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-06-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND p0 p1), acceptance={} source=1 dest: 5}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 2}, { cond=(AND p0 p2), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=5 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=5 dest: 4}, { cond=(AND p0 p1 p2), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=5 dest: 7}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=5 dest: 8}], [{ cond=(NOT p1), acceptance={} source=6 dest: 0}, { cond=p1, acceptance={} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 0}, { cond=p0, acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=8 dest: 7}, { cond=(AND p0 p1), acceptance={} source=8 dest: 8}]], initial=1, aps=[p0:(AND (EQ s71 1) (EQ s77 1)), p1:(EQ s48 0), p2:(AND (EQ s14 1) (EQ s21 1) (EQ s25 1) (EQ s30 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, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 60 steps with 1 reset in 1 ms.
FORMULA MedleyA-PT-06-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-06-LTLFireability-10 finished in 450 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 108/108 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 106 transition count 100
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 99 transition count 100
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 15 place count 99 transition count 93
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 29 place count 92 transition count 93
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 40 place count 81 transition count 71
Iterating global reduction 2 with 11 rules applied. Total rules applied 51 place count 81 transition count 71
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 54 place count 80 transition count 69
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 55 place count 79 transition count 69
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 55 place count 79 transition count 67
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 59 place count 77 transition count 67
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 60 place count 76 transition count 66
Iterating global reduction 4 with 1 rules applied. Total rules applied 61 place count 76 transition count 66
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 62 place count 75 transition count 65
Iterating global reduction 4 with 1 rules applied. Total rules applied 63 place count 75 transition count 65
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 109 place count 52 transition count 42
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 119 place count 47 transition count 50
Applied a total of 119 rules in 20 ms. Remains 47 /108 variables (removed 61) and now considering 50/108 (removed 58) transitions.
// Phase 1: matrix 50 rows 47 cols
[2024-06-02 20:56:40] [INFO ] Computed 16 invariants in 1 ms
[2024-06-02 20:56:40] [INFO ] Implicit Places using invariants in 70 ms returned [15, 23, 25, 27, 30, 40]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 71 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/108 places, 50/108 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 41 transition count 48
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 39 transition count 48
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 36 transition count 45
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 35 transition count 51
Applied a total of 12 rules in 6 ms. Remains 35 /41 variables (removed 6) and now considering 51/50 (removed -1) transitions.
// Phase 1: matrix 51 rows 35 cols
[2024-06-02 20:56:40] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 20:56:40] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-02 20:56:40] [INFO ] Invariant cache hit.
[2024-06-02 20:56:40] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-06-02 20:56:40] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 35/108 places, 51/108 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 229 ms. Remains : 35/108 places, 51/108 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-06-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s16 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 10048 reset in 161 ms.
Stack based approach found an accepted trace after 7202 steps with 736 reset with depth 16 and stack size 16 in 21 ms.
FORMULA MedleyA-PT-06-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-06-LTLFireability-11 finished in 473 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 108/108 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 106 transition count 100
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 99 transition count 100
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 15 place count 99 transition count 93
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 29 place count 92 transition count 93
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 39 place count 82 transition count 72
Iterating global reduction 2 with 10 rules applied. Total rules applied 49 place count 82 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 52 place count 81 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 53 place count 80 transition count 70
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 53 place count 80 transition count 68
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 57 place count 78 transition count 68
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 103 place count 55 transition count 45
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 115 place count 49 transition count 54
Applied a total of 115 rules in 17 ms. Remains 49 /108 variables (removed 59) and now considering 54/108 (removed 54) transitions.
// Phase 1: matrix 54 rows 49 cols
[2024-06-02 20:56:40] [INFO ] Computed 16 invariants in 1 ms
[2024-06-02 20:56:40] [INFO ] Implicit Places using invariants in 70 ms returned [25, 27, 29, 32, 42]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 71 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/108 places, 54/108 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 44 transition count 52
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 42 transition count 52
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 39 transition count 49
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 38 transition count 55
Applied a total of 12 rules in 6 ms. Remains 38 /44 variables (removed 6) and now considering 55/54 (removed -1) transitions.
// Phase 1: matrix 55 rows 38 cols
[2024-06-02 20:56:40] [INFO ] Computed 11 invariants in 0 ms
[2024-06-02 20:56:40] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-06-02 20:56:40] [INFO ] Invariant cache hit.
[2024-06-02 20:56:40] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-06-02 20:56:40] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 38/108 places, 55/108 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 232 ms. Remains : 38/108 places, 55/108 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-06-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s14 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-06-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-06-LTLFireability-13 finished in 285 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 4 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 108/108 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 107 transition count 108
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 100 transition count 101
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 100 transition count 101
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 99 transition count 100
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 99 transition count 100
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 98 transition count 99
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 98 transition count 99
Applied a total of 19 rules in 7 ms. Remains 98 /108 variables (removed 10) and now considering 99/108 (removed 9) transitions.
// Phase 1: matrix 99 rows 98 cols
[2024-06-02 20:56:40] [INFO ] Computed 17 invariants in 1 ms
[2024-06-02 20:56:41] [INFO ] Implicit Places using invariants in 80 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 81 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 97/108 places, 99/108 transitions.
Applied a total of 0 rules in 2 ms. Remains 97 /97 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 90 ms. Remains : 97/108 places, 99/108 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : MedleyA-PT-06-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(OR (EQ s14 0) (EQ s20 0) (EQ s25 0) (EQ s30 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 201 ms.
Product exploration explored 100000 steps with 33333 reset in 241 ms.
Computed a total of 9 stabilizing places and 9 stable transitions
Computed a total of 9 stabilizing places and 9 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 15 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-06-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-06-LTLFireability-14 finished in 700 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X((p0 U (G(p0)||X((!p1&&F(!p2)))))))))'
Support contains 5 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 108/108 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 107 transition count 108
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 97 transition count 87
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 97 transition count 87
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 96 transition count 86
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 96 transition count 86
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 95 transition count 85
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 95 transition count 85
Applied a total of 25 rules in 8 ms. Remains 95 /108 variables (removed 13) and now considering 85/108 (removed 23) transitions.
// Phase 1: matrix 85 rows 95 cols
[2024-06-02 20:56:41] [INFO ] Computed 17 invariants in 1 ms
[2024-06-02 20:56:41] [INFO ] Implicit Places using invariants in 69 ms returned [54]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 72 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 94/108 places, 85/108 transitions.
Applied a total of 0 rules in 0 ms. Remains 94 /94 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 83 ms. Remains : 94/108 places, 85/108 transitions.
Stuttering acceptance computed with spot in 311 ms :[true, p2, (OR p1 p2), (NOT p0), (NOT p0), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (AND p2 (NOT p0))]
Running random walk in product with property : MedleyA-PT-06-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p2, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 2}, { cond=p0, acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 2}, { cond=(AND p0 p1), acceptance={} source=6 dest: 6}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 1}, { cond=(AND p0 p2), acceptance={} source=7 dest: 7}]], initial=3, aps=[p2:(OR (AND (EQ s1 1) (EQ s18 1)) (EQ s45 1)), p1:(AND (EQ s5 1) (EQ s88 1)), p0:(NEQ s45 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, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 141 ms.
Product exploration explored 100000 steps with 25000 reset in 152 ms.
Computed a total of 9 stabilizing places and 9 stable transitions
Computed a total of 9 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 96 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 305 ms :[true, p2, (OR p1 p2), (AND p2 (NOT p0)), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1))]
Finished random walk after 3508 steps, including 92 resets, run visited all 9 properties in 9 ms. (steps per millisecond=389 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (AND p0 p2)), (F (AND (NOT p0) p2)), (F (AND p1 (NOT p0))), (F (AND (NOT p1) (NOT p0) p2)), (F p2), (F (AND (NOT p1) p2)), (F p1), (F (AND p1 p0)), (F (AND (NOT p1) p0 p2))]
Knowledge based reduction with 4 factoid took 466 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 323 ms :[true, p2, (OR p1 p2), (AND p2 (NOT p0)), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1))]
Stuttering acceptance computed with spot in 323 ms :[true, p2, (OR p1 p2), (AND p2 (NOT p0)), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1))]
Support contains 5 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 85/85 transitions.
Applied a total of 0 rules in 0 ms. Remains 94 /94 variables (removed 0) and now considering 85/85 (removed 0) transitions.
// Phase 1: matrix 85 rows 94 cols
[2024-06-02 20:56:43] [INFO ] Computed 16 invariants in 4 ms
[2024-06-02 20:56:43] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-02 20:56:43] [INFO ] Invariant cache hit.
[2024-06-02 20:56:44] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2024-06-02 20:56:44] [INFO ] Invariant cache hit.
[2024-06-02 20:56:44] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 372 ms. Remains : 94/94 places, 85/85 transitions.
Computed a total of 9 stabilizing places and 9 stable transitions
Computed a total of 9 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 105 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 322 ms :[true, p2, (OR p1 p2), (AND p2 (NOT p0)), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1))]
Finished random walk after 2942 steps, including 81 resets, run visited all 9 properties in 12 ms. (steps per millisecond=245 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), true]
False Knowledge obtained : [(F (AND p0 p2)), (F (AND (NOT p0) p2)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1) p2)), (F p2), (F (AND (NOT p1) p2)), (F p1), (F (AND p0 p1)), (F (AND p0 (NOT p1) p2))]
Knowledge based reduction with 2 factoid took 314 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 319 ms :[true, p2, (OR p1 p2), (AND p2 (NOT p0)), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1))]
Stuttering acceptance computed with spot in 320 ms :[true, p2, (OR p1 p2), (AND p2 (NOT p0)), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1))]
Stuttering acceptance computed with spot in 320 ms :[true, p2, (OR p1 p2), (AND p2 (NOT p0)), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1))]
Product exploration explored 100000 steps with 25000 reset in 125 ms.
Product exploration explored 100000 steps with 25000 reset in 139 ms.
Applying partial POR strategy [true, true, true, true, false, false, false, false]
Stuttering acceptance computed with spot in 311 ms :[true, p2, (OR p1 p2), (AND p2 (NOT p0)), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) p2) (AND (NOT p0) p1))]
Support contains 5 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 85/85 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 94 transition count 85
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 7 place count 94 transition count 89
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 15 place count 94 transition count 89
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 93 transition count 88
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 93 transition count 88
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 39 place count 93 transition count 88
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 92 transition count 87
Deduced a syphon composed of 35 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 92 transition count 87
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 45 place count 92 transition count 116
Deduced a syphon composed of 39 places in 0 ms
Applied a total of 45 rules in 11 ms. Remains 92 /94 variables (removed 2) and now considering 116/85 (removed -31) transitions.
[2024-06-02 20:56:46] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 116 rows 92 cols
[2024-06-02 20:56:46] [INFO ] Computed 16 invariants in 1 ms
[2024-06-02 20:56:46] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 92/94 places, 116/85 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 135 ms. Remains : 92/94 places, 116/85 transitions.
Built C files in :
/tmp/ltsmin10657791127590238187
[2024-06-02 20:56:46] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10657791127590238187
Running compilation step : cd /tmp/ltsmin10657791127590238187;'/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 250 ms.
Running link step : cd /tmp/ltsmin10657791127590238187;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin10657791127590238187;'/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/stateBased14709402929075665854.hoa' '--buchi-type=spotba'
LTSmin run took 242 ms.
FORMULA MedleyA-PT-06-LTLFireability-15 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-06-LTLFireability-15 finished in 5748 ms.
All properties solved by simple procedures.
Total runtime 30738 ms.

BK_STOP 1717361808533

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

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