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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 6.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K 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 56K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K 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 39K 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-13-LTLFireability-00
FORMULA_NAME MedleyA-PT-13-LTLFireability-01
FORMULA_NAME MedleyA-PT-13-LTLFireability-02
FORMULA_NAME MedleyA-PT-13-LTLFireability-03
FORMULA_NAME MedleyA-PT-13-LTLFireability-04
FORMULA_NAME MedleyA-PT-13-LTLFireability-05
FORMULA_NAME MedleyA-PT-13-LTLFireability-06
FORMULA_NAME MedleyA-PT-13-LTLFireability-07
FORMULA_NAME MedleyA-PT-13-LTLFireability-08
FORMULA_NAME MedleyA-PT-13-LTLFireability-09
FORMULA_NAME MedleyA-PT-13-LTLFireability-10
FORMULA_NAME MedleyA-PT-13-LTLFireability-11
FORMULA_NAME MedleyA-PT-13-LTLFireability-12
FORMULA_NAME MedleyA-PT-13-LTLFireability-13
FORMULA_NAME MedleyA-PT-13-LTLFireability-14
FORMULA_NAME MedleyA-PT-13-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717362591897

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-13
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-06-02 21:09:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 21:09:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:09:55] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2024-06-02 21:09:55] [INFO ] Transformed 173 places.
[2024-06-02 21:09:55] [INFO ] Transformed 159 transitions.
[2024-06-02 21:09:55] [INFO ] Found NUPN structural information;
[2024-06-02 21:09:55] [INFO ] Parsed PT model containing 173 places and 159 transitions and 401 arcs in 227 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA MedleyA-PT-13-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-13-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-13-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-13-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 159/159 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 168 transition count 159
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 16 place count 157 transition count 148
Iterating global reduction 1 with 11 rules applied. Total rules applied 27 place count 157 transition count 148
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 156 transition count 147
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 156 transition count 147
Applied a total of 29 rules in 61 ms. Remains 156 /173 variables (removed 17) and now considering 147/159 (removed 12) transitions.
// Phase 1: matrix 147 rows 156 cols
[2024-06-02 21:09:55] [INFO ] Computed 16 invariants in 14 ms
[2024-06-02 21:09:55] [INFO ] Implicit Places using invariants in 305 ms returned [33]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 356 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 155/173 places, 147/159 transitions.
Applied a total of 0 rules in 11 ms. Remains 155 /155 variables (removed 0) and now considering 147/147 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 429 ms. Remains : 155/173 places, 147/159 transitions.
Support contains 31 out of 155 places after structural reductions.
[2024-06-02 21:09:56] [INFO ] Flatten gal took : 54 ms
[2024-06-02 21:09:56] [INFO ] Flatten gal took : 23 ms
[2024-06-02 21:09:56] [INFO ] Input system was already deterministic with 147 transitions.
Incomplete random walk after 10000 steps, including 285 resets, run finished after 754 ms. (steps per millisecond=13 ) properties (out of 24) seen :16
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 72 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 70 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 8) seen :6
Running SMT prover for 2 properties.
// Phase 1: matrix 147 rows 155 cols
[2024-06-02 21:09:57] [INFO ] Computed 15 invariants in 7 ms
[2024-06-02 21:09:57] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 21:09:57] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2024-06-02 21:09:57] [INFO ] [Nat]Absence check using 9 positive and 6 generalized place invariants in 6 ms returned sat
[2024-06-02 21:09:57] [INFO ] After 122ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-06-02 21:09:58] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 8 ms to minimize.
[2024-06-02 21:09:58] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 1 ms to minimize.
[2024-06-02 21:09:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 254 ms
[2024-06-02 21:09:58] [INFO ] After 391ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2024-06-02 21:09:58] [INFO ] After 514ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 2 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 147/147 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 155 transition count 118
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 31 rules applied. Total rules applied 60 place count 126 transition count 116
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 61 place count 125 transition count 116
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 61 place count 125 transition count 88
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 117 place count 97 transition count 88
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 118 place count 96 transition count 88
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 125 place count 89 transition count 81
Iterating global reduction 4 with 7 rules applied. Total rules applied 132 place count 89 transition count 81
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 132 place count 89 transition count 78
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 138 place count 86 transition count 78
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 139 place count 85 transition count 77
Iterating global reduction 4 with 1 rules applied. Total rules applied 140 place count 85 transition count 77
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 141 place count 84 transition count 76
Iterating global reduction 4 with 1 rules applied. Total rules applied 142 place count 84 transition count 76
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 143 place count 83 transition count 75
Iterating global reduction 4 with 1 rules applied. Total rules applied 144 place count 83 transition count 75
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 192 place count 59 transition count 51
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 208 place count 51 transition count 67
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 209 place count 51 transition count 66
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 214 place count 51 transition count 61
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 219 place count 46 transition count 61
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 222 place count 46 transition count 58
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 225 place count 43 transition count 58
Applied a total of 225 rules in 98 ms. Remains 43 /155 variables (removed 112) and now considering 58/147 (removed 89) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 43/155 places, 58/147 transitions.
Finished random walk after 11 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 0 ms.
FORMULA MedleyA-PT-13-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 12 stabilizing places and 12 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' '!(F(G(p0)))'
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 155/155 places, 147/147 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 154 transition count 117
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 31 rules applied. Total rules applied 60 place count 125 transition count 115
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 61 place count 124 transition count 115
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 61 place count 124 transition count 87
Deduced a syphon composed of 28 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 57 rules applied. Total rules applied 118 place count 95 transition count 87
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 3 with 2 rules applied. Total rules applied 120 place count 94 transition count 86
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 121 place count 93 transition count 86
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 128 place count 86 transition count 79
Iterating global reduction 5 with 7 rules applied. Total rules applied 135 place count 86 transition count 79
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 135 place count 86 transition count 76
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 141 place count 83 transition count 76
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 142 place count 82 transition count 75
Iterating global reduction 5 with 1 rules applied. Total rules applied 143 place count 82 transition count 75
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 144 place count 81 transition count 74
Iterating global reduction 5 with 1 rules applied. Total rules applied 145 place count 81 transition count 74
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 146 place count 80 transition count 73
Iterating global reduction 5 with 1 rules applied. Total rules applied 147 place count 80 transition count 73
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 5 with 46 rules applied. Total rules applied 193 place count 57 transition count 50
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 209 place count 49 transition count 66
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 210 place count 49 transition count 65
Applied a total of 210 rules in 42 ms. Remains 49 /155 variables (removed 106) and now considering 65/147 (removed 82) transitions.
// Phase 1: matrix 65 rows 49 cols
[2024-06-02 21:09:58] [INFO ] Computed 13 invariants in 2 ms
[2024-06-02 21:09:58] [INFO ] Implicit Places using invariants in 96 ms returned [0, 9, 11, 18, 24, 27]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 99 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/155 places, 65/147 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 43 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 42 transition count 64
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2 place count 42 transition count 58
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 36 transition count 58
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 35 transition count 57
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 34 transition count 59
Applied a total of 18 rules in 11 ms. Remains 34 /43 variables (removed 9) and now considering 59/65 (removed 6) transitions.
// Phase 1: matrix 59 rows 34 cols
[2024-06-02 21:09:58] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 21:09:58] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-02 21:09:58] [INFO ] Invariant cache hit.
[2024-06-02 21:09:59] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-02 21:09:59] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 34/155 places, 59/147 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 307 ms. Remains : 34/155 places, 59/147 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 236 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-13-LTLFireability-00 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 s12 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 21316 reset in 367 ms.
Product exploration explored 100000 steps with 21335 reset in 285 ms.
Computed a total of 1 stabilizing places and 12 stable transitions
Computed a total of 1 stabilizing places and 12 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Finished random walk after 6941 steps, including 1483 resets, run visited all 1 properties in 30 ms. (steps per millisecond=231 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 207 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Support contains 1 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 59/59 transitions.
Applied a total of 0 rules in 3 ms. Remains 34 /34 variables (removed 0) and now considering 59/59 (removed 0) transitions.
[2024-06-02 21:10:00] [INFO ] Invariant cache hit.
[2024-06-02 21:10:00] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-02 21:10:00] [INFO ] Invariant cache hit.
[2024-06-02 21:10:00] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-02 21:10:00] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2024-06-02 21:10:00] [INFO ] Redundant transitions in 0 ms returned []
[2024-06-02 21:10:00] [INFO ] Invariant cache hit.
[2024-06-02 21:10:00] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 246 ms. Remains : 34/34 places, 59/59 transitions.
Computed a total of 1 stabilizing places and 12 stable transitions
Computed a total of 1 stabilizing places and 12 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Finished random walk after 552 steps, including 112 resets, run visited all 1 properties in 3 ms. (steps per millisecond=184 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Product exploration explored 100000 steps with 21293 reset in 164 ms.
Product exploration explored 100000 steps with 21361 reset in 391 ms.
Built C files in :
/tmp/ltsmin901941186890403435
[2024-06-02 21:10:01] [INFO ] Computing symmetric may disable matrix : 59 transitions.
[2024-06-02 21:10:01] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:10:01] [INFO ] Computing symmetric may enable matrix : 59 transitions.
[2024-06-02 21:10:01] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:10:01] [INFO ] Computing Do-Not-Accords matrix : 59 transitions.
[2024-06-02 21:10:01] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:10:01] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin901941186890403435
Running compilation step : cd /tmp/ltsmin901941186890403435;'/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 433 ms.
Running link step : cd /tmp/ltsmin901941186890403435;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin901941186890403435;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7754742036837562188.hoa' '--buchi-type=spotba'
LTSmin run took 129 ms.
FORMULA MedleyA-PT-13-LTLFireability-00 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-13-LTLFireability-00 finished in 3665 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 147/147 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 146 transition count 138
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 146 transition count 138
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 144 transition count 136
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 144 transition count 136
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 143 transition count 135
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 143 transition count 135
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 142 transition count 134
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 142 transition count 134
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 141 transition count 133
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 141 transition count 133
Applied a total of 28 rules in 21 ms. Remains 141 /155 variables (removed 14) and now considering 133/147 (removed 14) transitions.
// Phase 1: matrix 133 rows 141 cols
[2024-06-02 21:10:02] [INFO ] Computed 15 invariants in 7 ms
[2024-06-02 21:10:02] [INFO ] Implicit Places using invariants in 97 ms returned [34]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 98 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 140/155 places, 133/147 transitions.
Applied a total of 0 rules in 4 ms. Remains 140 /140 variables (removed 0) and now considering 133/133 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 126 ms. Remains : 140/155 places, 133/147 transitions.
Stuttering acceptance computed with spot in 171 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-13-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(AND (EQ s13 1) (EQ s41 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-13-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-13-LTLFireability-02 finished in 315 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G((p0||F(p1)))||((p0||F(p1))&&F(G(p2)))))))'
Support contains 4 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 147/147 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 147 transition count 139
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 147 transition count 139
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 146 transition count 138
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 146 transition count 138
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 145 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 145 transition count 137
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 144 transition count 136
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 144 transition count 136
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 143 transition count 135
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 143 transition count 135
Applied a total of 24 rules in 20 ms. Remains 143 /155 variables (removed 12) and now considering 135/147 (removed 12) transitions.
// Phase 1: matrix 135 rows 143 cols
[2024-06-02 21:10:02] [INFO ] Computed 15 invariants in 2 ms
[2024-06-02 21:10:02] [INFO ] Implicit Places using invariants in 89 ms returned [36]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 90 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 142/155 places, 135/147 transitions.
Applied a total of 0 rules in 3 ms. Remains 142 /142 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 114 ms. Remains : 142/155 places, 135/147 transitions.
Stuttering acceptance computed with spot in 247 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-13-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=4, aps=[p0:(NEQ s128 1), p1:(NEQ s18 1), p2:(AND (EQ s1 1) (EQ s27 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2846 reset in 206 ms.
Product exploration explored 100000 steps with 2847 reset in 228 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 p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 132 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 288 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 135 rows 142 cols
[2024-06-02 21:10:04] [INFO ] Computed 14 invariants in 3 ms
[2024-06-02 21:10:04] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-06-02 21:10:04] [INFO ] [Real]Absence check using 9 positive and 5 generalized place invariants in 4 ms returned sat
[2024-06-02 21:10:04] [INFO ] After 192ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:2
[2024-06-02 21:10:04] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-06-02 21:10:04] [INFO ] [Nat]Absence check using 9 positive and 5 generalized place invariants in 8 ms returned sat
[2024-06-02 21:10:04] [INFO ] After 516ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2024-06-02 21:10:04] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 3 ms to minimize.
[2024-06-02 21:10:05] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2024-06-02 21:10:05] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2024-06-02 21:10:05] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 266 ms
[2024-06-02 21:10:05] [INFO ] After 793ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :0
[2024-06-02 21:10:05] [INFO ] After 884ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p1) p2))), (G (NOT (AND (NOT p0) (NOT p1)))), (G (NOT (AND p0 (NOT p1) p2)))]
False Knowledge obtained : [(F (AND p0 (NOT p1) (NOT p2)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 20 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-13-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-13-LTLFireability-04 finished in 2479 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(p1))))'
Support contains 3 out of 155 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 155/155 places, 147/147 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 154 transition count 117
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 31 rules applied. Total rules applied 60 place count 125 transition count 115
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 61 place count 124 transition count 115
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 61 place count 124 transition count 88
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 115 place count 97 transition count 88
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 116 place count 96 transition count 88
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 123 place count 89 transition count 81
Iterating global reduction 4 with 7 rules applied. Total rules applied 130 place count 89 transition count 81
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 130 place count 89 transition count 78
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 136 place count 86 transition count 78
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 137 place count 85 transition count 77
Iterating global reduction 4 with 1 rules applied. Total rules applied 138 place count 85 transition count 77
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 139 place count 84 transition count 76
Iterating global reduction 4 with 1 rules applied. Total rules applied 140 place count 84 transition count 76
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 141 place count 83 transition count 75
Iterating global reduction 4 with 1 rules applied. Total rules applied 142 place count 83 transition count 75
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 188 place count 60 transition count 52
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 204 place count 52 transition count 68
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 205 place count 52 transition count 67
Applied a total of 205 rules in 43 ms. Remains 52 /155 variables (removed 103) and now considering 67/147 (removed 80) transitions.
// Phase 1: matrix 67 rows 52 cols
[2024-06-02 21:10:05] [INFO ] Computed 14 invariants in 1 ms
[2024-06-02 21:10:05] [INFO ] Implicit Places using invariants in 67 ms returned [0, 9, 11, 18, 22, 25]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 68 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/155 places, 67/147 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 46 transition count 66
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 45 transition count 66
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 2 place count 45 transition count 61
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 12 place count 40 transition count 61
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 2 with 4 rules applied. Total rules applied 16 place count 38 transition count 63
Applied a total of 16 rules in 8 ms. Remains 38 /46 variables (removed 8) and now considering 63/67 (removed 4) transitions.
// Phase 1: matrix 63 rows 38 cols
[2024-06-02 21:10:05] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 21:10:05] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-02 21:10:05] [INFO ] Invariant cache hit.
[2024-06-02 21:10:05] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-02 21:10:05] [INFO ] Implicit Places using invariants and state equation in 80 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 : 38/155 places, 63/147 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 263 ms. Remains : 38/155 places, 63/147 transitions.
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-13-LTLFireability-05 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=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s26 0) (EQ s35 0)), p1:(NEQ s32 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 20936 reset in 377 ms.
Product exploration explored 100000 steps with 20882 reset in 153 ms.
Computed a total of 1 stabilizing places and 12 stable transitions
Computed a total of 1 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 97 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 240 steps, including 48 resets, run visited all 2 properties in 2 ms. (steps per millisecond=120 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 164 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 3 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 63/63 transitions.
Applied a total of 0 rules in 4 ms. Remains 38 /38 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-06-02 21:10:06] [INFO ] Invariant cache hit.
[2024-06-02 21:10:06] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-02 21:10:06] [INFO ] Invariant cache hit.
[2024-06-02 21:10:07] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-02 21:10:07] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2024-06-02 21:10:07] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 21:10:07] [INFO ] Invariant cache hit.
[2024-06-02 21:10:07] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 253 ms. Remains : 38/38 places, 63/63 transitions.
Computed a total of 1 stabilizing places and 12 stable transitions
Computed a total of 1 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 95 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 160 steps, including 34 resets, run visited all 2 properties in 1 ms. (steps per millisecond=160 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 157 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 20978 reset in 159 ms.
Product exploration explored 100000 steps with 20935 reset in 157 ms.
Built C files in :
/tmp/ltsmin18301269887130330744
[2024-06-02 21:10:08] [INFO ] Computing symmetric may disable matrix : 63 transitions.
[2024-06-02 21:10:08] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:10:08] [INFO ] Computing symmetric may enable matrix : 63 transitions.
[2024-06-02 21:10:08] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:10:08] [INFO ] Computing Do-Not-Accords matrix : 63 transitions.
[2024-06-02 21:10:08] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:10:08] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18301269887130330744
Running compilation step : cd /tmp/ltsmin18301269887130330744;'/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 240 ms.
Running link step : cd /tmp/ltsmin18301269887130330744;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin18301269887130330744;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6486073915411168122.hoa' '--buchi-type=spotba'
LTSmin run took 137 ms.
FORMULA MedleyA-PT-13-LTLFireability-05 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-13-LTLFireability-05 finished in 3549 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 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 155/155 places, 147/147 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 154 transition count 116
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 62 place count 124 transition count 114
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 123 transition count 114
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 63 place count 123 transition count 85
Deduced a syphon composed of 29 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 59 rules applied. Total rules applied 122 place count 93 transition count 85
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 3 with 2 rules applied. Total rules applied 124 place count 92 transition count 84
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 125 place count 91 transition count 84
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 131 place count 85 transition count 78
Iterating global reduction 5 with 6 rules applied. Total rules applied 137 place count 85 transition count 78
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 137 place count 85 transition count 76
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 141 place count 83 transition count 76
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 142 place count 82 transition count 75
Iterating global reduction 5 with 1 rules applied. Total rules applied 143 place count 82 transition count 75
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 144 place count 81 transition count 74
Iterating global reduction 5 with 1 rules applied. Total rules applied 145 place count 81 transition count 74
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 146 place count 80 transition count 73
Iterating global reduction 5 with 1 rules applied. Total rules applied 147 place count 80 transition count 73
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 195 place count 56 transition count 49
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 211 place count 48 transition count 65
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 212 place count 48 transition count 64
Applied a total of 212 rules in 27 ms. Remains 48 /155 variables (removed 107) and now considering 64/147 (removed 83) transitions.
// Phase 1: matrix 64 rows 48 cols
[2024-06-02 21:10:08] [INFO ] Computed 13 invariants in 1 ms
[2024-06-02 21:10:08] [INFO ] Implicit Places using invariants in 112 ms returned [0, 9, 11, 18, 22, 25]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 113 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/155 places, 64/147 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 42 transition count 63
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 41 transition count 63
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2 place count 41 transition count 57
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 35 transition count 57
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 2 with 4 rules applied. Total rules applied 18 place count 33 transition count 59
Applied a total of 18 rules in 8 ms. Remains 33 /42 variables (removed 9) and now considering 59/64 (removed 5) transitions.
// Phase 1: matrix 59 rows 33 cols
[2024-06-02 21:10:08] [INFO ] Computed 7 invariants in 0 ms
[2024-06-02 21:10:08] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-02 21:10:08] [INFO ] Invariant cache hit.
[2024-06-02 21:10:08] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-02 21:10:08] [INFO ] Implicit Places using invariants and state equation in 72 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 : 33/155 places, 59/147 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 271 ms. Remains : 33/155 places, 59/147 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-13-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s29 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 3 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-13-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-13-LTLFireability-07 finished in 328 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 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 155/155 places, 147/147 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 154 transition count 116
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 62 place count 124 transition count 114
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 123 transition count 114
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 63 place count 123 transition count 85
Deduced a syphon composed of 29 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 59 rules applied. Total rules applied 122 place count 93 transition count 85
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 3 with 2 rules applied. Total rules applied 124 place count 92 transition count 84
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 125 place count 91 transition count 84
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 131 place count 85 transition count 78
Iterating global reduction 5 with 6 rules applied. Total rules applied 137 place count 85 transition count 78
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 137 place count 85 transition count 76
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 141 place count 83 transition count 76
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 142 place count 82 transition count 75
Iterating global reduction 5 with 1 rules applied. Total rules applied 143 place count 82 transition count 75
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 144 place count 81 transition count 74
Iterating global reduction 5 with 1 rules applied. Total rules applied 145 place count 81 transition count 74
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 146 place count 80 transition count 73
Iterating global reduction 5 with 1 rules applied. Total rules applied 147 place count 80 transition count 73
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 5 with 46 rules applied. Total rules applied 193 place count 57 transition count 50
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 209 place count 49 transition count 66
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 210 place count 49 transition count 65
Applied a total of 210 rules in 29 ms. Remains 49 /155 variables (removed 106) and now considering 65/147 (removed 82) transitions.
// Phase 1: matrix 65 rows 49 cols
[2024-06-02 21:10:09] [INFO ] Computed 13 invariants in 1 ms
[2024-06-02 21:10:09] [INFO ] Implicit Places using invariants in 65 ms returned [0, 9, 11, 18, 22, 25]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 66 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/155 places, 65/147 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 43 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 42 transition count 64
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2 place count 42 transition count 58
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 36 transition count 58
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 2 with 4 rules applied. Total rules applied 18 place count 34 transition count 60
Applied a total of 18 rules in 6 ms. Remains 34 /43 variables (removed 9) and now considering 60/65 (removed 5) transitions.
// Phase 1: matrix 60 rows 34 cols
[2024-06-02 21:10:09] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 21:10:09] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-06-02 21:10:09] [INFO ] Invariant cache hit.
[2024-06-02 21:10:09] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-02 21:10:09] [INFO ] Implicit Places using invariants and state equation in 76 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 : 34/155 places, 60/147 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 225 ms. Remains : 34/155 places, 60/147 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-13-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s29 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]]
Product exploration explored 100000 steps with 30824 reset in 147 ms.
Product exploration explored 100000 steps with 30752 reset in 176 ms.
Computed a total of 3 stabilizing places and 14 stable transitions
Computed a total of 3 stabilizing places and 14 stable transitions
Detected a total of 3/34 stabilizing places and 14/60 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 163 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 182 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
[2024-06-02 21:10:10] [INFO ] Invariant cache hit.
[2024-06-02 21:10:10] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-02 21:10:10] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-02 21:10:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:10:10] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-06-02 21:10:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:10:10] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-02 21:10:10] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-02 21:10:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:10:10] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-06-02 21:10:10] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-02 21:10:10] [INFO ] [Nat]Added 5 Read/Feed constraints in 6 ms returned sat
[2024-06-02 21:10:10] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-06-02 21:10:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2024-06-02 21:10:10] [INFO ] Computed and/alt/rep : 20/80/20 causal constraints (skipped 28 transitions) in 8 ms.
[2024-06-02 21:10:10] [INFO ] Added : 3 causal constraints over 1 iterations in 24 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 60/60 transitions.
Applied a total of 0 rules in 3 ms. Remains 34 /34 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2024-06-02 21:10:10] [INFO ] Invariant cache hit.
[2024-06-02 21:10:10] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-02 21:10:10] [INFO ] Invariant cache hit.
[2024-06-02 21:10:10] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-02 21:10:10] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2024-06-02 21:10:10] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 21:10:10] [INFO ] Invariant cache hit.
[2024-06-02 21:10:10] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 214 ms. Remains : 34/34 places, 60/60 transitions.
Computed a total of 3 stabilizing places and 14 stable transitions
Computed a total of 3 stabilizing places and 14 stable transitions
Detected a total of 3/34 stabilizing places and 14/60 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 330 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 192 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
[2024-06-02 21:10:11] [INFO ] Invariant cache hit.
[2024-06-02 21:10:11] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-02 21:10:11] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-02 21:10:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:10:11] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-06-02 21:10:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:10:11] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-02 21:10:11] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-02 21:10:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:10:11] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-06-02 21:10:11] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-02 21:10:11] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2024-06-02 21:10:11] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2024-06-02 21:10:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2024-06-02 21:10:11] [INFO ] Computed and/alt/rep : 20/80/20 causal constraints (skipped 28 transitions) in 6 ms.
[2024-06-02 21:10:11] [INFO ] Added : 3 causal constraints over 1 iterations in 21 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Product exploration explored 100000 steps with 30815 reset in 154 ms.
Product exploration explored 100000 steps with 30765 reset in 170 ms.
Built C files in :
/tmp/ltsmin13373560500248472567
[2024-06-02 21:10:11] [INFO ] Computing symmetric may disable matrix : 60 transitions.
[2024-06-02 21:10:11] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:10:11] [INFO ] Computing symmetric may enable matrix : 60 transitions.
[2024-06-02 21:10:11] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:10:11] [INFO ] Computing Do-Not-Accords matrix : 60 transitions.
[2024-06-02 21:10:11] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:10:11] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13373560500248472567
Running compilation step : cd /tmp/ltsmin13373560500248472567;'/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 223 ms.
Running link step : cd /tmp/ltsmin13373560500248472567;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin13373560500248472567;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11846635201799680397.hoa' '--buchi-type=spotba'
LTSmin run took 60 ms.
FORMULA MedleyA-PT-13-LTLFireability-08 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-13-LTLFireability-08 finished in 3176 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X((X(X(((p1 U p2)&&G(p1)))) U (p0&&X(X(((p1 U p2)&&G(p1))))))))))'
Support contains 1 out of 155 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 155/155 places, 147/147 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 154 transition count 117
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 31 rules applied. Total rules applied 60 place count 125 transition count 115
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 61 place count 124 transition count 115
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 61 place count 124 transition count 87
Deduced a syphon composed of 28 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 57 rules applied. Total rules applied 118 place count 95 transition count 87
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 3 with 2 rules applied. Total rules applied 120 place count 94 transition count 86
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 121 place count 93 transition count 86
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 127 place count 87 transition count 80
Iterating global reduction 5 with 6 rules applied. Total rules applied 133 place count 87 transition count 80
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 133 place count 87 transition count 78
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 137 place count 85 transition count 78
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 138 place count 84 transition count 77
Iterating global reduction 5 with 1 rules applied. Total rules applied 139 place count 84 transition count 77
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 140 place count 83 transition count 76
Iterating global reduction 5 with 1 rules applied. Total rules applied 141 place count 83 transition count 76
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 142 place count 82 transition count 75
Iterating global reduction 5 with 1 rules applied. Total rules applied 143 place count 82 transition count 75
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 5 with 44 rules applied. Total rules applied 187 place count 60 transition count 53
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 203 place count 52 transition count 69
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 204 place count 52 transition count 68
Applied a total of 204 rules in 21 ms. Remains 52 /155 variables (removed 103) and now considering 68/147 (removed 79) transitions.
// Phase 1: matrix 68 rows 52 cols
[2024-06-02 21:10:12] [INFO ] Computed 13 invariants in 1 ms
[2024-06-02 21:10:12] [INFO ] Implicit Places using invariants in 64 ms returned [0, 11, 13, 20, 24, 27]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 65 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/155 places, 68/147 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 46 transition count 67
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 45 transition count 67
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2 place count 45 transition count 61
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 39 transition count 61
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 2 with 4 rules applied. Total rules applied 18 place count 37 transition count 63
Applied a total of 18 rules in 4 ms. Remains 37 /46 variables (removed 9) and now considering 63/68 (removed 5) transitions.
// Phase 1: matrix 63 rows 37 cols
[2024-06-02 21:10:12] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 21:10:12] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-06-02 21:10:12] [INFO ] Invariant cache hit.
[2024-06-02 21:10:12] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-02 21:10:12] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 37/155 places, 63/147 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 218 ms. Remains : 37/155 places, 63/147 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-13-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s31 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]]
Product exploration explored 100000 steps with 30718 reset in 154 ms.
Product exploration explored 100000 steps with 30765 reset in 167 ms.
Computed a total of 3 stabilizing places and 14 stable transitions
Computed a total of 3 stabilizing places and 14 stable transitions
Detected a total of 3/37 stabilizing places and 14/63 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 149 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 199 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
[2024-06-02 21:10:13] [INFO ] Invariant cache hit.
[2024-06-02 21:10:13] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-02 21:10:13] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-02 21:10:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:10:13] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-06-02 21:10:13] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:10:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-02 21:10:13] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-02 21:10:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:10:13] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-06-02 21:10:13] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-02 21:10:13] [INFO ] [Nat]Added 5 Read/Feed constraints in 3 ms returned sat
[2024-06-02 21:10:13] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-06-02 21:10:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2024-06-02 21:10:13] [INFO ] Computed and/alt/rep : 23/66/23 causal constraints (skipped 28 transitions) in 7 ms.
[2024-06-02 21:10:13] [INFO ] Added : 0 causal constraints over 0 iterations in 18 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 37 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 37 /37 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-06-02 21:10:13] [INFO ] Invariant cache hit.
[2024-06-02 21:10:13] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-02 21:10:13] [INFO ] Invariant cache hit.
[2024-06-02 21:10:13] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-02 21:10:13] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2024-06-02 21:10:13] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 21:10:13] [INFO ] Invariant cache hit.
[2024-06-02 21:10:13] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 207 ms. Remains : 37/37 places, 63/63 transitions.
Computed a total of 3 stabilizing places and 14 stable transitions
Computed a total of 3 stabilizing places and 14 stable transitions
Detected a total of 3/37 stabilizing places and 14/63 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 180 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 3 factoid took 192 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
[2024-06-02 21:10:14] [INFO ] Invariant cache hit.
[2024-06-02 21:10:14] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-02 21:10:14] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 3 ms returned sat
[2024-06-02 21:10:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:10:14] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-06-02 21:10:14] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:10:14] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-02 21:10:14] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 11 ms returned sat
[2024-06-02 21:10:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:10:14] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-06-02 21:10:14] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-02 21:10:14] [INFO ] [Nat]Added 5 Read/Feed constraints in 3 ms returned sat
[2024-06-02 21:10:14] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
[2024-06-02 21:10:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2024-06-02 21:10:14] [INFO ] Computed and/alt/rep : 23/66/23 causal constraints (skipped 28 transitions) in 8 ms.
[2024-06-02 21:10:14] [INFO ] Added : 0 causal constraints over 0 iterations in 17 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Product exploration explored 100000 steps with 30784 reset in 157 ms.
Product exploration explored 100000 steps with 30739 reset in 170 ms.
Built C files in :
/tmp/ltsmin4450858670968437950
[2024-06-02 21:10:15] [INFO ] Computing symmetric may disable matrix : 63 transitions.
[2024-06-02 21:10:15] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:10:15] [INFO ] Computing symmetric may enable matrix : 63 transitions.
[2024-06-02 21:10:15] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:10:15] [INFO ] Computing Do-Not-Accords matrix : 63 transitions.
[2024-06-02 21:10:15] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:10:15] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4450858670968437950
Running compilation step : cd /tmp/ltsmin4450858670968437950;'/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 263 ms.
Running link step : cd /tmp/ltsmin4450858670968437950;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin4450858670968437950;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14607368475666035844.hoa' '--buchi-type=spotba'
LTSmin run took 176 ms.
FORMULA MedleyA-PT-13-LTLFireability-09 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-13-LTLFireability-09 finished in 3300 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(G(p1))))'
Support contains 3 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 147/147 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 145 transition count 137
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 145 transition count 137
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 143 transition count 135
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 143 transition count 135
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 142 transition count 134
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 142 transition count 134
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 141 transition count 133
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 141 transition count 133
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 140 transition count 132
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 140 transition count 132
Applied a total of 30 rules in 11 ms. Remains 140 /155 variables (removed 15) and now considering 132/147 (removed 15) transitions.
// Phase 1: matrix 132 rows 140 cols
[2024-06-02 21:10:15] [INFO ] Computed 15 invariants in 2 ms
[2024-06-02 21:10:15] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-06-02 21:10:15] [INFO ] Invariant cache hit.
[2024-06-02 21:10:15] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
[2024-06-02 21:10:15] [INFO ] Invariant cache hit.
[2024-06-02 21:10:15] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 140/155 places, 132/147 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 466 ms. Remains : 140/155 places, 132/147 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-13-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s34 1) (EQ s90 1)), p1:(EQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-13-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-13-LTLFireability-11 finished in 603 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||(p1&&G(p2)))))'
Support contains 4 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 147/147 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 148 transition count 140
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 148 transition count 140
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 147 transition count 139
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 147 transition count 139
Applied a total of 16 rules in 6 ms. Remains 147 /155 variables (removed 8) and now considering 139/147 (removed 8) transitions.
// Phase 1: matrix 139 rows 147 cols
[2024-06-02 21:10:16] [INFO ] Computed 15 invariants in 2 ms
[2024-06-02 21:10:16] [INFO ] Implicit Places using invariants in 98 ms returned [35]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 99 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 146/155 places, 139/147 transitions.
Applied a total of 0 rules in 1 ms. Remains 146 /146 variables (removed 0) and now considering 139/139 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 108 ms. Remains : 146/155 places, 139/147 transitions.
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : MedleyA-PT-13-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (EQ s87 0) (EQ s3 1)), p1:(EQ s95 0), p2:(EQ s45 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 237 ms.
Product exploration explored 100000 steps with 50000 reset in 235 ms.
Computed a total of 10 stabilizing places and 10 stable transitions
Computed a total of 10 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 20 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-13-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-13-LTLFireability-12 finished in 807 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||(p1&&F(p2)))))))'
Support contains 2 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 147/147 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 145 transition count 137
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 145 transition count 137
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 143 transition count 135
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 143 transition count 135
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 142 transition count 134
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 142 transition count 134
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 141 transition count 133
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 141 transition count 133
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 140 transition count 132
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 140 transition count 132
Applied a total of 30 rules in 18 ms. Remains 140 /155 variables (removed 15) and now considering 132/147 (removed 15) transitions.
// Phase 1: matrix 132 rows 140 cols
[2024-06-02 21:10:16] [INFO ] Computed 15 invariants in 2 ms
[2024-06-02 21:10:17] [INFO ] Implicit Places using invariants in 338 ms returned [34]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 349 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 139/155 places, 132/147 transitions.
Applied a total of 0 rules in 2 ms. Remains 139 /139 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 372 ms. Remains : 139/155 places, 132/147 transitions.
Stuttering acceptance computed with spot in 243 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2)]
Running random walk in product with property : MedleyA-PT-13-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s129 1), p1:(EQ s129 0), p2:(EQ s101 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2900 reset in 225 ms.
Product exploration explored 100000 steps with 2900 reset in 274 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 p0) p1 p2), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 105 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2)]
Incomplete random walk after 10000 steps, including 290 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 73 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 132 rows 139 cols
[2024-06-02 21:10:18] [INFO ] Computed 14 invariants in 1 ms
[2024-06-02 21:10:18] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2024-06-02 21:10:18] [INFO ] [Real]Absence check using 9 positive and 5 generalized place invariants in 4 ms returned sat
[2024-06-02 21:10:18] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 21:10:18] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2024-06-02 21:10:18] [INFO ] [Nat]Absence check using 9 positive and 5 generalized place invariants in 5 ms returned sat
[2024-06-02 21:10:18] [INFO ] After 69ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (G (OR p0 p1)), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT p2)), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 6 factoid took 179 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2)]
Support contains 2 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 132/132 transitions.
Applied a total of 0 rules in 2 ms. Remains 139 /139 variables (removed 0) and now considering 132/132 (removed 0) transitions.
[2024-06-02 21:10:19] [INFO ] Invariant cache hit.
[2024-06-02 21:10:19] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-02 21:10:19] [INFO ] Invariant cache hit.
[2024-06-02 21:10:19] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
[2024-06-02 21:10:19] [INFO ] Invariant cache hit.
[2024-06-02 21:10:19] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 403 ms. Remains : 139/139 places, 132/132 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 p0) p2), true, (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 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 172 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2)]
Finished random walk after 290 steps, including 6 resets, run visited all 2 properties in 1 ms. (steps per millisecond=290 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p2), true, (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (NOT p2))]
Knowledge based reduction with 3 factoid took 135 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 161 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 2923 reset in 120 ms.
Product exploration explored 100000 steps with 2867 reset in 143 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2)]
Support contains 2 out of 139 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 139/139 places, 132/132 transitions.
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 139 transition count 132
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 27 place count 139 transition count 131
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 27 place count 139 transition count 137
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 2 with 25 rules applied. Total rules applied 52 place count 139 transition count 137
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 64 place count 127 transition count 125
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 76 place count 127 transition count 125
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 2 with 28 rules applied. Total rules applied 104 place count 127 transition count 126
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 112 place count 119 transition count 118
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 2 with 8 rules applied. Total rules applied 120 place count 119 transition count 118
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -56
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 2 with 8 rules applied. Total rules applied 128 place count 119 transition count 174
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 133 place count 114 transition count 163
Deduced a syphon composed of 62 places in 0 ms
Iterating global reduction 2 with 5 rules applied. Total rules applied 138 place count 114 transition count 163
Deduced a syphon composed of 62 places in 0 ms
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 140 place count 114 transition count 161
Deduced a syphon composed of 62 places in 0 ms
Applied a total of 140 rules in 33 ms. Remains 114 /139 variables (removed 25) and now considering 161/132 (removed -29) transitions.
[2024-06-02 21:10:21] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 161 rows 114 cols
[2024-06-02 21:10:21] [INFO ] Computed 14 invariants in 1 ms
[2024-06-02 21:10:21] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 114/139 places, 161/132 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 194 ms. Remains : 114/139 places, 161/132 transitions.
Built C files in :
/tmp/ltsmin4156603637669610700
[2024-06-02 21:10:21] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4156603637669610700
Running compilation step : cd /tmp/ltsmin4156603637669610700;'/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 325 ms.
Running link step : cd /tmp/ltsmin4156603637669610700;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin4156603637669610700;'/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/stateBased1118039838207875205.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 132/132 transitions.
Applied a total of 0 rules in 3 ms. Remains 139 /139 variables (removed 0) and now considering 132/132 (removed 0) transitions.
// Phase 1: matrix 132 rows 139 cols
[2024-06-02 21:10:36] [INFO ] Computed 14 invariants in 1 ms
[2024-06-02 21:10:36] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-06-02 21:10:36] [INFO ] Invariant cache hit.
[2024-06-02 21:10:37] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
[2024-06-02 21:10:37] [INFO ] Invariant cache hit.
[2024-06-02 21:10:37] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 429 ms. Remains : 139/139 places, 132/132 transitions.
Built C files in :
/tmp/ltsmin8971461796174636126
[2024-06-02 21:10:37] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8971461796174636126
Running compilation step : cd /tmp/ltsmin8971461796174636126;'/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 336 ms.
Running link step : cd /tmp/ltsmin8971461796174636126;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin8971461796174636126;'/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/stateBased18025317416834871683.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-06-02 21:10:52] [INFO ] Flatten gal took : 12 ms
[2024-06-02 21:10:52] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:10:52] [INFO ] Time to serialize gal into /tmp/LTL13152451093262294504.gal : 5 ms
[2024-06-02 21:10:52] [INFO ] Time to serialize properties into /tmp/LTL12864968673165584067.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13152451093262294504.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15689300171804546425.hoa' '-atoms' '/tmp/LTL12864968673165584067.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL12864968673165584067.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15689300171804546425.hoa
Reverse transition relation is NOT exact ! Due to transitions t3, t22, t37, t39, t47, t52, t59, t62, t65, t68, t70, t84, t87, t98, Intersection with reach...231
Computing Next relation with stutter on 168 deadlock states
123 unique states visited
0 strongly connected components in search stack
222 transitions explored
113 items max in DFS search stack
196 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.01114,60896,1,0,520,173123,299,452,3921,209715,1592
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA MedleyA-PT-13-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property MedleyA-PT-13-LTLFireability-14 finished in 37735 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(p0)&&(F(G(p1)) U p2))))'
Support contains 4 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 147/147 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 145 transition count 137
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 145 transition count 137
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 143 transition count 135
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 143 transition count 135
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 142 transition count 134
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 142 transition count 134
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 141 transition count 133
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 141 transition count 133
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 140 transition count 132
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 140 transition count 132
Applied a total of 30 rules in 18 ms. Remains 140 /155 variables (removed 15) and now considering 132/147 (removed 15) transitions.
// Phase 1: matrix 132 rows 140 cols
[2024-06-02 21:10:54] [INFO ] Computed 15 invariants in 1 ms
[2024-06-02 21:10:54] [INFO ] Implicit Places using invariants in 97 ms returned [34]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 99 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 139/155 places, 132/147 transitions.
Applied a total of 0 rules in 4 ms. Remains 139 /139 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 124 ms. Remains : 139/155 places, 132/147 transitions.
Stuttering acceptance computed with spot in 368 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), true]
Running random walk in product with property : MedleyA-PT-13-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s90 1) (EQ s111 1)), p0:(EQ s69 1), p1:(EQ s88 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 48 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-13-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-13-LTLFireability-15 finished in 517 ms.
All properties solved by simple procedures.
Total runtime 60352 ms.

BK_STOP 1717362657098

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

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