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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 4.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 46K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 8.0K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K 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 130K 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-20-LTLCardinality-00
FORMULA_NAME MedleyA-PT-20-LTLCardinality-01
FORMULA_NAME MedleyA-PT-20-LTLCardinality-02
FORMULA_NAME MedleyA-PT-20-LTLCardinality-03
FORMULA_NAME MedleyA-PT-20-LTLCardinality-04
FORMULA_NAME MedleyA-PT-20-LTLCardinality-05
FORMULA_NAME MedleyA-PT-20-LTLCardinality-06
FORMULA_NAME MedleyA-PT-20-LTLCardinality-07
FORMULA_NAME MedleyA-PT-20-LTLCardinality-08
FORMULA_NAME MedleyA-PT-20-LTLCardinality-09
FORMULA_NAME MedleyA-PT-20-LTLCardinality-10
FORMULA_NAME MedleyA-PT-20-LTLCardinality-11
FORMULA_NAME MedleyA-PT-20-LTLCardinality-12
FORMULA_NAME MedleyA-PT-20-LTLCardinality-13
FORMULA_NAME MedleyA-PT-20-LTLCardinality-14
FORMULA_NAME MedleyA-PT-20-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717367312671

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-20
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-06-02 22:28:35] [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:28:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:28:35] [INFO ] Load time of PNML (sax parser for PT used): 126 ms
[2024-06-02 22:28:35] [INFO ] Transformed 273 places.
[2024-06-02 22:28:35] [INFO ] Transformed 518 transitions.
[2024-06-02 22:28:35] [INFO ] Found NUPN structural information;
[2024-06-02 22:28:35] [INFO ] Parsed PT model containing 273 places and 518 transitions and 1795 arcs in 249 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 5 formulas.
FORMULA MedleyA-PT-20-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-20-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-20-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-20-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-20-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-20-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-20-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 273 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 273/273 places, 518/518 transitions.
Discarding 90 places :
Symmetric choice reduction at 0 with 90 rule applications. Total rules 90 place count 183 transition count 428
Iterating global reduction 0 with 90 rules applied. Total rules applied 180 place count 183 transition count 428
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 184 place count 183 transition count 424
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 215 place count 152 transition count 333
Iterating global reduction 1 with 31 rules applied. Total rules applied 246 place count 152 transition count 333
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 248 place count 152 transition count 331
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 258 place count 142 transition count 311
Iterating global reduction 2 with 10 rules applied. Total rules applied 268 place count 142 transition count 311
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 270 place count 142 transition count 309
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 272 place count 140 transition count 303
Iterating global reduction 3 with 2 rules applied. Total rules applied 274 place count 140 transition count 303
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 276 place count 140 transition count 301
Applied a total of 276 rules in 98 ms. Remains 140 /273 variables (removed 133) and now considering 301/518 (removed 217) transitions.
// Phase 1: matrix 301 rows 140 cols
[2024-06-02 22:28:36] [INFO ] Computed 11 invariants in 21 ms
[2024-06-02 22:28:36] [INFO ] Implicit Places using invariants in 421 ms returned []
[2024-06-02 22:28:36] [INFO ] Invariant cache hit.
[2024-06-02 22:28:37] [INFO ] Implicit Places using invariants and state equation in 414 ms returned []
Implicit Place search using SMT with State Equation took 886 ms to find 0 implicit places.
[2024-06-02 22:28:37] [INFO ] Invariant cache hit.
[2024-06-02 22:28:37] [INFO ] Dead Transitions using invariants and state equation in 288 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 140/273 places, 301/518 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1274 ms. Remains : 140/273 places, 301/518 transitions.
Support contains 23 out of 140 places after structural reductions.
[2024-06-02 22:28:37] [INFO ] Flatten gal took : 82 ms
[2024-06-02 22:28:37] [INFO ] Flatten gal took : 34 ms
[2024-06-02 22:28:37] [INFO ] Input system was already deterministic with 301 transitions.
Incomplete random walk after 10000 steps, including 12 resets, run finished after 570 ms. (steps per millisecond=17 ) properties (out of 14) seen :8
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 5) seen :2
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 :1
Running SMT prover for 2 properties.
[2024-06-02 22:28:38] [INFO ] Invariant cache hit.
[2024-06-02 22:28:38] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 22:28:39] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2024-06-02 22:28:39] [INFO ] [Nat]Absence check using 9 positive and 2 generalized place invariants in 6 ms returned sat
[2024-06-02 22:28:39] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-02 22:28:39] [INFO ] After 199ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 37 ms.
[2024-06-02 22:28:39] [INFO ] After 343ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 301/301 transitions.
Graph (trivial) has 108 edges and 140 vertex of which 16 / 140 are part of one of the 3 SCC in 4 ms
Free SCC test removed 13 places
Drop transitions removed 23 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 26 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 127 transition count 272
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 124 transition count 270
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 9 place count 124 transition count 261
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 27 place count 115 transition count 261
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 29 place count 115 transition count 259
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 41 place count 103 transition count 239
Iterating global reduction 3 with 12 rules applied. Total rules applied 53 place count 103 transition count 239
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 57 place count 103 transition count 235
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 59 place count 102 transition count 234
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 59 place count 102 transition count 233
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 61 place count 101 transition count 233
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 62 place count 101 transition count 232
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 63 place count 100 transition count 229
Iterating global reduction 6 with 1 rules applied. Total rules applied 64 place count 100 transition count 229
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 65 place count 100 transition count 228
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 7 with 30 rules applied. Total rules applied 95 place count 85 transition count 213
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 102 place count 78 transition count 192
Iterating global reduction 7 with 7 rules applied. Total rules applied 109 place count 78 transition count 192
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 113 place count 78 transition count 188
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 8 with 12 rules applied. Total rules applied 125 place count 72 transition count 200
Free-agglomeration rule applied 20 times.
Iterating global reduction 8 with 20 rules applied. Total rules applied 145 place count 72 transition count 180
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 26 rules applied. Total rules applied 171 place count 52 transition count 174
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 9 with 6 rules applied. Total rules applied 177 place count 49 transition count 171
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 178 place count 48 transition count 170
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 179 place count 47 transition count 170
Applied a total of 179 rules in 113 ms. Remains 47 /140 variables (removed 93) and now considering 170/301 (removed 131) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 47/140 places, 170/301 transitions.
Finished random walk after 35 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=11 )
Parikh walk visited 0 properties in 0 ms.
FORMULA MedleyA-PT-20-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 15 stabilizing places and 20 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||G(F(p1))))))'
Support contains 3 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 301/301 transitions.
Graph (trivial) has 109 edges and 140 vertex of which 16 / 140 are part of one of the 3 SCC in 1 ms
Free SCC test removed 13 places
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 126 transition count 272
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 121 transition count 270
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 13 place count 121 transition count 261
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 31 place count 112 transition count 261
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 42 place count 101 transition count 244
Iterating global reduction 2 with 11 rules applied. Total rules applied 53 place count 101 transition count 244
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 56 place count 101 transition count 241
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 58 place count 100 transition count 240
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 58 place count 100 transition count 239
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 60 place count 99 transition count 239
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 61 place count 98 transition count 236
Iterating global reduction 4 with 1 rules applied. Total rules applied 62 place count 98 transition count 236
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 63 place count 98 transition count 235
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 87 place count 86 transition count 223
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 94 place count 79 transition count 202
Iterating global reduction 5 with 7 rules applied. Total rules applied 101 place count 79 transition count 202
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 105 place count 79 transition count 198
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 117 place count 73 transition count 208
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 120 place count 73 transition count 205
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 121 place count 72 transition count 202
Iterating global reduction 6 with 1 rules applied. Total rules applied 122 place count 72 transition count 202
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 123 place count 72 transition count 201
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 125 place count 70 transition count 199
Applied a total of 125 rules in 76 ms. Remains 70 /140 variables (removed 70) and now considering 199/301 (removed 102) transitions.
[2024-06-02 22:28:39] [INFO ] Flow matrix only has 189 transitions (discarded 10 similar events)
// Phase 1: matrix 189 rows 70 cols
[2024-06-02 22:28:39] [INFO ] Computed 11 invariants in 6 ms
[2024-06-02 22:28:39] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-06-02 22:28:39] [INFO ] Flow matrix only has 189 transitions (discarded 10 similar events)
[2024-06-02 22:28:39] [INFO ] Invariant cache hit.
[2024-06-02 22:28:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:28:40] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2024-06-02 22:28:40] [INFO ] Redundant transitions in 9 ms returned []
[2024-06-02 22:28:40] [INFO ] Flow matrix only has 189 transitions (discarded 10 similar events)
[2024-06-02 22:28:40] [INFO ] Invariant cache hit.
[2024-06-02 22:28:40] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 70/140 places, 199/301 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 572 ms. Remains : 70/140 places, 199/301 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 256 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-20-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s44 1), p1:(OR (EQ s23 0) (EQ s57 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 1 reset in 339 ms.
Stuttering criterion allowed to conclude after 21 steps with 2 reset in 1 ms.
FORMULA MedleyA-PT-20-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-20-LTLCardinality-01 finished in 1255 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 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 301/301 transitions.
Graph (trivial) has 111 edges and 140 vertex of which 16 / 140 are part of one of the 3 SCC in 0 ms
Free SCC test removed 13 places
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 126 transition count 272
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 121 transition count 270
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 13 place count 121 transition count 261
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 31 place count 112 transition count 261
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 43 place count 100 transition count 241
Iterating global reduction 2 with 12 rules applied. Total rules applied 55 place count 100 transition count 241
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 59 place count 100 transition count 237
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 61 place count 99 transition count 236
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 62 place count 98 transition count 233
Iterating global reduction 4 with 1 rules applied. Total rules applied 63 place count 98 transition count 233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 64 place count 98 transition count 232
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 90 place count 85 transition count 219
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 97 place count 78 transition count 198
Iterating global reduction 5 with 7 rules applied. Total rules applied 104 place count 78 transition count 198
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 108 place count 78 transition count 194
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 122 place count 71 transition count 207
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 125 place count 71 transition count 204
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 126 place count 70 transition count 201
Iterating global reduction 6 with 1 rules applied. Total rules applied 127 place count 70 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 128 place count 70 transition count 200
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 129 place count 69 transition count 199
Applied a total of 129 rules in 69 ms. Remains 69 /140 variables (removed 71) and now considering 199/301 (removed 102) transitions.
[2024-06-02 22:28:40] [INFO ] Flow matrix only has 190 transitions (discarded 9 similar events)
// Phase 1: matrix 190 rows 69 cols
[2024-06-02 22:28:40] [INFO ] Computed 11 invariants in 1 ms
[2024-06-02 22:28:41] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-02 22:28:41] [INFO ] Flow matrix only has 190 transitions (discarded 9 similar events)
[2024-06-02 22:28:41] [INFO ] Invariant cache hit.
[2024-06-02 22:28:41] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-06-02 22:28:41] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
[2024-06-02 22:28:41] [INFO ] Redundant transitions in 10 ms returned []
[2024-06-02 22:28:41] [INFO ] Flow matrix only has 190 transitions (discarded 9 similar events)
[2024-06-02 22:28:41] [INFO ] Invariant cache hit.
[2024-06-02 22:28:41] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/140 places, 199/301 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 538 ms. Remains : 69/140 places, 199/301 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-20-LTLCardinality-02 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 s57 0) (EQ s10 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 102 steps with 5 reset in 1 ms.
FORMULA MedleyA-PT-20-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-20-LTLCardinality-02 finished in 644 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||X(p1)))))'
Support contains 2 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 301/301 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 126 transition count 278
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 126 transition count 278
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 31 place count 126 transition count 275
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 38 place count 119 transition count 259
Iterating global reduction 1 with 7 rules applied. Total rules applied 45 place count 119 transition count 259
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 46 place count 119 transition count 258
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 118 transition count 255
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 118 transition count 255
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 49 place count 118 transition count 254
Applied a total of 49 rules in 14 ms. Remains 118 /140 variables (removed 22) and now considering 254/301 (removed 47) transitions.
// Phase 1: matrix 254 rows 118 cols
[2024-06-02 22:28:41] [INFO ] Computed 11 invariants in 4 ms
[2024-06-02 22:28:41] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-06-02 22:28:41] [INFO ] Invariant cache hit.
[2024-06-02 22:28:41] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
[2024-06-02 22:28:41] [INFO ] Invariant cache hit.
[2024-06-02 22:28:42] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 118/140 places, 254/301 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 551 ms. Remains : 118/140 places, 254/301 transitions.
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true]
Running random walk in product with property : MedleyA-PT-20-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(EQ s41 1), p1:(EQ s62 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-20-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-20-LTLCardinality-03 finished in 746 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 301/301 transitions.
Graph (trivial) has 111 edges and 140 vertex of which 16 / 140 are part of one of the 3 SCC in 1 ms
Free SCC test removed 13 places
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 126 transition count 272
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 121 transition count 270
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 13 place count 121 transition count 261
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 31 place count 112 transition count 261
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 43 place count 100 transition count 241
Iterating global reduction 2 with 12 rules applied. Total rules applied 55 place count 100 transition count 241
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 59 place count 100 transition count 237
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 61 place count 99 transition count 236
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 61 place count 99 transition count 235
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 63 place count 98 transition count 235
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 64 place count 97 transition count 232
Iterating global reduction 4 with 1 rules applied. Total rules applied 65 place count 97 transition count 232
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 66 place count 97 transition count 231
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 90 place count 85 transition count 219
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 96 place count 79 transition count 201
Iterating global reduction 5 with 6 rules applied. Total rules applied 102 place count 79 transition count 201
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 106 place count 79 transition count 197
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 120 place count 72 transition count 210
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 123 place count 72 transition count 207
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 124 place count 71 transition count 204
Iterating global reduction 6 with 1 rules applied. Total rules applied 125 place count 71 transition count 204
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 126 place count 71 transition count 203
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 127 place count 70 transition count 202
Applied a total of 127 rules in 69 ms. Remains 70 /140 variables (removed 70) and now considering 202/301 (removed 99) transitions.
[2024-06-02 22:28:42] [INFO ] Flow matrix only has 192 transitions (discarded 10 similar events)
// Phase 1: matrix 192 rows 70 cols
[2024-06-02 22:28:42] [INFO ] Computed 11 invariants in 2 ms
[2024-06-02 22:28:42] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-02 22:28:42] [INFO ] Flow matrix only has 192 transitions (discarded 10 similar events)
[2024-06-02 22:28:42] [INFO ] Invariant cache hit.
[2024-06-02 22:28:42] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-06-02 22:28:42] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
[2024-06-02 22:28:42] [INFO ] Redundant transitions in 2 ms returned []
[2024-06-02 22:28:42] [INFO ] Flow matrix only has 192 transitions (discarded 10 similar events)
[2024-06-02 22:28:42] [INFO ] Invariant cache hit.
[2024-06-02 22:28:42] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 70/140 places, 202/301 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 495 ms. Remains : 70/140 places, 202/301 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-20-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s46 0) (EQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-20-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-20-LTLCardinality-06 finished in 557 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&G(p1)))))'
Support contains 4 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 301/301 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 129 transition count 283
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 129 transition count 283
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 129 transition count 281
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 29 place count 124 transition count 271
Iterating global reduction 1 with 5 rules applied. Total rules applied 34 place count 124 transition count 271
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 123 transition count 268
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 123 transition count 268
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 37 place count 123 transition count 267
Applied a total of 37 rules in 12 ms. Remains 123 /140 variables (removed 17) and now considering 267/301 (removed 34) transitions.
// Phase 1: matrix 267 rows 123 cols
[2024-06-02 22:28:42] [INFO ] Computed 11 invariants in 3 ms
[2024-06-02 22:28:42] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-06-02 22:28:42] [INFO ] Invariant cache hit.
[2024-06-02 22:28:43] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
[2024-06-02 22:28:43] [INFO ] Invariant cache hit.
[2024-06-02 22:28:43] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 123/140 places, 267/301 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 590 ms. Remains : 123/140 places, 267/301 transitions.
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : MedleyA-PT-20-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s89 0) (EQ s40 1)), p1:(OR (EQ s65 0) (EQ s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1 reset in 240 ms.
Product exploration explored 100000 steps with 1 reset in 283 ms.
Computed a total of 10 stabilizing places and 15 stable transitions
Computed a total of 10 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 96 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2024-06-02 22:28:44] [INFO ] Invariant cache hit.
[2024-06-02 22:28:44] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:28:44] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-02 22:28:44] [INFO ] [Nat]Absence check using 10 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-02 22:28:44] [INFO ] After 128ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 22:28:45] [INFO ] After 150ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-06-02 22:28:45] [INFO ] After 230ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 32 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=16 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (OR (NOT p0) (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 6 factoid took 187 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 4 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 267/267 transitions.
Applied a total of 0 rules in 1 ms. Remains 123 /123 variables (removed 0) and now considering 267/267 (removed 0) transitions.
[2024-06-02 22:28:45] [INFO ] Invariant cache hit.
[2024-06-02 22:28:45] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-06-02 22:28:45] [INFO ] Invariant cache hit.
[2024-06-02 22:28:45] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
[2024-06-02 22:28:45] [INFO ] Invariant cache hit.
[2024-06-02 22:28:46] [INFO ] Dead Transitions using invariants and state equation in 212 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 634 ms. Remains : 123/123 places, 267/267 transitions.
Computed a total of 10 stabilizing places and 15 stable transitions
Computed a total of 10 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 109 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 286 ms. (steps per millisecond=34 ) properties (out of 3) seen :0
Finished Best-First random walk after 1266 steps, including 7 resets, run visited all 3 properties in 3 ms. (steps per millisecond=422 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (OR (NOT p0) (NOT p1))), (F (NOT p1)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 6 factoid took 191 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 5 reset in 165 ms.
Product exploration explored 100000 steps with 7 reset in 253 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 4 out of 123 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 123/123 places, 267/267 transitions.
Graph (trivial) has 92 edges and 123 vertex of which 15 / 123 are part of one of the 3 SCC in 0 ms
Free SCC test removed 12 places
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 111 transition count 246
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 111 transition count 243
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 7 place count 111 transition count 246
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 10 place count 111 transition count 246
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 32 place count 111 transition count 246
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 36 place count 107 transition count 236
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 40 place count 107 transition count 236
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 43 place count 107 transition count 233
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 3 with 5 rules applied. Total rules applied 48 place count 107 transition count 263
Deduced a syphon composed of 32 places in 0 ms
Applied a total of 48 rules in 47 ms. Remains 107 /123 variables (removed 16) and now considering 263/267 (removed 4) transitions.
[2024-06-02 22:28:48] [INFO ] Redundant transitions in 3 ms returned []
[2024-06-02 22:28:48] [INFO ] Flow matrix only has 253 transitions (discarded 10 similar events)
// Phase 1: matrix 253 rows 107 cols
[2024-06-02 22:28:48] [INFO ] Computed 11 invariants in 3 ms
[2024-06-02 22:28:48] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 107/123 places, 263/267 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 238 ms. Remains : 107/123 places, 263/267 transitions.
Built C files in :
/tmp/ltsmin4862379989559071409
[2024-06-02 22:28:48] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4862379989559071409
Running compilation step : cd /tmp/ltsmin4862379989559071409;'/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 872 ms.
Running link step : cd /tmp/ltsmin4862379989559071409;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin4862379989559071409;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7719797518417552536.hoa' '--buchi-type=spotba'
LTSmin run took 860 ms.
FORMULA MedleyA-PT-20-LTLCardinality-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-20-LTLCardinality-10 finished in 7458 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)||X((X(G(p2))||p1)))))'
Support contains 4 out of 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 301/301 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 128 transition count 282
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 128 transition count 282
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 27 place count 128 transition count 279
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 33 place count 122 transition count 263
Iterating global reduction 1 with 6 rules applied. Total rules applied 39 place count 122 transition count 263
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 41 place count 122 transition count 261
Applied a total of 41 rules in 10 ms. Remains 122 /140 variables (removed 18) and now considering 261/301 (removed 40) transitions.
// Phase 1: matrix 261 rows 122 cols
[2024-06-02 22:28:50] [INFO ] Computed 11 invariants in 2 ms
[2024-06-02 22:28:50] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-06-02 22:28:50] [INFO ] Invariant cache hit.
[2024-06-02 22:28:50] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
[2024-06-02 22:28:50] [INFO ] Invariant cache hit.
[2024-06-02 22:28:50] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 122/140 places, 261/301 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 548 ms. Remains : 122/140 places, 261/301 transitions.
Stuttering acceptance computed with spot in 325 ms :[true, (NOT p2), (AND (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-20-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}, { cond=p2, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 1}, { cond=(AND p0 p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 6}, { cond=p0, acceptance={} source=5 dest: 7}], [{ cond=(NOT p1), acceptance={} source=6 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 2}]], initial=4, aps=[p2:(OR (EQ s58 0) (EQ s62 1)), p0:(OR (EQ s56 0) (EQ s92 1)), p1:(OR (EQ s56 0) (EQ s92 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 284 ms.
Product exploration explored 100000 steps with 33333 reset in 286 ms.
Computed a total of 12 stabilizing places and 17 stable transitions
Computed a total of 12 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X p0), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 28 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-20-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-20-LTLCardinality-11 finished in 1503 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 140 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 140/140 places, 301/301 transitions.
Graph (trivial) has 107 edges and 140 vertex of which 15 / 140 are part of one of the 3 SCC in 0 ms
Free SCC test removed 12 places
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 127 transition count 276
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 123 transition count 274
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 11 place count 123 transition count 265
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 29 place count 114 transition count 265
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 41 place count 102 transition count 245
Iterating global reduction 2 with 12 rules applied. Total rules applied 53 place count 102 transition count 245
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 57 place count 102 transition count 241
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 59 place count 101 transition count 240
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 59 place count 101 transition count 239
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 61 place count 100 transition count 239
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 62 place count 99 transition count 236
Iterating global reduction 4 with 1 rules applied. Total rules applied 63 place count 99 transition count 236
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 64 place count 99 transition count 235
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 90 place count 86 transition count 222
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 97 place count 79 transition count 201
Iterating global reduction 5 with 7 rules applied. Total rules applied 104 place count 79 transition count 201
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 108 place count 79 transition count 197
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 122 place count 72 transition count 210
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 126 place count 72 transition count 206
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 127 place count 71 transition count 203
Iterating global reduction 6 with 1 rules applied. Total rules applied 128 place count 71 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 129 place count 71 transition count 202
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 131 place count 69 transition count 200
Applied a total of 131 rules in 54 ms. Remains 69 /140 variables (removed 71) and now considering 200/301 (removed 101) transitions.
[2024-06-02 22:28:51] [INFO ] Flow matrix only has 190 transitions (discarded 10 similar events)
// Phase 1: matrix 190 rows 69 cols
[2024-06-02 22:28:51] [INFO ] Computed 11 invariants in 2 ms
[2024-06-02 22:28:51] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-02 22:28:51] [INFO ] Flow matrix only has 190 transitions (discarded 10 similar events)
[2024-06-02 22:28:51] [INFO ] Invariant cache hit.
[2024-06-02 22:28:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:28:52] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
[2024-06-02 22:28:52] [INFO ] Redundant transitions in 2 ms returned []
[2024-06-02 22:28:52] [INFO ] Flow matrix only has 190 transitions (discarded 10 similar events)
[2024-06-02 22:28:52] [INFO ] Invariant cache hit.
[2024-06-02 22:28:52] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/140 places, 200/301 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 462 ms. Remains : 69/140 places, 200/301 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-20-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s37 0) (EQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-20-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-20-LTLCardinality-14 finished in 526 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 140 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 140/140 places, 301/301 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 125 transition count 277
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 125 transition count 277
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 33 place count 125 transition count 274
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 41 place count 117 transition count 255
Iterating global reduction 1 with 8 rules applied. Total rules applied 49 place count 117 transition count 255
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 51 place count 117 transition count 253
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 116 transition count 250
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 116 transition count 250
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 54 place count 116 transition count 249
Applied a total of 54 rules in 10 ms. Remains 116 /140 variables (removed 24) and now considering 249/301 (removed 52) transitions.
// Phase 1: matrix 249 rows 116 cols
[2024-06-02 22:28:52] [INFO ] Computed 11 invariants in 3 ms
[2024-06-02 22:28:52] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-06-02 22:28:52] [INFO ] Invariant cache hit.
[2024-06-02 22:28:52] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
[2024-06-02 22:28:52] [INFO ] Invariant cache hit.
[2024-06-02 22:28:52] [INFO ] Dead Transitions using invariants and state equation in 203 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 116/140 places, 249/301 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 542 ms. Remains : 116/140 places, 249/301 transitions.
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-20-LTLCardinality-15 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 s17 0) (EQ s79 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 581 steps with 17 reset in 1 ms.
FORMULA MedleyA-PT-20-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-20-LTLCardinality-15 finished in 675 ms.
All properties solved by simple procedures.
Total runtime 17459 ms.

BK_STOP 1717367334134

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ 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-20"
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-20, 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-171734926500097"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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