fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r571-tall-171734910400182
Last Updated
July 7, 2024

About the Execution of 2023-gold for FireWire-PT-16

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
437.220 30480.00 58407.00 475.00 FFTFFFFFTTTFFFFF normal

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.r571-tall-171734910400182.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 FireWire-PT-16, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r571-tall-171734910400182
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 8.1K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.3K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 113K 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 84K 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 FireWire-PT-16-LTLCardinality-00
FORMULA_NAME FireWire-PT-16-LTLCardinality-01
FORMULA_NAME FireWire-PT-16-LTLCardinality-02
FORMULA_NAME FireWire-PT-16-LTLCardinality-03
FORMULA_NAME FireWire-PT-16-LTLCardinality-04
FORMULA_NAME FireWire-PT-16-LTLCardinality-05
FORMULA_NAME FireWire-PT-16-LTLCardinality-06
FORMULA_NAME FireWire-PT-16-LTLCardinality-07
FORMULA_NAME FireWire-PT-16-LTLCardinality-08
FORMULA_NAME FireWire-PT-16-LTLCardinality-09
FORMULA_NAME FireWire-PT-16-LTLCardinality-10
FORMULA_NAME FireWire-PT-16-LTLCardinality-11
FORMULA_NAME FireWire-PT-16-LTLCardinality-12
FORMULA_NAME FireWire-PT-16-LTLCardinality-13
FORMULA_NAME FireWire-PT-16-LTLCardinality-14
FORMULA_NAME FireWire-PT-16-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717370479923

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-16
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-06-02 23:21:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 23:21:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 23:21:21] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2024-06-02 23:21:21] [INFO ] Transformed 254 places.
[2024-06-02 23:21:21] [INFO ] Transformed 368 transitions.
[2024-06-02 23:21:21] [INFO ] Found NUPN structural information;
[2024-06-02 23:21:21] [INFO ] Parsed PT model containing 254 places and 368 transitions and 1032 arcs in 127 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA FireWire-PT-16-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-16-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-16-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-16-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-16-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-16-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-16-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 368/368 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 251 transition count 368
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 51 place count 203 transition count 320
Iterating global reduction 1 with 48 rules applied. Total rules applied 99 place count 203 transition count 320
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 112 place count 190 transition count 295
Iterating global reduction 1 with 13 rules applied. Total rules applied 125 place count 190 transition count 295
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 126 place count 190 transition count 294
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 127 place count 189 transition count 293
Iterating global reduction 2 with 1 rules applied. Total rules applied 128 place count 189 transition count 293
Applied a total of 128 rules in 50 ms. Remains 189 /254 variables (removed 65) and now considering 293/368 (removed 75) transitions.
// Phase 1: matrix 293 rows 189 cols
[2024-06-02 23:21:21] [INFO ] Computed 4 invariants in 25 ms
[2024-06-02 23:21:22] [INFO ] Implicit Places using invariants in 582 ms returned []
[2024-06-02 23:21:22] [INFO ] Invariant cache hit.
[2024-06-02 23:21:22] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 779 ms to find 0 implicit places.
[2024-06-02 23:21:22] [INFO ] Invariant cache hit.
[2024-06-02 23:21:22] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 189/254 places, 293/368 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 980 ms. Remains : 189/254 places, 293/368 transitions.
Support contains 23 out of 189 places after structural reductions.
[2024-06-02 23:21:22] [INFO ] Flatten gal took : 46 ms
[2024-06-02 23:21:22] [INFO ] Flatten gal took : 19 ms
[2024-06-02 23:21:22] [INFO ] Input system was already deterministic with 293 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 354 ms. (steps per millisecond=28 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2024-06-02 23:21:25] [INFO ] Invariant cache hit.
[2024-06-02 23:21:25] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-06-02 23:21:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 23:21:25] [INFO ] After 192ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2024-06-02 23:21:25] [INFO ] Deduced a trap composed of 69 places in 75 ms of which 5 ms to minimize.
[2024-06-02 23:21:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2024-06-02 23:21:25] [INFO ] Deduced a trap composed of 84 places in 86 ms of which 1 ms to minimize.
[2024-06-02 23:21:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2024-06-02 23:21:25] [INFO ] Deduced a trap composed of 52 places in 68 ms of which 1 ms to minimize.
[2024-06-02 23:21:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2024-06-02 23:21:25] [INFO ] Deduced a trap composed of 77 places in 75 ms of which 1 ms to minimize.
[2024-06-02 23:21:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2024-06-02 23:21:25] [INFO ] After 761ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 109 ms.
[2024-06-02 23:21:26] [INFO ] After 976ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 66 ms.
Support contains 17 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 293/293 transitions.
Graph (trivial) has 132 edges and 189 vertex of which 18 / 189 are part of one of the 3 SCC in 4 ms
Free SCC test removed 15 places
Drop transitions removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 174 transition count 245
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 145 transition count 244
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 60 place count 145 transition count 234
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 80 place count 135 transition count 234
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 134 transition count 224
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 134 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 83 place count 134 transition count 223
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 123 place count 114 transition count 203
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -54
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 151 place count 100 transition count 257
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 155 place count 100 transition count 253
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 4 with 21 rules applied. Total rules applied 176 place count 100 transition count 232
Free-agglomeration rule applied 13 times.
Iterating global reduction 4 with 13 rules applied. Total rules applied 189 place count 100 transition count 219
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 202 place count 87 transition count 219
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 5 with 17 rules applied. Total rules applied 219 place count 87 transition count 202
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 220 place count 87 transition count 202
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 221 place count 87 transition count 202
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 222 place count 86 transition count 201
Applied a total of 222 rules in 87 ms. Remains 86 /189 variables (removed 103) and now considering 201/293 (removed 92) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 86/189 places, 201/293 transitions.
Incomplete random walk after 10000 steps, including 855 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 258 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 270 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 262 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 251 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 261 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 260 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 255 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 273 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 259 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 261 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 10) seen :0
Finished probabilistic random walk after 9626 steps, run visited all 10 properties in 96 ms. (steps per millisecond=100 )
Probabilistic random walk after 9626 steps, saw 3036 distinct states, run finished after 96 ms. (steps per millisecond=100 ) properties seen :10
Parikh walk visited 0 properties in 0 ms.
Computed a total of 26 stabilizing places and 28 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 2 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 293/293 transitions.
Graph (trivial) has 157 edges and 189 vertex of which 18 / 189 are part of one of the 3 SCC in 0 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 173 transition count 240
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 40 rules applied. Total rules applied 77 place count 137 transition count 236
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 79 place count 135 transition count 236
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 79 place count 135 transition count 225
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 101 place count 124 transition count 225
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 106 place count 119 transition count 211
Iterating global reduction 3 with 5 rules applied. Total rules applied 111 place count 119 transition count 211
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 112 place count 119 transition count 210
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 112 place count 119 transition count 206
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 120 place count 115 transition count 206
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 156 place count 97 transition count 188
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -57
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 192 place count 79 transition count 245
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 4 with 21 rules applied. Total rules applied 213 place count 79 transition count 224
Applied a total of 213 rules in 35 ms. Remains 79 /189 variables (removed 110) and now considering 224/293 (removed 69) transitions.
[2024-06-02 23:21:27] [INFO ] Flow matrix only has 215 transitions (discarded 9 similar events)
// Phase 1: matrix 215 rows 79 cols
[2024-06-02 23:21:27] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 23:21:27] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-02 23:21:27] [INFO ] Flow matrix only has 215 transitions (discarded 9 similar events)
[2024-06-02 23:21:27] [INFO ] Invariant cache hit.
[2024-06-02 23:21:27] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-06-02 23:21:27] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2024-06-02 23:21:27] [INFO ] Redundant transitions in 9 ms returned []
[2024-06-02 23:21:27] [INFO ] Flow matrix only has 215 transitions (discarded 9 similar events)
[2024-06-02 23:21:27] [INFO ] Invariant cache hit.
[2024-06-02 23:21:27] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 79/189 places, 224/293 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 304 ms. Remains : 79/189 places, 224/293 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 151 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-16-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s68 0) (EQ s64 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1 reset in 178 ms.
Product exploration explored 100000 steps with 0 reset in 74 ms.
Computed a total of 3 stabilizing places and 7 stable transitions
Computed a total of 3 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1327 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 436 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2459 steps, run visited all 1 properties in 17 ms. (steps per millisecond=144 )
Probabilistic random walk after 2459 steps, saw 982 distinct states, run finished after 18 ms. (steps per millisecond=136 ) properties seen :1
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 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 52 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[(NOT p0)]
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 224/224 transitions.
Applied a total of 0 rules in 6 ms. Remains 79 /79 variables (removed 0) and now considering 224/224 (removed 0) transitions.
[2024-06-02 23:21:28] [INFO ] Flow matrix only has 215 transitions (discarded 9 similar events)
[2024-06-02 23:21:28] [INFO ] Invariant cache hit.
[2024-06-02 23:21:28] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-02 23:21:28] [INFO ] Flow matrix only has 215 transitions (discarded 9 similar events)
[2024-06-02 23:21:28] [INFO ] Invariant cache hit.
[2024-06-02 23:21:28] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-06-02 23:21:28] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2024-06-02 23:21:28] [INFO ] Redundant transitions in 9 ms returned []
[2024-06-02 23:21:28] [INFO ] Flow matrix only has 215 transitions (discarded 9 similar events)
[2024-06-02 23:21:28] [INFO ] Invariant cache hit.
[2024-06-02 23:21:28] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 269 ms. Remains : 79/79 places, 224/224 transitions.
Computed a total of 3 stabilizing places and 7 stable transitions
Computed a total of 3 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1324 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 433 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2459 steps, run visited all 1 properties in 7 ms. (steps per millisecond=351 )
Probabilistic random walk after 2459 steps, saw 982 distinct states, run finished after 7 ms. (steps per millisecond=351 ) properties seen :1
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 118 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 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 68 ms.
Product exploration explored 100000 steps with 0 reset in 84 ms.
Built C files in :
/tmp/ltsmin16984867828497977123
[2024-06-02 23:21:29] [INFO ] Computing symmetric may disable matrix : 224 transitions.
[2024-06-02 23:21:29] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:21:29] [INFO ] Computing symmetric may enable matrix : 224 transitions.
[2024-06-02 23:21:29] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:21:29] [INFO ] Computing Do-Not-Accords matrix : 224 transitions.
[2024-06-02 23:21:29] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:21:29] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16984867828497977123
Running compilation step : cd /tmp/ltsmin16984867828497977123;'/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 512 ms.
Running link step : cd /tmp/ltsmin16984867828497977123;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin16984867828497977123;'/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/stateBased5235747906307705221.hoa' '--buchi-type=spotba'
LTSmin run took 260 ms.
FORMULA FireWire-PT-16-LTLCardinality-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-16-LTLCardinality-03 finished in 2923 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 293/293 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 178 transition count 282
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 178 transition count 282
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 178 transition count 281
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 176 transition count 278
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 176 transition count 278
Applied a total of 27 rules in 14 ms. Remains 176 /189 variables (removed 13) and now considering 278/293 (removed 15) transitions.
// Phase 1: matrix 278 rows 176 cols
[2024-06-02 23:21:30] [INFO ] Computed 4 invariants in 5 ms
[2024-06-02 23:21:30] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-02 23:21:30] [INFO ] Invariant cache hit.
[2024-06-02 23:21:30] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2024-06-02 23:21:30] [INFO ] Invariant cache hit.
[2024-06-02 23:21:30] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 176/189 places, 278/293 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 309 ms. Remains : 176/189 places, 278/293 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-16-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s164 0) (EQ s49 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 73 steps with 1 reset in 2 ms.
FORMULA FireWire-PT-16-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-16-LTLCardinality-05 finished in 429 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(p1)&&p0)) U p2))'
Support contains 6 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 293/293 transitions.
Graph (trivial) has 149 edges and 189 vertex of which 18 / 189 are part of one of the 3 SCC in 0 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 173 transition count 245
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 142 transition count 244
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 64 place count 142 transition count 233
Deduced a syphon composed of 11 places in 4 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 86 place count 131 transition count 233
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 91 place count 126 transition count 219
Iterating global reduction 2 with 5 rules applied. Total rules applied 96 place count 126 transition count 219
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 97 place count 126 transition count 218
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 97 place count 126 transition count 214
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 105 place count 122 transition count 214
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 106 place count 121 transition count 213
Iterating global reduction 3 with 1 rules applied. Total rules applied 107 place count 121 transition count 213
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 145 place count 102 transition count 194
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -70
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 179 place count 85 transition count 264
Drop transitions removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 3 with 34 rules applied. Total rules applied 213 place count 85 transition count 230
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 214 place count 85 transition count 230
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 215 place count 84 transition count 229
Applied a total of 215 rules in 54 ms. Remains 84 /189 variables (removed 105) and now considering 229/293 (removed 64) transitions.
[2024-06-02 23:21:30] [INFO ] Flow matrix only has 206 transitions (discarded 23 similar events)
// Phase 1: matrix 206 rows 84 cols
[2024-06-02 23:21:30] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 23:21:30] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-02 23:21:30] [INFO ] Flow matrix only has 206 transitions (discarded 23 similar events)
[2024-06-02 23:21:30] [INFO ] Invariant cache hit.
[2024-06-02 23:21:30] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-06-02 23:21:30] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2024-06-02 23:21:30] [INFO ] Redundant transitions in 11 ms returned []
[2024-06-02 23:21:30] [INFO ] Flow matrix only has 206 transitions (discarded 23 similar events)
[2024-06-02 23:21:30] [INFO ] Invariant cache hit.
[2024-06-02 23:21:31] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/189 places, 229/293 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 356 ms. Remains : 84/189 places, 229/293 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p2), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : FireWire-PT-16-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=0 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(EQ s1 1), p0:(AND (EQ s16 1) (OR (EQ s9 0) (EQ s83 1))), p1:(OR (EQ s44 0) (EQ s80 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-16-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-16-LTLCardinality-06 finished in 525 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 293/293 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 178 transition count 282
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 178 transition count 282
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 178 transition count 281
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 26 place count 175 transition count 277
Iterating global reduction 1 with 3 rules applied. Total rules applied 29 place count 175 transition count 277
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 174 transition count 276
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 174 transition count 276
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 173 transition count 275
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 173 transition count 275
Applied a total of 33 rules in 15 ms. Remains 173 /189 variables (removed 16) and now considering 275/293 (removed 18) transitions.
// Phase 1: matrix 275 rows 173 cols
[2024-06-02 23:21:31] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 23:21:31] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-02 23:21:31] [INFO ] Invariant cache hit.
[2024-06-02 23:21:31] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2024-06-02 23:21:31] [INFO ] Invariant cache hit.
[2024-06-02 23:21:31] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 173/189 places, 275/293 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 330 ms. Remains : 173/189 places, 275/293 transitions.
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-16-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s108 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-16-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-16-LTLCardinality-07 finished in 474 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 293/293 transitions.
Graph (trivial) has 156 edges and 189 vertex of which 15 / 189 are part of one of the 3 SCC in 0 ms
Free SCC test removed 12 places
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 176 transition count 244
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 40 rules applied. Total rules applied 77 place count 140 transition count 240
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 79 place count 138 transition count 240
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 79 place count 138 transition count 229
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 101 place count 127 transition count 229
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 105 place count 123 transition count 225
Iterating global reduction 3 with 4 rules applied. Total rules applied 109 place count 123 transition count 225
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 109 place count 123 transition count 221
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 117 place count 119 transition count 221
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 118 place count 118 transition count 220
Iterating global reduction 3 with 1 rules applied. Total rules applied 119 place count 118 transition count 220
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 159 place count 98 transition count 200
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 160 place count 97 transition count 190
Iterating global reduction 3 with 1 rules applied. Total rules applied 161 place count 97 transition count 190
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 162 place count 97 transition count 189
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -58
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 198 place count 79 transition count 247
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 201 place count 79 transition count 244
Applied a total of 201 rules in 36 ms. Remains 79 /189 variables (removed 110) and now considering 244/293 (removed 49) transitions.
[2024-06-02 23:21:31] [INFO ] Flow matrix only has 236 transitions (discarded 8 similar events)
// Phase 1: matrix 236 rows 79 cols
[2024-06-02 23:21:31] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 23:21:31] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-02 23:21:31] [INFO ] Flow matrix only has 236 transitions (discarded 8 similar events)
[2024-06-02 23:21:31] [INFO ] Invariant cache hit.
[2024-06-02 23:21:31] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-02 23:21:31] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2024-06-02 23:21:31] [INFO ] Redundant transitions in 2 ms returned []
[2024-06-02 23:21:31] [INFO ] Flow matrix only has 236 transitions (discarded 8 similar events)
[2024-06-02 23:21:31] [INFO ] Invariant cache hit.
[2024-06-02 23:21:31] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 79/189 places, 244/293 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 309 ms. Remains : 79/189 places, 244/293 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-16-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s11 0) (EQ s36 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 0 reset in 56 ms.
Product exploration explored 100000 steps with 0 reset in 39 ms.
Computed a total of 3 stabilizing places and 7 stable transitions
Computed a total of 3 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 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 30 ms :[(NOT p0)]
Finished random walk after 967 steps, including 121 resets, run visited all 1 properties in 4 ms. (steps per millisecond=241 )
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 104 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 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 244/244 transitions.
Applied a total of 0 rules in 10 ms. Remains 79 /79 variables (removed 0) and now considering 244/244 (removed 0) transitions.
[2024-06-02 23:21:32] [INFO ] Flow matrix only has 236 transitions (discarded 8 similar events)
[2024-06-02 23:21:32] [INFO ] Invariant cache hit.
[2024-06-02 23:21:32] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-02 23:21:32] [INFO ] Flow matrix only has 236 transitions (discarded 8 similar events)
[2024-06-02 23:21:32] [INFO ] Invariant cache hit.
[2024-06-02 23:21:32] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-06-02 23:21:32] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2024-06-02 23:21:32] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 23:21:32] [INFO ] Flow matrix only has 236 transitions (discarded 8 similar events)
[2024-06-02 23:21:32] [INFO ] Invariant cache hit.
[2024-06-02 23:21:32] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 282 ms. Remains : 79/79 places, 244/244 transitions.
Computed a total of 3 stabilizing places and 7 stable transitions
Computed a total of 3 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 63 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 161 steps, including 17 resets, run visited all 1 properties in 1 ms. (steps per millisecond=161 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1 reset in 37 ms.
Product exploration explored 100000 steps with 2 reset in 43 ms.
Built C files in :
/tmp/ltsmin8793757900455747003
[2024-06-02 23:21:33] [INFO ] Computing symmetric may disable matrix : 244 transitions.
[2024-06-02 23:21:33] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:21:33] [INFO ] Computing symmetric may enable matrix : 244 transitions.
[2024-06-02 23:21:33] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:21:33] [INFO ] Computing Do-Not-Accords matrix : 244 transitions.
[2024-06-02 23:21:33] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:21:33] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8793757900455747003
Running compilation step : cd /tmp/ltsmin8793757900455747003;'/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 470 ms.
Running link step : cd /tmp/ltsmin8793757900455747003;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin8793757900455747003;'/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/stateBased14997774778526844554.hoa' '--buchi-type=spotba'
LTSmin run took 254 ms.
FORMULA FireWire-PT-16-LTLCardinality-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-16-LTLCardinality-11 finished in 2295 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U !p1) U (X(G(p0))&&F(p1)))))'
Support contains 3 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 293/293 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 179 transition count 283
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 179 transition count 283
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 179 transition count 282
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 176 transition count 278
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 176 transition count 278
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 175 transition count 277
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 175 transition count 277
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 174 transition count 276
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 174 transition count 276
Applied a total of 31 rules in 11 ms. Remains 174 /189 variables (removed 15) and now considering 276/293 (removed 17) transitions.
// Phase 1: matrix 276 rows 174 cols
[2024-06-02 23:21:33] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 23:21:34] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-02 23:21:34] [INFO ] Invariant cache hit.
[2024-06-02 23:21:34] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2024-06-02 23:21:34] [INFO ] Invariant cache hit.
[2024-06-02 23:21:34] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 174/189 places, 276/293 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 313 ms. Remains : 174/189 places, 276/293 transitions.
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p1), (AND p1 (NOT p0)), true]
Running random walk in product with property : FireWire-PT-16-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}, { cond=(AND p1 p0), acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(OR (EQ s21 0) (EQ s96 1)), p0:(EQ s99 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-16-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-16-LTLCardinality-12 finished in 530 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)))'
Support contains 2 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 293/293 transitions.
Graph (trivial) has 157 edges and 189 vertex of which 18 / 189 are part of one of the 3 SCC in 0 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 173 transition count 240
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 40 rules applied. Total rules applied 77 place count 137 transition count 236
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 79 place count 135 transition count 236
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 79 place count 135 transition count 225
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 101 place count 124 transition count 225
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 106 place count 119 transition count 211
Iterating global reduction 3 with 5 rules applied. Total rules applied 111 place count 119 transition count 211
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 112 place count 119 transition count 210
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 112 place count 119 transition count 206
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 120 place count 115 transition count 206
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 121 place count 114 transition count 205
Iterating global reduction 4 with 1 rules applied. Total rules applied 122 place count 114 transition count 205
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 160 place count 95 transition count 186
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -58
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 196 place count 77 transition count 244
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 4 with 21 rules applied. Total rules applied 217 place count 77 transition count 223
Applied a total of 217 rules in 31 ms. Remains 77 /189 variables (removed 112) and now considering 223/293 (removed 70) transitions.
[2024-06-02 23:21:34] [INFO ] Flow matrix only has 214 transitions (discarded 9 similar events)
// Phase 1: matrix 214 rows 77 cols
[2024-06-02 23:21:34] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 23:21:34] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-02 23:21:34] [INFO ] Flow matrix only has 214 transitions (discarded 9 similar events)
[2024-06-02 23:21:34] [INFO ] Invariant cache hit.
[2024-06-02 23:21:34] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-06-02 23:21:34] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2024-06-02 23:21:34] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 23:21:34] [INFO ] Flow matrix only has 214 transitions (discarded 9 similar events)
[2024-06-02 23:21:34] [INFO ] Invariant cache hit.
[2024-06-02 23:21:34] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 77/189 places, 223/293 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 284 ms. Remains : 77/189 places, 223/293 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-16-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s32 0) (EQ s47 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 40 ms.
Product exploration explored 100000 steps with 0 reset in 34 ms.
Computed a total of 3 stabilizing places and 7 stable transitions
Computed a total of 3 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 63 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1295 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 423 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4385 steps, run visited all 1 properties in 12 ms. (steps per millisecond=365 )
Probabilistic random walk after 4385 steps, saw 1657 distinct states, run finished after 12 ms. (steps per millisecond=365 ) properties seen :1
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 83 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 223/223 transitions.
Applied a total of 0 rules in 6 ms. Remains 77 /77 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2024-06-02 23:21:35] [INFO ] Flow matrix only has 214 transitions (discarded 9 similar events)
[2024-06-02 23:21:35] [INFO ] Invariant cache hit.
[2024-06-02 23:21:35] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-06-02 23:21:35] [INFO ] Flow matrix only has 214 transitions (discarded 9 similar events)
[2024-06-02 23:21:35] [INFO ] Invariant cache hit.
[2024-06-02 23:21:35] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-06-02 23:21:35] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2024-06-02 23:21:35] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 23:21:35] [INFO ] Flow matrix only has 214 transitions (discarded 9 similar events)
[2024-06-02 23:21:35] [INFO ] Invariant cache hit.
[2024-06-02 23:21:35] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 242 ms. Remains : 77/77 places, 223/223 transitions.
Computed a total of 3 stabilizing places and 7 stable transitions
Computed a total of 3 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1363 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 447 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 4385 steps, run visited all 1 properties in 15 ms. (steps per millisecond=292 )
Probabilistic random walk after 4385 steps, saw 1657 distinct states, run finished after 15 ms. (steps per millisecond=292 ) properties seen :1
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 122 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 29 ms.
Product exploration explored 100000 steps with 2 reset in 38 ms.
Built C files in :
/tmp/ltsmin13708029054287769670
[2024-06-02 23:21:36] [INFO ] Computing symmetric may disable matrix : 223 transitions.
[2024-06-02 23:21:36] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:21:36] [INFO ] Computing symmetric may enable matrix : 223 transitions.
[2024-06-02 23:21:36] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:21:36] [INFO ] Computing Do-Not-Accords matrix : 223 transitions.
[2024-06-02 23:21:36] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:21:36] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13708029054287769670
Running compilation step : cd /tmp/ltsmin13708029054287769670;'/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 401 ms.
Running link step : cd /tmp/ltsmin13708029054287769670;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin13708029054287769670;'/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/stateBased4697881730536528420.hoa' '--buchi-type=spotba'
LTSmin run took 430 ms.
FORMULA FireWire-PT-16-LTLCardinality-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-16-LTLCardinality-13 finished in 2627 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G(p1)))'
Support contains 3 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 293/293 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 178 transition count 282
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 178 transition count 282
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 178 transition count 281
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 176 transition count 279
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 176 transition count 279
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 175 transition count 278
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 175 transition count 278
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 174 transition count 277
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 174 transition count 277
Applied a total of 31 rules in 12 ms. Remains 174 /189 variables (removed 15) and now considering 277/293 (removed 16) transitions.
// Phase 1: matrix 277 rows 174 cols
[2024-06-02 23:21:37] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 23:21:37] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-02 23:21:37] [INFO ] Invariant cache hit.
[2024-06-02 23:21:37] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2024-06-02 23:21:37] [INFO ] Invariant cache hit.
[2024-06-02 23:21:37] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 174/189 places, 277/293 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 305 ms. Remains : 174/189 places, 277/293 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FireWire-PT-16-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s161 0) (EQ s107 1)), p1:(EQ s65 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 74 ms.
Product exploration explored 100000 steps with 0 reset in 79 ms.
Computed a total of 21 stabilizing places and 23 stable transitions
Computed a total of 21 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND p1 (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 89 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 776754 steps, run timeout after 3001 ms. (steps per millisecond=258 ) properties seen :{}
Probabilistic random walk after 776754 steps, saw 152330 distinct states, run finished after 3002 ms. (steps per millisecond=258 ) properties seen :0
Running SMT prover for 5 properties.
[2024-06-02 23:21:41] [INFO ] Invariant cache hit.
[2024-06-02 23:21:41] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 23:21:41] [INFO ] After 128ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-06-02 23:21:41] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 23:21:41] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2024-06-02 23:21:42] [INFO ] Deduced a trap composed of 93 places in 59 ms of which 1 ms to minimize.
[2024-06-02 23:21:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2024-06-02 23:21:42] [INFO ] After 252ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 36 ms.
[2024-06-02 23:21:42] [INFO ] After 366ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 34 ms.
Support contains 3 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 277/277 transitions.
Graph (trivial) has 138 edges and 174 vertex of which 18 / 174 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Drop transitions removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 159 transition count 231
Reduce places removed 27 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 29 rules applied. Total rules applied 57 place count 132 transition count 229
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 58 place count 131 transition count 229
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 58 place count 131 transition count 212
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 92 place count 114 transition count 212
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 93 place count 113 transition count 202
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 113 transition count 202
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 95 place count 113 transition count 201
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 127 place count 97 transition count 185
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -57
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 159 place count 81 transition count 242
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 162 place count 81 transition count 239
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 5 with 18 rules applied. Total rules applied 180 place count 81 transition count 221
Free-agglomeration rule applied 12 times.
Iterating global reduction 5 with 12 rules applied. Total rules applied 192 place count 81 transition count 209
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 207 place count 69 transition count 206
Drop transitions removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 6 with 28 rules applied. Total rules applied 235 place count 69 transition count 178
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 236 place count 69 transition count 178
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 237 place count 69 transition count 178
Applied a total of 237 rules in 37 ms. Remains 69 /174 variables (removed 105) and now considering 178/277 (removed 99) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 69/174 places, 178/277 transitions.
Incomplete random walk after 10000 steps, including 888 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 308 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 304 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 308 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 314 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Finished probabilistic random walk after 1660 steps, run visited all 4 properties in 14 ms. (steps per millisecond=118 )
Probabilistic random walk after 1660 steps, saw 741 distinct states, run finished after 14 ms. (steps per millisecond=118 ) properties seen :4
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (AND p1 (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F p0), (F (AND p0 p1)), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 8 factoid took 206 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 252 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 256 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Support contains 3 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 277/277 transitions.
Graph (trivial) has 138 edges and 174 vertex of which 18 / 174 are part of one of the 3 SCC in 0 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 158 transition count 233
Reduce places removed 27 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 29 rules applied. Total rules applied 57 place count 131 transition count 231
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 58 place count 130 transition count 231
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 58 place count 130 transition count 214
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 92 place count 113 transition count 214
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 93 place count 112 transition count 204
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 112 transition count 204
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 95 place count 112 transition count 203
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 125 place count 97 transition count 188
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -57
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 157 place count 81 transition count 245
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 4 with 21 rules applied. Total rules applied 178 place count 81 transition count 224
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 179 place count 81 transition count 224
Applied a total of 179 rules in 25 ms. Remains 81 /174 variables (removed 93) and now considering 224/277 (removed 53) transitions.
[2024-06-02 23:21:43] [INFO ] Flow matrix only has 215 transitions (discarded 9 similar events)
// Phase 1: matrix 215 rows 81 cols
[2024-06-02 23:21:43] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 23:21:43] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 23:21:43] [INFO ] Flow matrix only has 215 transitions (discarded 9 similar events)
[2024-06-02 23:21:43] [INFO ] Invariant cache hit.
[2024-06-02 23:21:43] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-06-02 23:21:43] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2024-06-02 23:21:43] [INFO ] Redundant transitions in 2 ms returned []
[2024-06-02 23:21:43] [INFO ] Flow matrix only has 215 transitions (discarded 9 similar events)
[2024-06-02 23:21:43] [INFO ] Invariant cache hit.
[2024-06-02 23:21:43] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 81/174 places, 224/277 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 287 ms. Remains : 81/174 places, 224/277 transitions.
Computed a total of 2 stabilizing places and 4 stable transitions
Computed a total of 2 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 118 ms. Reduced automaton from 7 states, 17 edges and 2 AP (stutter insensitive) to 7 states, 18 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 414 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), false, false]
Incomplete random walk after 10000 steps, including 1095 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 336 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 335 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 359 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 361 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 350 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Probably explored full state space saw : 37197 states, properties seen :4
Probabilistic random walk after 153332 steps, saw 37197 distinct states, run finished after 259 ms. (steps per millisecond=592 ) properties seen :4
Explored full state space saw : 37197 states, properties seen :0
Exhaustive walk after 153332 steps, saw 37197 distinct states, run finished after 153 ms. (steps per millisecond=1002 ) properties seen :0
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1)), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND p0 p1)), (F p0), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 14 factoid took 277 ms. Reduced automaton from 7 states, 18 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 251 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 262 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Stuttering acceptance computed with spot in 266 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, false]
Product exploration explored 100000 steps with 0 reset in 139 ms.
Product exploration explored 100000 steps with 0 reset in 59 ms.
Built C files in :
/tmp/ltsmin6135669688506052921
[2024-06-02 23:21:46] [INFO ] Computing symmetric may disable matrix : 224 transitions.
[2024-06-02 23:21:46] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:21:46] [INFO ] Computing symmetric may enable matrix : 224 transitions.
[2024-06-02 23:21:46] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:21:46] [INFO ] Computing Do-Not-Accords matrix : 224 transitions.
[2024-06-02 23:21:46] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:21:46] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6135669688506052921
Running compilation step : cd /tmp/ltsmin6135669688506052921;'/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 395 ms.
Running link step : cd /tmp/ltsmin6135669688506052921;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin6135669688506052921;'/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/stateBased8057549204658086581.hoa' '--buchi-type=spotba'
LTSmin run took 300 ms.
FORMULA FireWire-PT-16-LTLCardinality-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-16-LTLCardinality-14 finished in 9911 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)))'
Support contains 2 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 293/293 transitions.
Graph (trivial) has 155 edges and 189 vertex of which 18 / 189 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 173 transition count 240
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 40 rules applied. Total rules applied 77 place count 137 transition count 236
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 79 place count 135 transition count 236
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 79 place count 135 transition count 225
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 101 place count 124 transition count 225
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 106 place count 119 transition count 211
Iterating global reduction 3 with 5 rules applied. Total rules applied 111 place count 119 transition count 211
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 112 place count 119 transition count 210
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 112 place count 119 transition count 206
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 120 place count 115 transition count 206
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 121 place count 114 transition count 205
Iterating global reduction 4 with 1 rules applied. Total rules applied 122 place count 114 transition count 205
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 158 place count 96 transition count 187
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -50
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 192 place count 79 transition count 237
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 4 with 19 rules applied. Total rules applied 211 place count 79 transition count 218
Applied a total of 211 rules in 24 ms. Remains 79 /189 variables (removed 110) and now considering 218/293 (removed 75) transitions.
[2024-06-02 23:21:47] [INFO ] Flow matrix only has 209 transitions (discarded 9 similar events)
// Phase 1: matrix 209 rows 79 cols
[2024-06-02 23:21:47] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 23:21:47] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-02 23:21:47] [INFO ] Flow matrix only has 209 transitions (discarded 9 similar events)
[2024-06-02 23:21:47] [INFO ] Invariant cache hit.
[2024-06-02 23:21:47] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-06-02 23:21:47] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
[2024-06-02 23:21:47] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 23:21:47] [INFO ] Flow matrix only has 209 transitions (discarded 9 similar events)
[2024-06-02 23:21:47] [INFO ] Invariant cache hit.
[2024-06-02 23:21:47] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 79/189 places, 218/293 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 277 ms. Remains : 79/189 places, 218/293 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-16-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s70 0) (EQ s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2 reset in 38 ms.
Product exploration explored 100000 steps with 0 reset in 40 ms.
Computed a total of 3 stabilizing places and 7 stable transitions
Computed a total of 3 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1328 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 432 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1265 steps, run visited all 1 properties in 4 ms. (steps per millisecond=316 )
Probabilistic random walk after 1265 steps, saw 568 distinct states, run finished after 4 ms. (steps per millisecond=316 ) properties seen :1
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 97 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 218/218 transitions.
Applied a total of 0 rules in 6 ms. Remains 79 /79 variables (removed 0) and now considering 218/218 (removed 0) transitions.
[2024-06-02 23:21:47] [INFO ] Flow matrix only has 209 transitions (discarded 9 similar events)
[2024-06-02 23:21:47] [INFO ] Invariant cache hit.
[2024-06-02 23:21:47] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-02 23:21:47] [INFO ] Flow matrix only has 209 transitions (discarded 9 similar events)
[2024-06-02 23:21:47] [INFO ] Invariant cache hit.
[2024-06-02 23:21:47] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-06-02 23:21:48] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2024-06-02 23:21:48] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 23:21:48] [INFO ] Flow matrix only has 209 transitions (discarded 9 similar events)
[2024-06-02 23:21:48] [INFO ] Invariant cache hit.
[2024-06-02 23:21:48] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 291 ms. Remains : 79/79 places, 218/218 transitions.
Computed a total of 3 stabilizing places and 7 stable transitions
Computed a total of 3 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1334 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 428 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1265 steps, run visited all 1 properties in 5 ms. (steps per millisecond=253 )
Probabilistic random walk after 1265 steps, saw 568 distinct states, run finished after 5 ms. (steps per millisecond=253 ) properties seen :1
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 88 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 39 ms.
Product exploration explored 100000 steps with 0 reset in 48 ms.
Built C files in :
/tmp/ltsmin334852084252729130
[2024-06-02 23:21:48] [INFO ] Computing symmetric may disable matrix : 218 transitions.
[2024-06-02 23:21:48] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:21:48] [INFO ] Computing symmetric may enable matrix : 218 transitions.
[2024-06-02 23:21:48] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:21:48] [INFO ] Computing Do-Not-Accords matrix : 218 transitions.
[2024-06-02 23:21:48] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:21:48] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin334852084252729130
Running compilation step : cd /tmp/ltsmin334852084252729130;'/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 391 ms.
Running link step : cd /tmp/ltsmin334852084252729130;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin334852084252729130;'/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/stateBased3181808754098714895.hoa' '--buchi-type=spotba'
LTSmin run took 215 ms.
FORMULA FireWire-PT-16-LTLCardinality-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-16-LTLCardinality-15 finished in 2379 ms.
All properties solved by simple procedures.
Total runtime 28043 ms.

BK_STOP 1717370510403

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="FireWire-PT-16"
export BK_EXAMINATION="LTLCardinality"
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 FireWire-PT-16, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r571-tall-171734910400182"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-16.tgz
mv FireWire-PT-16 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;