Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 7.6K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.1K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K 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 90K Jun 2 16:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717370320834

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-15
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-06-02 23:18:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 23:18:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 23:18:42] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2024-06-02 23:18:42] [INFO ] Transformed 248 places.
[2024-06-02 23:18:42] [INFO ] Transformed 383 transitions.
[2024-06-02 23:18:42] [INFO ] Found NUPN structural information;
[2024-06-02 23:18:42] [INFO ] Parsed PT model containing 248 places and 383 transitions and 1144 arcs in 121 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA FireWire-PT-15-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-15-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-15-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-15-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-15-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-15-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-15-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-15-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-15-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-15-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 out of 248 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 383/383 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 245 transition count 383
Discarding 53 places :
Symmetric choice reduction at 1 with 53 rule applications. Total rules 56 place count 192 transition count 330
Iterating global reduction 1 with 53 rules applied. Total rules applied 109 place count 192 transition count 330
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 110 place count 192 transition count 329
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 124 place count 178 transition count 283
Iterating global reduction 2 with 14 rules applied. Total rules applied 138 place count 178 transition count 283
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 139 place count 178 transition count 282
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 143 place count 174 transition count 276
Iterating global reduction 3 with 4 rules applied. Total rules applied 147 place count 174 transition count 276
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 148 place count 174 transition count 275
Applied a total of 148 rules in 50 ms. Remains 174 /248 variables (removed 74) and now considering 275/383 (removed 108) transitions.
// Phase 1: matrix 275 rows 174 cols
[2024-06-02 23:18:42] [INFO ] Computed 4 invariants in 18 ms
[2024-06-02 23:18:43] [INFO ] Implicit Places using invariants in 387 ms returned []
[2024-06-02 23:18:43] [INFO ] Invariant cache hit.
[2024-06-02 23:18:43] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 591 ms to find 0 implicit places.
[2024-06-02 23:18:43] [INFO ] Invariant cache hit.
[2024-06-02 23:18:43] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 174/248 places, 275/383 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 759 ms. Remains : 174/248 places, 275/383 transitions.
Support contains 15 out of 174 places after structural reductions.
[2024-06-02 23:18:43] [INFO ] Flatten gal took : 46 ms
[2024-06-02 23:18:43] [INFO ] Flatten gal took : 19 ms
[2024-06-02 23:18:43] [INFO ] Input system was already deterministic with 275 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 371 ms. (steps per millisecond=26 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2024-06-02 23:18:44] [INFO ] Invariant cache hit.
[2024-06-02 23:18:45] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-02 23:18:45] [INFO ] After 88ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:6
[2024-06-02 23:18:45] [INFO ] After 127ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:7
[2024-06-02 23:18:45] [INFO ] After 219ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-06-02 23:18:45] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-02 23:18:45] [INFO ] After 124ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-06-02 23:18:45] [INFO ] Deduced a trap composed of 82 places in 71 ms of which 5 ms to minimize.
[2024-06-02 23:18:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2024-06-02 23:18:45] [INFO ] After 375ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 75 ms.
[2024-06-02 23:18:45] [INFO ] After 542ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 82 ms.
Support contains 11 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 275/275 transitions.
Graph (trivial) has 117 edges and 174 vertex of which 11 / 174 are part of one of the 3 SCC in 2 ms
Free SCC test removed 8 places
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 166 transition count 243
Reduce places removed 19 places and 0 transitions.
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 1 with 22 rules applied. Total rules applied 42 place count 147 transition count 240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 43 place count 146 transition count 240
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 43 place count 146 transition count 227
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 69 place count 133 transition count 227
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 99 place count 118 transition count 212
Performed 15 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 129 place count 103 transition count 274
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 131 place count 103 transition count 272
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 141 place count 103 transition count 262
Free-agglomeration rule applied 11 times.
Iterating global reduction 4 with 11 rules applied. Total rules applied 152 place count 103 transition count 251
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 163 place count 92 transition count 251
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 165 place count 90 transition count 249
Iterating global reduction 5 with 2 rules applied. Total rules applied 167 place count 90 transition count 249
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 171 place count 90 transition count 245
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 175 place count 90 transition count 241
Applied a total of 175 rules in 61 ms. Remains 90 /174 variables (removed 84) and now considering 241/275 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 90/174 places, 241/275 transitions.
Incomplete random walk after 10000 steps, including 888 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 325 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 329 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 315 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 317 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 313 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 323 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 312 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 7) seen :0
Finished probabilistic random walk after 34115 steps, run visited all 7 properties in 108 ms. (steps per millisecond=315 )
Probabilistic random walk after 34115 steps, saw 11198 distinct states, run finished after 108 ms. (steps per millisecond=315 ) properties seen :7
Parikh walk visited 0 properties in 0 ms.
FORMULA FireWire-PT-15-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 46 stabilizing places and 70 stable transitions
Graph (complete) has 508 edges and 174 vertex of which 172 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 275/275 transitions.
Graph (trivial) has 125 edges and 174 vertex of which 11 / 174 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 498 edges and 166 vertex of which 164 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 23 place count 163 transition count 244
Reduce places removed 21 places and 0 transitions.
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 1 with 24 rules applied. Total rules applied 47 place count 142 transition count 241
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 48 place count 141 transition count 241
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 48 place count 141 transition count 227
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 76 place count 127 transition count 227
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 82 place count 121 transition count 219
Iterating global reduction 3 with 6 rules applied. Total rules applied 88 place count 121 transition count 219
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 88 place count 121 transition count 218
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 90 place count 120 transition count 218
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 92 place count 118 transition count 215
Iterating global reduction 3 with 2 rules applied. Total rules applied 94 place count 118 transition count 215
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 95 place count 117 transition count 212
Iterating global reduction 3 with 1 rules applied. Total rules applied 96 place count 117 transition count 212
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 97 place count 116 transition count 210
Iterating global reduction 3 with 1 rules applied. Total rules applied 98 place count 116 transition count 210
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 99 place count 115 transition count 207
Iterating global reduction 3 with 1 rules applied. Total rules applied 100 place count 115 transition count 207
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 101 place count 114 transition count 205
Iterating global reduction 3 with 1 rules applied. Total rules applied 102 place count 114 transition count 205
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 103 place count 113 transition count 202
Iterating global reduction 3 with 1 rules applied. Total rules applied 104 place count 113 transition count 202
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 105 place count 112 transition count 200
Iterating global reduction 3 with 1 rules applied. Total rules applied 106 place count 112 transition count 200
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 107 place count 111 transition count 197
Iterating global reduction 3 with 1 rules applied. Total rules applied 108 place count 111 transition count 197
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 109 place count 110 transition count 195
Iterating global reduction 3 with 1 rules applied. Total rules applied 110 place count 110 transition count 195
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 111 place count 109 transition count 193
Iterating global reduction 3 with 1 rules applied. Total rules applied 112 place count 109 transition count 193
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 113 place count 108 transition count 191
Iterating global reduction 3 with 1 rules applied. Total rules applied 114 place count 108 transition count 191
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 3 with 26 rules applied. Total rules applied 140 place count 95 transition count 178
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 141 place count 94 transition count 176
Iterating global reduction 3 with 1 rules applied. Total rules applied 142 place count 94 transition count 176
Performed 16 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 174 place count 78 transition count 241
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 3 with 15 rules applied. Total rules applied 189 place count 78 transition count 226
Applied a total of 189 rules in 60 ms. Remains 78 /174 variables (removed 96) and now considering 226/275 (removed 49) transitions.
[2024-06-02 23:18:46] [INFO ] Flow matrix only has 215 transitions (discarded 11 similar events)
// Phase 1: matrix 215 rows 78 cols
[2024-06-02 23:18:46] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 23:18:47] [INFO ] Implicit Places using invariants in 233 ms returned []
[2024-06-02 23:18:47] [INFO ] Flow matrix only has 215 transitions (discarded 11 similar events)
[2024-06-02 23:18:47] [INFO ] Invariant cache hit.
[2024-06-02 23:18:47] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-06-02 23:18:47] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 500 ms to find 0 implicit places.
[2024-06-02 23:18:47] [INFO ] Redundant transitions in 9 ms returned []
[2024-06-02 23:18:47] [INFO ] Flow matrix only has 215 transitions (discarded 11 similar events)
[2024-06-02 23:18:47] [INFO ] Invariant cache hit.
[2024-06-02 23:18:47] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 78/174 places, 226/275 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 676 ms. Remains : 78/174 places, 226/275 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 137 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-15-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s32 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 0 steps with 0 reset in 2 ms.
FORMULA FireWire-PT-15-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-15-LTLCardinality-02 finished in 864 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 275/275 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 173 transition count 275
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 166 transition count 266
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 166 transition count 266
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 163 transition count 261
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 163 transition count 261
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 162 transition count 258
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 162 transition count 258
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 161 transition count 256
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 161 transition count 256
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 160 transition count 253
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 160 transition count 253
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 159 transition count 251
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 159 transition count 251
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 158 transition count 248
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 158 transition count 248
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 157 transition count 246
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 157 transition count 246
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 156 transition count 243
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 156 transition count 243
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 155 transition count 241
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 155 transition count 241
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 154 transition count 239
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 154 transition count 239
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 153 transition count 237
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 153 transition count 237
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 152 transition count 236
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 152 transition count 236
Applied a total of 43 rules in 29 ms. Remains 152 /174 variables (removed 22) and now considering 236/275 (removed 39) transitions.
// Phase 1: matrix 236 rows 152 cols
[2024-06-02 23:18:47] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 23:18:47] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-06-02 23:18:47] [INFO ] Invariant cache hit.
[2024-06-02 23:18:47] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
[2024-06-02 23:18:47] [INFO ] Invariant cache hit.
[2024-06-02 23:18:47] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 152/174 places, 236/275 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 386 ms. Remains : 152/174 places, 236/275 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : FireWire-PT-15-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s131 0) (EQ s40 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-15-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-15-LTLCardinality-06 finished in 484 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((!X((X(F(p0))||X(p1))) U p2)))'
Support contains 5 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 275/275 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 172 transition count 275
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 7 place count 167 transition count 270
Iterating global reduction 1 with 5 rules applied. Total rules applied 12 place count 167 transition count 270
Applied a total of 12 rules in 6 ms. Remains 167 /174 variables (removed 7) and now considering 270/275 (removed 5) transitions.
// Phase 1: matrix 270 rows 167 cols
[2024-06-02 23:18:48] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 23:18:48] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-02 23:18:48] [INFO ] Invariant cache hit.
[2024-06-02 23:18:48] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2024-06-02 23:18:48] [INFO ] Invariant cache hit.
[2024-06-02 23:18:48] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 167/174 places, 270/275 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 337 ms. Remains : 167/174 places, 270/275 transitions.
Stuttering acceptance computed with spot in 213 ms :[(NOT p2), (OR (NOT p2) p0 p1), (OR p1 p0), true, p0]
Running random walk in product with property : FireWire-PT-15-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0} source=1 dest: 2}], [{ cond=(OR p1 p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(OR (EQ s130 0) (EQ s85 1) (EQ s141 1)), p1:(OR (EQ s74 0) (EQ s0 1)), p0:(OR (EQ s130 0) (EQ s85 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 215 ms.
Product exploration explored 100000 steps with 2 reset in 109 ms.
Computed a total of 42 stabilizing places and 68 stable transitions
Computed a total of 42 stabilizing places and 68 stable transitions
Detected a total of 42/167 stabilizing places and 68/270 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 p1 p0), (X p2), true, (X (X (OR p1 p0))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 130 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(NOT p2), (OR (NOT p2) p1 p0), (OR p1 p0), true, p0]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 1210582 steps, run timeout after 3001 ms. (steps per millisecond=403 ) properties seen :{0=1, 3=1}
Probabilistic random walk after 1210582 steps, saw 265285 distinct states, run finished after 3001 ms. (steps per millisecond=403 ) properties seen :2
Running SMT prover for 2 properties.
[2024-06-02 23:18:52] [INFO ] Invariant cache hit.
[2024-06-02 23:18:52] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 23:18:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-02 23:18:52] [INFO ] After 43ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 p0), (X p2), true, (X (X (OR p1 p0))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p0) (NOT p1)))), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p2))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be false thanks to negative knowledge :(F (NOT p2))
Knowledge based reduction with 9 factoid took 159 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-15-LTLCardinality-10 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-15-LTLCardinality-10 finished in 5044 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((X(X(p0))||(G(F(p1)) U !p0)))))'
Support contains 4 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 275/275 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 172 transition count 275
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 11 place count 163 transition count 264
Iterating global reduction 1 with 9 rules applied. Total rules applied 20 place count 163 transition count 264
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 23 place count 160 transition count 259
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 160 transition count 259
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 159 transition count 256
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 159 transition count 256
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 158 transition count 254
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 158 transition count 254
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 157 transition count 251
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 157 transition count 251
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 156 transition count 249
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 156 transition count 249
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 155 transition count 246
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 155 transition count 246
Applied a total of 36 rules in 20 ms. Remains 155 /174 variables (removed 19) and now considering 246/275 (removed 29) transitions.
// Phase 1: matrix 246 rows 155 cols
[2024-06-02 23:18:53] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 23:18:53] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-02 23:18:53] [INFO ] Invariant cache hit.
[2024-06-02 23:18:53] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2024-06-02 23:18:53] [INFO ] Invariant cache hit.
[2024-06-02 23:18:53] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 155/174 places, 246/275 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 287 ms. Remains : 155/174 places, 246/275 transitions.
Stuttering acceptance computed with spot in 180 ms :[false, false, false, false, false]
Running random walk in product with property : FireWire-PT-15-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s144 0) (EQ s69 1)), p1:(OR (EQ s62 0) (EQ s55 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 116 ms.
Product exploration explored 100000 steps with 1 reset in 107 ms.
Computed a total of 34 stabilizing places and 48 stable transitions
Computed a total of 34 stabilizing places and 48 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 76 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[false, false, false, false, false]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-06-02 23:18:54] [INFO ] Invariant cache hit.
[2024-06-02 23:18:54] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 23:18:54] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 23:18:54] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 23:18:54] [INFO ] After 82ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-06-02 23:18:54] [INFO ] After 126ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 246/246 transitions.
Graph (trivial) has 115 edges and 155 vertex of which 11 / 155 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 147 transition count 217
Reduce places removed 16 places and 0 transitions.
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 1 with 19 rules applied. Total rules applied 36 place count 131 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 37 place count 130 transition count 214
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 37 place count 130 transition count 196
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 73 place count 112 transition count 196
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 93 place count 102 transition count 186
Performed 17 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 127 place count 85 transition count 254
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 130 place count 85 transition count 251
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 145 place count 85 transition count 236
Free-agglomeration rule applied 7 times.
Iterating global reduction 4 with 7 rules applied. Total rules applied 152 place count 85 transition count 229
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 159 place count 78 transition count 229
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 160 place count 77 transition count 228
Iterating global reduction 5 with 1 rules applied. Total rules applied 161 place count 77 transition count 228
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 164 place count 77 transition count 225
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 165 place count 76 transition count 224
Applied a total of 165 rules in 38 ms. Remains 76 /155 variables (removed 79) and now considering 224/246 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 76/155 places, 224/246 transitions.
Incomplete random walk after 10000 steps, including 838 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished Best-First random walk after 237 steps, including 5 resets, run visited all 1 properties in 1 ms. (steps per millisecond=237 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 146 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[false, false, false, false, false]
Stuttering acceptance computed with spot in 163 ms :[false, false, false, false, false]
Support contains 4 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 246/246 transitions.
Applied a total of 0 rules in 3 ms. Remains 155 /155 variables (removed 0) and now considering 246/246 (removed 0) transitions.
[2024-06-02 23:18:54] [INFO ] Invariant cache hit.
[2024-06-02 23:18:54] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-02 23:18:54] [INFO ] Invariant cache hit.
[2024-06-02 23:18:54] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2024-06-02 23:18:54] [INFO ] Invariant cache hit.
[2024-06-02 23:18:55] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 266 ms. Remains : 155/155 places, 246/246 transitions.
Computed a total of 34 stabilizing places and 48 stable transitions
Computed a total of 34 stabilizing places and 48 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 96 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[false, false, false, false, false]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-06-02 23:18:55] [INFO ] Invariant cache hit.
[2024-06-02 23:18:55] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 23:18:55] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 23:18:55] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 23:18:55] [INFO ] After 72ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2024-06-02 23:18:55] [INFO ] After 120ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 246/246 transitions.
Graph (trivial) has 115 edges and 155 vertex of which 11 / 155 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 147 transition count 217
Reduce places removed 16 places and 0 transitions.
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 1 with 19 rules applied. Total rules applied 36 place count 131 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 37 place count 130 transition count 214
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 37 place count 130 transition count 196
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 73 place count 112 transition count 196
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 93 place count 102 transition count 186
Performed 17 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 127 place count 85 transition count 254
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 130 place count 85 transition count 251
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 145 place count 85 transition count 236
Free-agglomeration rule applied 7 times.
Iterating global reduction 4 with 7 rules applied. Total rules applied 152 place count 85 transition count 229
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 159 place count 78 transition count 229
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 160 place count 77 transition count 228
Iterating global reduction 5 with 1 rules applied. Total rules applied 161 place count 77 transition count 228
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 164 place count 77 transition count 225
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 165 place count 76 transition count 224
Applied a total of 165 rules in 35 ms. Remains 76 /155 variables (removed 79) and now considering 224/246 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 76/155 places, 224/246 transitions.
Incomplete random walk after 10000 steps, including 837 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 274 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 44 steps, run visited all 1 properties in 4 ms. (steps per millisecond=11 )
Probabilistic random walk after 44 steps, saw 34 distinct states, run finished after 4 ms. (steps per millisecond=11 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 264 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[false, false, false, false, false]
Stuttering acceptance computed with spot in 193 ms :[false, false, false, false, false]
Stuttering acceptance computed with spot in 193 ms :[false, false, false, false, false]
Product exploration explored 100000 steps with 0 reset in 71 ms.
Product exploration explored 100000 steps with 0 reset in 79 ms.
Built C files in :
/tmp/ltsmin17327576708027404704
[2024-06-02 23:18:56] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17327576708027404704
Running compilation step : cd /tmp/ltsmin17327576708027404704;'/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 441 ms.
Running link step : cd /tmp/ltsmin17327576708027404704;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin17327576708027404704;'/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/stateBased17067436160496083551.hoa' '--buchi-type=spotba'
LTSmin run took 12768 ms.
FORMULA FireWire-PT-15-LTLCardinality-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-15-LTLCardinality-11 finished in 17089 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 1 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 275/275 transitions.
Graph (trivial) has 127 edges and 174 vertex of which 11 / 174 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 498 edges and 166 vertex of which 164 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 24 place count 163 transition count 243
Reduce places removed 22 places and 0 transitions.
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 1 with 25 rules applied. Total rules applied 49 place count 141 transition count 240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 140 transition count 240
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 50 place count 140 transition count 226
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 78 place count 126 transition count 226
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 84 place count 120 transition count 218
Iterating global reduction 3 with 6 rules applied. Total rules applied 90 place count 120 transition count 218
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 90 place count 120 transition count 217
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 92 place count 119 transition count 217
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 94 place count 117 transition count 214
Iterating global reduction 3 with 2 rules applied. Total rules applied 96 place count 117 transition count 214
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 97 place count 116 transition count 211
Iterating global reduction 3 with 1 rules applied. Total rules applied 98 place count 116 transition count 211
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 99 place count 115 transition count 209
Iterating global reduction 3 with 1 rules applied. Total rules applied 100 place count 115 transition count 209
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 101 place count 114 transition count 206
Iterating global reduction 3 with 1 rules applied. Total rules applied 102 place count 114 transition count 206
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 103 place count 113 transition count 204
Iterating global reduction 3 with 1 rules applied. Total rules applied 104 place count 113 transition count 204
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 105 place count 112 transition count 201
Iterating global reduction 3 with 1 rules applied. Total rules applied 106 place count 112 transition count 201
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 132 place count 99 transition count 188
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 133 place count 98 transition count 186
Iterating global reduction 3 with 1 rules applied. Total rules applied 134 place count 98 transition count 186
Performed 17 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 168 place count 81 transition count 254
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 3 with 15 rules applied. Total rules applied 183 place count 81 transition count 239
Applied a total of 183 rules in 31 ms. Remains 81 /174 variables (removed 93) and now considering 239/275 (removed 36) transitions.
[2024-06-02 23:19:10] [INFO ] Flow matrix only has 228 transitions (discarded 11 similar events)
// Phase 1: matrix 228 rows 81 cols
[2024-06-02 23:19:10] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 23:19:10] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-06-02 23:19:10] [INFO ] Flow matrix only has 228 transitions (discarded 11 similar events)
[2024-06-02 23:19:10] [INFO ] Invariant cache hit.
[2024-06-02 23:19:10] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-06-02 23:19:10] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
[2024-06-02 23:19:10] [INFO ] Redundant transitions in 11 ms returned []
[2024-06-02 23:19:10] [INFO ] Flow matrix only has 228 transitions (discarded 11 similar events)
[2024-06-02 23:19:10] [INFO ] Invariant cache hit.
[2024-06-02 23:19:10] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 81/174 places, 239/275 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 431 ms. Remains : 81/174 places, 239/275 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-15-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s72 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 82 ms.
Product exploration explored 100000 steps with 1 reset in 75 ms.
Computed a total of 16 stabilizing places and 30 stable transitions
Computed a total of 16 stabilizing places and 30 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 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 56 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1776 steps, including 158 resets, run visited all 1 properties in 12 ms. (steps per millisecond=148 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 95 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 58 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 239/239 transitions.
Applied a total of 0 rules in 4 ms. Remains 81 /81 variables (removed 0) and now considering 239/239 (removed 0) transitions.
[2024-06-02 23:19:11] [INFO ] Flow matrix only has 228 transitions (discarded 11 similar events)
[2024-06-02 23:19:11] [INFO ] Invariant cache hit.
[2024-06-02 23:19:11] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-06-02 23:19:11] [INFO ] Flow matrix only has 228 transitions (discarded 11 similar events)
[2024-06-02 23:19:11] [INFO ] Invariant cache hit.
[2024-06-02 23:19:11] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-06-02 23:19:11] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
[2024-06-02 23:19:11] [INFO ] Redundant transitions in 4 ms returned []
[2024-06-02 23:19:11] [INFO ] Flow matrix only has 228 transitions (discarded 11 similar events)
[2024-06-02 23:19:11] [INFO ] Invariant cache hit.
[2024-06-02 23:19:11] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 342 ms. Remains : 81/81 places, 239/239 transitions.
Computed a total of 16 stabilizing places and 30 stable transitions
Computed a total of 16 stabilizing places and 30 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Finished random walk after 770 steps, including 73 resets, run visited all 1 properties in 2 ms. (steps per millisecond=385 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 270 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 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 33 ms.
Product exploration explored 100000 steps with 0 reset in 38 ms.
Built C files in :
/tmp/ltsmin3607382053293111220
[2024-06-02 23:19:12] [INFO ] Computing symmetric may disable matrix : 239 transitions.
[2024-06-02 23:19:12] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:19:12] [INFO ] Computing symmetric may enable matrix : 239 transitions.
[2024-06-02 23:19:12] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:19:12] [INFO ] Computing Do-Not-Accords matrix : 239 transitions.
[2024-06-02 23:19:12] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:19:12] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3607382053293111220
Running compilation step : cd /tmp/ltsmin3607382053293111220;'/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 424 ms.
Running link step : cd /tmp/ltsmin3607382053293111220;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin3607382053293111220;'/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/stateBased2011193754785763629.hoa' '--buchi-type=spotba'
LTSmin run took 366 ms.
FORMULA FireWire-PT-15-LTLCardinality-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-15-LTLCardinality-13 finished in 3016 ms.
All properties solved by simple procedures.
Total runtime 30902 ms.

BK_STOP 1717370354216

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FireWire-PT-15"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is FireWire-PT-15, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r571-tall-171734910400177"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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