Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r597-smll-171734926500112.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is MedleyA-PT-23, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r597-smll-171734926500112
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 8.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K 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 150K Jun 2 16:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME MedleyA-PT-23-LTLCardinality-00
FORMULA_NAME MedleyA-PT-23-LTLCardinality-01
FORMULA_NAME MedleyA-PT-23-LTLCardinality-02
FORMULA_NAME MedleyA-PT-23-LTLCardinality-03
FORMULA_NAME MedleyA-PT-23-LTLCardinality-04
FORMULA_NAME MedleyA-PT-23-LTLCardinality-05
FORMULA_NAME MedleyA-PT-23-LTLCardinality-06
FORMULA_NAME MedleyA-PT-23-LTLCardinality-07
FORMULA_NAME MedleyA-PT-23-LTLCardinality-08
FORMULA_NAME MedleyA-PT-23-LTLCardinality-09
FORMULA_NAME MedleyA-PT-23-LTLCardinality-10
FORMULA_NAME MedleyA-PT-23-LTLCardinality-11
FORMULA_NAME MedleyA-PT-23-LTLCardinality-12
FORMULA_NAME MedleyA-PT-23-LTLCardinality-13
FORMULA_NAME MedleyA-PT-23-LTLCardinality-14
FORMULA_NAME MedleyA-PT-23-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717367914583

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=MedleyA-PT-23
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-06-02 22:38:37] [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 22:38:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:38:37] [INFO ] Load time of PNML (sax parser for PT used): 141 ms
[2024-06-02 22:38:37] [INFO ] Transformed 378 places.
[2024-06-02 22:38:37] [INFO ] Transformed 614 transitions.
[2024-06-02 22:38:37] [INFO ] Found NUPN structural information;
[2024-06-02 22:38:37] [INFO ] Parsed PT model containing 378 places and 614 transitions and 1969 arcs in 275 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA MedleyA-PT-23-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-23-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-23-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-23-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-23-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-23-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-23-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-23-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-23-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-23-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 14 out of 378 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 378/378 places, 614/614 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 375 transition count 614
Discarding 93 places :
Symmetric choice reduction at 1 with 93 rule applications. Total rules 96 place count 282 transition count 521
Iterating global reduction 1 with 93 rules applied. Total rules applied 189 place count 282 transition count 521
Discarding 68 places :
Symmetric choice reduction at 1 with 68 rule applications. Total rules 257 place count 214 transition count 453
Iterating global reduction 1 with 68 rules applied. Total rules applied 325 place count 214 transition count 453
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 351 place count 188 transition count 407
Iterating global reduction 1 with 26 rules applied. Total rules applied 377 place count 188 transition count 407
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 389 place count 176 transition count 373
Iterating global reduction 1 with 12 rules applied. Total rules applied 401 place count 176 transition count 373
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 404 place count 176 transition count 370
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 409 place count 171 transition count 358
Iterating global reduction 2 with 5 rules applied. Total rules applied 414 place count 171 transition count 358
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 419 place count 171 transition count 353
Applied a total of 419 rules in 119 ms. Remains 171 /378 variables (removed 207) and now considering 353/614 (removed 261) transitions.
// Phase 1: matrix 353 rows 171 cols
[2024-06-02 22:38:38] [INFO ] Computed 8 invariants in 32 ms
[2024-06-02 22:38:38] [INFO ] Implicit Places using invariants in 380 ms returned []
[2024-06-02 22:38:38] [INFO ] Invariant cache hit.
[2024-06-02 22:38:38] [INFO ] Implicit Places using invariants and state equation in 427 ms returned []
Implicit Place search using SMT with State Equation took 858 ms to find 0 implicit places.
[2024-06-02 22:38:38] [INFO ] Invariant cache hit.
[2024-06-02 22:38:39] [INFO ] Dead Transitions using invariants and state equation in 317 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 171/378 places, 353/614 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1297 ms. Remains : 171/378 places, 353/614 transitions.
Support contains 14 out of 171 places after structural reductions.
[2024-06-02 22:38:39] [INFO ] Flatten gal took : 87 ms
[2024-06-02 22:38:39] [INFO ] Flatten gal took : 40 ms
[2024-06-02 22:38:39] [INFO ] Input system was already deterministic with 353 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 646 ms. (steps per millisecond=15 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2024-06-02 22:38:40] [INFO ] Invariant cache hit.
[2024-06-02 22:38:40] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:38:40] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2024-06-02 22:38:40] [INFO ] After 160ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 22:38:40] [INFO ] After 204ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2024-06-02 22:38:40] [INFO ] After 333ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 171 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 353/353 transitions.
Graph (trivial) has 137 edges and 171 vertex of which 18 / 171 are part of one of the 3 SCC in 7 ms
Free SCC test removed 15 places
Drop transitions removed 27 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 156 transition count 313
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 147 transition count 313
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 19 place count 147 transition count 304
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 37 place count 138 transition count 304
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 50 place count 125 transition count 284
Iterating global reduction 2 with 13 rules applied. Total rules applied 63 place count 125 transition count 284
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 63 place count 125 transition count 283
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 65 place count 124 transition count 283
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 69 place count 120 transition count 271
Iterating global reduction 2 with 4 rules applied. Total rules applied 73 place count 120 transition count 271
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 75 place count 120 transition count 269
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 129 place count 93 transition count 242
Drop transitions removed 3 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 136 place count 93 transition count 235
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 144 place count 85 transition count 211
Iterating global reduction 4 with 8 rules applied. Total rules applied 152 place count 85 transition count 211
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 155 place count 85 transition count 208
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 157 place count 84 transition count 207
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 175 place count 75 transition count 222
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 184 place count 75 transition count 213
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 187 place count 72 transition count 204
Iterating global reduction 5 with 3 rules applied. Total rules applied 190 place count 72 transition count 204
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 193 place count 72 transition count 201
Free-agglomeration rule applied 20 times.
Iterating global reduction 6 with 20 rules applied. Total rules applied 213 place count 72 transition count 181
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 26 rules applied. Total rules applied 239 place count 52 transition count 175
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 245 place count 49 transition count 172
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 246 place count 48 transition count 171
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 247 place count 47 transition count 171
Applied a total of 247 rules in 130 ms. Remains 47 /171 variables (removed 124) and now considering 171/353 (removed 182) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 47/171 places, 171/353 transitions.
Finished random walk after 20 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=20 )
Parikh walk visited 0 properties in 0 ms.
FORMULA MedleyA-PT-23-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 16 stabilizing places and 21 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' '!(G(F(p0)))'
Support contains 2 out of 171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 171/171 places, 353/353 transitions.
Graph (trivial) has 135 edges and 171 vertex of which 17 / 171 are part of one of the 3 SCC in 0 ms
Free SCC test removed 14 places
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 156 transition count 320
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 146 transition count 320
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 21 place count 146 transition count 311
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 39 place count 137 transition count 311
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 53 place count 123 transition count 291
Iterating global reduction 2 with 14 rules applied. Total rules applied 67 place count 123 transition count 291
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 67 place count 123 transition count 290
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 69 place count 122 transition count 290
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 73 place count 118 transition count 278
Iterating global reduction 2 with 4 rules applied. Total rules applied 77 place count 118 transition count 278
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 79 place count 118 transition count 276
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 129 place count 93 transition count 251
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 133 place count 93 transition count 247
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 142 place count 84 transition count 220
Iterating global reduction 4 with 9 rules applied. Total rules applied 151 place count 84 transition count 220
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 154 place count 84 transition count 217
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 156 place count 83 transition count 216
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 174 place count 74 transition count 231
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 5 with 11 rules applied. Total rules applied 185 place count 74 transition count 220
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 188 place count 71 transition count 211
Iterating global reduction 5 with 3 rules applied. Total rules applied 191 place count 71 transition count 211
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 194 place count 71 transition count 208
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 196 place count 69 transition count 206
Applied a total of 196 rules in 87 ms. Remains 69 /171 variables (removed 102) and now considering 206/353 (removed 147) transitions.
[2024-06-02 22:38:41] [INFO ] Flow matrix only has 196 transitions (discarded 10 similar events)
// Phase 1: matrix 196 rows 69 cols
[2024-06-02 22:38:41] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 22:38:41] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-06-02 22:38:41] [INFO ] Flow matrix only has 196 transitions (discarded 10 similar events)
[2024-06-02 22:38:41] [INFO ] Invariant cache hit.
[2024-06-02 22:38:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:38:41] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
[2024-06-02 22:38:41] [INFO ] Redundant transitions in 11 ms returned []
[2024-06-02 22:38:41] [INFO ] Flow matrix only has 196 transitions (discarded 10 similar events)
[2024-06-02 22:38:41] [INFO ] Invariant cache hit.
[2024-06-02 22:38:41] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/171 places, 206/353 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 567 ms. Remains : 69/171 places, 206/353 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 239 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-23-LTLCardinality-03 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 s23 0) (EQ s42 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 7 reset in 407 ms.
Product exploration explored 100000 steps with 8 reset in 257 ms.
Computed a total of 1 stabilizing places and 6 stable transitions
Computed a total of 1 stabilizing places and 6 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 281 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 83 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
Finished Best-First random walk after 28 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=14 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 210 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 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 206/206 transitions.
Applied a total of 0 rules in 9 ms. Remains 69 /69 variables (removed 0) and now considering 206/206 (removed 0) transitions.
[2024-06-02 22:38:43] [INFO ] Flow matrix only has 196 transitions (discarded 10 similar events)
[2024-06-02 22:38:43] [INFO ] Invariant cache hit.
[2024-06-02 22:38:43] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-02 22:38:43] [INFO ] Flow matrix only has 196 transitions (discarded 10 similar events)
[2024-06-02 22:38:43] [INFO ] Invariant cache hit.
[2024-06-02 22:38:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:38:43] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
[2024-06-02 22:38:43] [INFO ] Redundant transitions in 12 ms returned []
[2024-06-02 22:38:43] [INFO ] Flow matrix only has 196 transitions (discarded 10 similar events)
[2024-06-02 22:38:43] [INFO ] Invariant cache hit.
[2024-06-02 22:38:44] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 445 ms. Remains : 69/69 places, 206/206 transitions.
Computed a total of 1 stabilizing places and 6 stable transitions
Computed a total of 1 stabilizing places and 6 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 177 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 77 ms :[(NOT p0), (NOT p0)]
Finished random walk after 64 steps, including 5 resets, run visited all 1 properties in 1 ms. (steps per millisecond=64 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 214 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 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 8 reset in 176 ms.
Stuttering criterion allowed to conclude after 19 steps with 2 reset in 0 ms.
FORMULA MedleyA-PT-23-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-23-LTLCardinality-03 finished in 3754 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 171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 171/171 places, 353/353 transitions.
Graph (trivial) has 138 edges and 171 vertex of which 18 / 171 are part of one of the 3 SCC in 0 ms
Free SCC test removed 15 places
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 155 transition count 317
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 145 transition count 317
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 21 place count 145 transition count 308
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 39 place count 136 transition count 308
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 53 place count 122 transition count 287
Iterating global reduction 2 with 14 rules applied. Total rules applied 67 place count 122 transition count 287
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 67 place count 122 transition count 286
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 69 place count 121 transition count 286
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 74 place count 116 transition count 271
Iterating global reduction 2 with 5 rules applied. Total rules applied 79 place count 116 transition count 271
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 82 place count 116 transition count 268
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 132 place count 91 transition count 243
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 136 place count 91 transition count 239
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 144 place count 83 transition count 215
Iterating global reduction 4 with 8 rules applied. Total rules applied 152 place count 83 transition count 215
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 155 place count 83 transition count 212
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 157 place count 82 transition count 211
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 175 place count 73 transition count 226
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 184 place count 73 transition count 217
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 187 place count 70 transition count 208
Iterating global reduction 5 with 3 rules applied. Total rules applied 190 place count 70 transition count 208
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 193 place count 70 transition count 205
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 195 place count 68 transition count 203
Applied a total of 195 rules in 67 ms. Remains 68 /171 variables (removed 103) and now considering 203/353 (removed 150) transitions.
[2024-06-02 22:38:45] [INFO ] Flow matrix only has 193 transitions (discarded 10 similar events)
// Phase 1: matrix 193 rows 68 cols
[2024-06-02 22:38:45] [INFO ] Computed 8 invariants in 4 ms
[2024-06-02 22:38:45] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-02 22:38:45] [INFO ] Flow matrix only has 193 transitions (discarded 10 similar events)
[2024-06-02 22:38:45] [INFO ] Invariant cache hit.
[2024-06-02 22:38:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:38:45] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
[2024-06-02 22:38:45] [INFO ] Redundant transitions in 2 ms returned []
[2024-06-02 22:38:45] [INFO ] Flow matrix only has 193 transitions (discarded 10 similar events)
[2024-06-02 22:38:45] [INFO ] Invariant cache hit.
[2024-06-02 22:38:45] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 68/171 places, 203/353 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 471 ms. Remains : 68/171 places, 203/353 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-23-LTLCardinality-04 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:(AND (NEQ s46 0) (NEQ s44 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]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-23-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-23-LTLCardinality-04 finished in 562 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 U p1) U (G((p0 U p1))||((p0 U p1)&&G(p0)))))))'
Support contains 4 out of 171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 171/171 places, 353/353 transitions.
Graph (trivial) has 136 edges and 171 vertex of which 18 / 171 are part of one of the 3 SCC in 0 ms
Free SCC test removed 15 places
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 155 transition count 318
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 146 transition count 318
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 19 place count 146 transition count 309
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 37 place count 137 transition count 309
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 50 place count 124 transition count 289
Iterating global reduction 2 with 13 rules applied. Total rules applied 63 place count 124 transition count 289
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 63 place count 124 transition count 288
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 65 place count 123 transition count 288
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 69 place count 119 transition count 276
Iterating global reduction 2 with 4 rules applied. Total rules applied 73 place count 119 transition count 276
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 76 place count 119 transition count 273
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 122 place count 96 transition count 250
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 126 place count 96 transition count 246
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 134 place count 88 transition count 222
Iterating global reduction 4 with 8 rules applied. Total rules applied 142 place count 88 transition count 222
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 145 place count 88 transition count 219
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 147 place count 87 transition count 218
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 165 place count 78 transition count 233
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 174 place count 78 transition count 224
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 177 place count 75 transition count 215
Iterating global reduction 5 with 3 rules applied. Total rules applied 180 place count 75 transition count 215
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 183 place count 75 transition count 212
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 185 place count 73 transition count 210
Applied a total of 185 rules in 59 ms. Remains 73 /171 variables (removed 98) and now considering 210/353 (removed 143) transitions.
[2024-06-02 22:38:45] [INFO ] Flow matrix only has 200 transitions (discarded 10 similar events)
// Phase 1: matrix 200 rows 73 cols
[2024-06-02 22:38:45] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:38:45] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-02 22:38:45] [INFO ] Flow matrix only has 200 transitions (discarded 10 similar events)
[2024-06-02 22:38:45] [INFO ] Invariant cache hit.
[2024-06-02 22:38:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:38:45] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
[2024-06-02 22:38:45] [INFO ] Redundant transitions in 2 ms returned []
[2024-06-02 22:38:45] [INFO ] Flow matrix only has 200 transitions (discarded 10 similar events)
[2024-06-02 22:38:45] [INFO ] Invariant cache hit.
[2024-06-02 22:38:45] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 73/171 places, 210/353 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 438 ms. Remains : 73/171 places, 210/353 transitions.
Stuttering acceptance computed with spot in 240 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-23-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={1} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={1} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s41 0) (EQ s4 1)), p1:(OR (EQ s57 0) (EQ s48 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 8 reset in 198 ms.
Product exploration explored 100000 steps with 6 reset in 202 ms.
Computed a total of 3 stabilizing places and 8 stable transitions
Computed a total of 3 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 8 factoid took 186 ms. Reduced automaton from 5 states, 15 edges and 2 AP (stutter insensitive) to 5 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 256 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 13 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-06-02 22:38:47] [INFO ] Flow matrix only has 200 transitions (discarded 10 similar events)
[2024-06-02 22:38:47] [INFO ] Invariant cache hit.
[2024-06-02 22:38:47] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:38:47] [INFO ] [Nat]Absence check using 8 positive place invariants in 12 ms returned sat
[2024-06-02 22:38:47] [INFO ] After 75ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 22:38:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:38:47] [INFO ] After 12ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 22:38:47] [INFO ] After 30ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2024-06-02 22:38:47] [INFO ] After 165ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 210/210 transitions.
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 73 transition count 201
Free-agglomeration rule applied 20 times.
Iterating global reduction 1 with 20 rules applied. Total rules applied 29 place count 73 transition count 181
Reduce places removed 21 places and 0 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 56 place count 52 transition count 175
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 62 place count 49 transition count 172
Applied a total of 62 rules in 15 ms. Remains 49 /73 variables (removed 24) and now considering 172/210 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 49/73 places, 172/210 transitions.
Finished random walk after 63 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=31 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND (NOT p1) (NOT p0))), (F (NOT p0)), (F (AND p1 (NOT p0))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 8 factoid took 329 ms. Reduced automaton from 5 states, 15 edges and 2 AP (stutter insensitive) to 5 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 376 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 236 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 210/210 transitions.
Applied a total of 0 rules in 6 ms. Remains 73 /73 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2024-06-02 22:38:48] [INFO ] Flow matrix only has 200 transitions (discarded 10 similar events)
[2024-06-02 22:38:48] [INFO ] Invariant cache hit.
[2024-06-02 22:38:48] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-02 22:38:48] [INFO ] Flow matrix only has 200 transitions (discarded 10 similar events)
[2024-06-02 22:38:48] [INFO ] Invariant cache hit.
[2024-06-02 22:38:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:38:48] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
[2024-06-02 22:38:48] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 22:38:48] [INFO ] Flow matrix only has 200 transitions (discarded 10 similar events)
[2024-06-02 22:38:48] [INFO ] Invariant cache hit.
[2024-06-02 22:38:48] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 438 ms. Remains : 73/73 places, 210/210 transitions.
Computed a total of 3 stabilizing places and 8 stable transitions
Computed a total of 3 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge based reduction with 8 factoid took 186 ms. Reduced automaton from 5 states, 15 edges and 2 AP (stutter insensitive) to 5 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 206 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 19 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-06-02 22:38:49] [INFO ] Flow matrix only has 200 transitions (discarded 10 similar events)
[2024-06-02 22:38:49] [INFO ] Invariant cache hit.
[2024-06-02 22:38:49] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-02 22:38:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:38:49] [INFO ] After 90ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-02 22:38:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:38:49] [INFO ] After 31ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-06-02 22:38:49] [INFO ] After 81ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 31 ms.
[2024-06-02 22:38:49] [INFO ] After 244ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 210/210 transitions.
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 73 transition count 201
Free-agglomeration rule applied 20 times.
Iterating global reduction 1 with 20 rules applied. Total rules applied 29 place count 73 transition count 181
Reduce places removed 21 places and 0 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 56 place count 52 transition count 175
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 62 place count 49 transition count 172
Applied a total of 62 rules in 17 ms. Remains 49 /73 variables (removed 24) and now considering 172/210 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 49/73 places, 172/210 transitions.
Finished random walk after 1320 steps, including 26 resets, run visited all 3 properties in 6 ms. (steps per millisecond=220 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (AND (NOT p1) (NOT p0))), (F (NOT p0)), (F (AND p1 (NOT p0))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 8 factoid took 335 ms. Reduced automaton from 5 states, 15 edges and 2 AP (stutter insensitive) to 5 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 230 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 213 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 218 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 174 ms.
Stuttering criterion allowed to conclude after 11 steps with 1 reset in 0 ms.
FORMULA MedleyA-PT-23-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-23-LTLCardinality-09 finished in 5545 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 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 353/353 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 163 transition count 343
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 163 transition count 343
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 163 transition count 342
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 23 place count 157 transition count 328
Iterating global reduction 1 with 6 rules applied. Total rules applied 29 place count 157 transition count 328
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 30 place count 157 transition count 327
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 32 place count 155 transition count 323
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 155 transition count 323
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 154 transition count 320
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 154 transition count 320
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 153 transition count 318
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 153 transition count 318
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 39 place count 153 transition count 317
Applied a total of 39 rules in 15 ms. Remains 153 /171 variables (removed 18) and now considering 317/353 (removed 36) transitions.
// Phase 1: matrix 317 rows 153 cols
[2024-06-02 22:38:51] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 22:38:51] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-02 22:38:51] [INFO ] Invariant cache hit.
[2024-06-02 22:38:51] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
[2024-06-02 22:38:51] [INFO ] Invariant cache hit.
[2024-06-02 22:38:51] [INFO ] Dead Transitions using invariants and state equation in 221 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/171 places, 317/353 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 617 ms. Remains : 153/171 places, 317/353 transitions.
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-23-LTLCardinality-11 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 s58 0) (EQ s83 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3 reset in 179 ms.
Product exploration explored 100000 steps with 0 reset in 158 ms.
Computed a total of 16 stabilizing places and 21 stable transitions
Computed a total of 16 stabilizing places and 21 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 94 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Finished probabilistic random walk after 964 steps, run visited all 1 properties in 15 ms. (steps per millisecond=64 )
Probabilistic random walk after 964 steps, saw 400 distinct states, run finished after 16 ms. (steps per millisecond=60 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 4 factoid took 105 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-23-LTLCardinality-11 FALSE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-23-LTLCardinality-11 finished in 1404 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 3 out of 171 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 171/171 places, 353/353 transitions.
Graph (trivial) has 137 edges and 171 vertex of which 18 / 171 are part of one of the 3 SCC in 0 ms
Free SCC test removed 15 places
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 156 transition count 320
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 148 transition count 320
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 17 place count 148 transition count 310
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 37 place count 138 transition count 310
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 50 place count 125 transition count 290
Iterating global reduction 2 with 13 rules applied. Total rules applied 63 place count 125 transition count 290
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 63 place count 125 transition count 289
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 65 place count 124 transition count 289
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 68 place count 121 transition count 280
Iterating global reduction 2 with 3 rules applied. Total rules applied 71 place count 121 transition count 280
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 73 place count 121 transition count 278
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 127 place count 94 transition count 251
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 131 place count 94 transition count 247
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 140 place count 85 transition count 220
Iterating global reduction 4 with 9 rules applied. Total rules applied 149 place count 85 transition count 220
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 152 place count 85 transition count 217
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 154 place count 84 transition count 216
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 172 place count 75 transition count 231
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 181 place count 75 transition count 222
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 184 place count 72 transition count 213
Iterating global reduction 5 with 3 rules applied. Total rules applied 187 place count 72 transition count 213
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 190 place count 72 transition count 210
Applied a total of 190 rules in 49 ms. Remains 72 /171 variables (removed 99) and now considering 210/353 (removed 143) transitions.
[2024-06-02 22:38:52] [INFO ] Flow matrix only has 200 transitions (discarded 10 similar events)
// Phase 1: matrix 200 rows 72 cols
[2024-06-02 22:38:52] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 22:38:52] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-02 22:38:52] [INFO ] Flow matrix only has 200 transitions (discarded 10 similar events)
[2024-06-02 22:38:52] [INFO ] Invariant cache hit.
[2024-06-02 22:38:52] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-06-02 22:38:52] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
[2024-06-02 22:38:52] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 22:38:52] [INFO ] Flow matrix only has 200 transitions (discarded 10 similar events)
[2024-06-02 22:38:52] [INFO ] Invariant cache hit.
[2024-06-02 22:38:52] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 72/171 places, 210/353 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 450 ms. Remains : 72/171 places, 210/353 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-23-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s0 1) (AND (NEQ s38 0) (NEQ s19 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 8 reset in 162 ms.
Product exploration explored 100000 steps with 3 reset in 142 ms.
Computed a total of 2 stabilizing places and 7 stable transitions
Computed a total of 2 stabilizing places and 7 stable transitions
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 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 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
[2024-06-02 22:38:53] [INFO ] Flow matrix only has 200 transitions (discarded 10 similar events)
[2024-06-02 22:38:53] [INFO ] Invariant cache hit.
[2024-06-02 22:38:53] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 22:38:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:38:53] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2024-06-02 22:38:53] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-06-02 22:38:53] [INFO ] [Real]Added 35 Read/Feed constraints in 6 ms returned sat
[2024-06-02 22:38:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:38:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 22:38:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:38:54] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2024-06-02 22:38:54] [INFO ] [Nat]Added 35 Read/Feed constraints in 5 ms returned sat
[2024-06-02 22:38:54] [INFO ] Computed and/alt/rep : 76/402/76 causal constraints (skipped 123 transitions) in 22 ms.
[2024-06-02 22:38:54] [INFO ] Added : 0 causal constraints over 0 iterations in 47 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 72 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 72/72 places, 210/210 transitions.
Applied a total of 0 rules in 7 ms. Remains 72 /72 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2024-06-02 22:38:54] [INFO ] Flow matrix only has 200 transitions (discarded 10 similar events)
[2024-06-02 22:38:54] [INFO ] Invariant cache hit.
[2024-06-02 22:38:54] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-02 22:38:54] [INFO ] Flow matrix only has 200 transitions (discarded 10 similar events)
[2024-06-02 22:38:54] [INFO ] Invariant cache hit.
[2024-06-02 22:38:54] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-06-02 22:38:54] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
[2024-06-02 22:38:54] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 22:38:54] [INFO ] Flow matrix only has 200 transitions (discarded 10 similar events)
[2024-06-02 22:38:54] [INFO ] Invariant cache hit.
[2024-06-02 22:38:54] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 448 ms. Remains : 72/72 places, 210/210 transitions.
Computed a total of 2 stabilizing places and 7 stable transitions
Computed a total of 2 stabilizing places and 7 stable transitions
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : [(F 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 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
[2024-06-02 22:38:54] [INFO ] Flow matrix only has 200 transitions (discarded 10 similar events)
[2024-06-02 22:38:54] [INFO ] Invariant cache hit.
[2024-06-02 22:38:55] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 22:38:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:38:55] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-06-02 22:38:55] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-06-02 22:38:55] [INFO ] [Real]Added 35 Read/Feed constraints in 5 ms returned sat
[2024-06-02 22:38:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 22:38:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 22:38:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 22:38:55] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2024-06-02 22:38:55] [INFO ] [Nat]Added 35 Read/Feed constraints in 7 ms returned sat
[2024-06-02 22:38:55] [INFO ] Computed and/alt/rep : 76/402/76 causal constraints (skipped 123 transitions) in 23 ms.
[2024-06-02 22:38:55] [INFO ] Added : 0 causal constraints over 0 iterations in 45 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Product exploration explored 100000 steps with 13 reset in 164 ms.
Product exploration explored 100000 steps with 3 reset in 137 ms.
Built C files in :
/tmp/ltsmin12587285089803214201
[2024-06-02 22:38:55] [INFO ] Computing symmetric may disable matrix : 210 transitions.
[2024-06-02 22:38:55] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:38:55] [INFO ] Computing symmetric may enable matrix : 210 transitions.
[2024-06-02 22:38:55] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:38:55] [INFO ] Computing Do-Not-Accords matrix : 210 transitions.
[2024-06-02 22:38:55] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:38:55] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12587285089803214201
Running compilation step : cd /tmp/ltsmin12587285089803214201;'/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 799 ms.
Running link step : cd /tmp/ltsmin12587285089803214201;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin12587285089803214201;'/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/stateBased11742625909932031841.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 72 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 72/72 places, 210/210 transitions.
Applied a total of 0 rules in 6 ms. Remains 72 /72 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2024-06-02 22:39:10] [INFO ] Flow matrix only has 200 transitions (discarded 10 similar events)
[2024-06-02 22:39:10] [INFO ] Invariant cache hit.
[2024-06-02 22:39:11] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-06-02 22:39:11] [INFO ] Flow matrix only has 200 transitions (discarded 10 similar events)
[2024-06-02 22:39:11] [INFO ] Invariant cache hit.
[2024-06-02 22:39:11] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-06-02 22:39:11] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
[2024-06-02 22:39:11] [INFO ] Redundant transitions in 2 ms returned []
[2024-06-02 22:39:11] [INFO ] Flow matrix only has 200 transitions (discarded 10 similar events)
[2024-06-02 22:39:11] [INFO ] Invariant cache hit.
[2024-06-02 22:39:11] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 455 ms. Remains : 72/72 places, 210/210 transitions.
Built C files in :
/tmp/ltsmin4816108235215304480
[2024-06-02 22:39:11] [INFO ] Computing symmetric may disable matrix : 210 transitions.
[2024-06-02 22:39:11] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:39:11] [INFO ] Computing symmetric may enable matrix : 210 transitions.
[2024-06-02 22:39:11] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:39:11] [INFO ] Computing Do-Not-Accords matrix : 210 transitions.
[2024-06-02 22:39:11] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:39:11] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4816108235215304480
Running compilation step : cd /tmp/ltsmin4816108235215304480;'/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 653 ms.
Running link step : cd /tmp/ltsmin4816108235215304480;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin4816108235215304480;'/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/stateBased5785257409997374955.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-06-02 22:39:26] [INFO ] Flatten gal took : 20 ms
[2024-06-02 22:39:26] [INFO ] Flatten gal took : 19 ms
[2024-06-02 22:39:26] [INFO ] Time to serialize gal into /tmp/LTL5116569962945835605.gal : 5 ms
[2024-06-02 22:39:26] [INFO ] Time to serialize properties into /tmp/LTL1285411398801275966.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5116569962945835605.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4625405503753805272.hoa' '-atoms' '/tmp/LTL1285411398801275966.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL1285411398801275966.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4625405503753805272.hoa
Reverse transition relation is NOT exact ! Due to transitions t61, t113, t236, t237, t238, t243, t244, t245, t274, t275, t276, t284, t285, t286, t336, t337...1162
Computing Next relation with stutter on 50261 deadlock states
Detected timeout of ITS tools.
[2024-06-02 22:39:41] [INFO ] Flatten gal took : 17 ms
[2024-06-02 22:39:41] [INFO ] Flatten gal took : 17 ms
[2024-06-02 22:39:41] [INFO ] Time to serialize gal into /tmp/LTL5476576308413093548.gal : 4 ms
[2024-06-02 22:39:41] [INFO ] Time to serialize properties into /tmp/LTL13684953656818190129.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5476576308413093548.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13684953656818190129.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("((p0!=1)||((p237!=0)&&(p114!=1)))"))))
Formula 0 simplified : GF!"((p0!=1)||((p237!=0)&&(p114!=1)))"
Reverse transition relation is NOT exact ! Due to transitions t61, t113, t236, t237, t238, t243, t244, t245, t274, t275, t276, t284, t285, t286, t336, t337...1162
Computing Next relation with stutter on 50261 deadlock states
Detected timeout of ITS tools.
[2024-06-02 22:39:56] [INFO ] Flatten gal took : 17 ms
[2024-06-02 22:39:56] [INFO ] Applying decomposition
[2024-06-02 22:39:56] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph16366955736640035734.txt' '-o' '/tmp/graph16366955736640035734.bin' '-w' '/tmp/graph16366955736640035734.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16366955736640035734.bin' '-l' '-1' '-v' '-w' '/tmp/graph16366955736640035734.weights' '-q' '0' '-e' '0.001'
[2024-06-02 22:39:56] [INFO ] Decomposing Gal with order
[2024-06-02 22:39:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 22:39:57] [INFO ] Removed a total of 348 redundant transitions.
[2024-06-02 22:39:57] [INFO ] Flatten gal took : 83 ms
[2024-06-02 22:39:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 15 ms.
[2024-06-02 22:39:57] [INFO ] Time to serialize gal into /tmp/LTL1252769684513193507.gal : 5 ms
[2024-06-02 22:39:57] [INFO ] Time to serialize properties into /tmp/LTL14525164819885591633.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1252769684513193507.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14525164819885591633.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G("((i0.u0.p0!=1)||((i4.u8.p237!=0)&&(i2.u5.p114!=1)))"))))
Formula 0 simplified : GF!"((i0.u0.p0!=1)||((i4.u8.p237!=0)&&(i2.u5.p114!=1)))"
Reverse transition relation is NOT exact ! Due to transitions t236, t237, t238, t274, t275, t276, t346, t347, t239_t139_t142_t145_t143_t140, t277_t139_t142...939
Computing Next relation with stutter on 50261 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
255 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.57983,78408,1,0,125881,4279,1764,179190,519,37005,173182
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA MedleyA-PT-23-LTLCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property MedleyA-PT-23-LTLCardinality-13 finished in 67527 ms.
All properties solved by simple procedures.
Total runtime 82708 ms.

BK_STOP 1717368001294

--------------------
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="MedleyA-PT-23"
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 MedleyA-PT-23, 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 r597-smll-171734926500112"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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