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

About the Execution of 2023-gold for CO4-PT-07

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
360.235 14903.00 27526.00 534.60 FFFFTFTFTFFFTTFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r571-tall-171734910100033.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 CO4-PT-07, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r571-tall-171734910100033
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 5.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K 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 25K 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 12K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K 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.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 98K 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 CO4-PT-07-LTLFireability-00
FORMULA_NAME CO4-PT-07-LTLFireability-01
FORMULA_NAME CO4-PT-07-LTLFireability-02
FORMULA_NAME CO4-PT-07-LTLFireability-03
FORMULA_NAME CO4-PT-07-LTLFireability-04
FORMULA_NAME CO4-PT-07-LTLFireability-05
FORMULA_NAME CO4-PT-07-LTLFireability-06
FORMULA_NAME CO4-PT-07-LTLFireability-07
FORMULA_NAME CO4-PT-07-LTLFireability-08
FORMULA_NAME CO4-PT-07-LTLFireability-09
FORMULA_NAME CO4-PT-07-LTLFireability-10
FORMULA_NAME CO4-PT-07-LTLFireability-11
FORMULA_NAME CO4-PT-07-LTLFireability-12
FORMULA_NAME CO4-PT-07-LTLFireability-13
FORMULA_NAME CO4-PT-07-LTLFireability-14
FORMULA_NAME CO4-PT-07-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717368627104

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-07
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-06-02 22:50:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 22:50:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:50:28] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2024-06-02 22:50:28] [INFO ] Transformed 384 places.
[2024-06-02 22:50:28] [INFO ] Transformed 456 transitions.
[2024-06-02 22:50:28] [INFO ] Found NUPN structural information;
[2024-06-02 22:50:28] [INFO ] Parsed PT model containing 384 places and 456 transitions and 1022 arcs in 124 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 100 places in 4 ms
Reduce places removed 100 places and 120 transitions.
FORMULA CO4-PT-07-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-07-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-07-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-07-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-07-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 284 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 284/284 places, 336/336 transitions.
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 274 transition count 335
Discarding 61 places :
Symmetric choice reduction at 1 with 61 rule applications. Total rules 72 place count 213 transition count 272
Iterating global reduction 1 with 61 rules applied. Total rules applied 133 place count 213 transition count 272
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 137 place count 213 transition count 268
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 167 place count 183 transition count 238
Iterating global reduction 2 with 30 rules applied. Total rules applied 197 place count 183 transition count 238
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 198 place count 183 transition count 237
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 203 place count 178 transition count 230
Iterating global reduction 3 with 5 rules applied. Total rules applied 208 place count 178 transition count 230
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 210 place count 176 transition count 228
Iterating global reduction 3 with 2 rules applied. Total rules applied 212 place count 176 transition count 228
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 213 place count 175 transition count 227
Iterating global reduction 3 with 1 rules applied. Total rules applied 214 place count 175 transition count 227
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 215 place count 175 transition count 226
Applied a total of 215 rules in 62 ms. Remains 175 /284 variables (removed 109) and now considering 226/336 (removed 110) transitions.
// Phase 1: matrix 226 rows 175 cols
[2024-06-02 22:50:29] [INFO ] Computed 4 invariants in 16 ms
[2024-06-02 22:50:29] [INFO ] Implicit Places using invariants in 193 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 218 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 174/284 places, 226/336 transitions.
Applied a total of 0 rules in 5 ms. Remains 174 /174 variables (removed 0) and now considering 226/226 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 285 ms. Remains : 174/284 places, 226/336 transitions.
Support contains 21 out of 174 places after structural reductions.
[2024-06-02 22:50:29] [INFO ] Flatten gal took : 37 ms
[2024-06-02 22:50:29] [INFO ] Flatten gal took : 16 ms
[2024-06-02 22:50:29] [INFO ] Input system was already deterministic with 226 transitions.
Incomplete random walk after 10000 steps, including 11 resets, run finished after 411 ms. (steps per millisecond=24 ) properties (out of 17) seen :4
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 13) seen :4
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 7) seen :1
Running SMT prover for 6 properties.
// Phase 1: matrix 226 rows 174 cols
[2024-06-02 22:50:31] [INFO ] Computed 3 invariants in 4 ms
[2024-06-02 22:50:31] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-02 22:50:31] [INFO ] After 127ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5 real:1
[2024-06-02 22:50:31] [INFO ] After 209ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :5 real:1
Attempting to minimize the solution found.
Minimization took 50 ms.
[2024-06-02 22:50:31] [INFO ] After 392ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :5 real:1
[2024-06-02 22:50:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-02 22:50:31] [INFO ] After 109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-06-02 22:50:31] [INFO ] After 217ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 53 ms.
[2024-06-02 22:50:32] [INFO ] After 372ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 5 properties in 8 ms.
Support contains 1 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 226/226 transitions.
Graph (trivial) has 183 edges and 174 vertex of which 2 / 174 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 292 edges and 173 vertex of which 159 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 159 transition count 144
Reduce places removed 57 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 58 rules applied. Total rules applied 128 place count 102 transition count 143
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 128 place count 102 transition count 122
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 170 place count 81 transition count 122
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 172 place count 79 transition count 120
Iterating global reduction 2 with 2 rules applied. Total rules applied 174 place count 79 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 175 place count 79 transition count 119
Performed 27 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 229 place count 52 transition count 87
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 5 rules applied. Total rules applied 234 place count 52 transition count 82
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 236 place count 51 transition count 81
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 238 place count 49 transition count 79
Iterating global reduction 5 with 2 rules applied. Total rules applied 240 place count 49 transition count 79
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 242 place count 48 transition count 78
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -1
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 266 place count 36 transition count 79
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 274 place count 36 transition count 71
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 285 place count 25 transition count 49
Iterating global reduction 6 with 11 rules applied. Total rules applied 296 place count 25 transition count 49
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 304 place count 25 transition count 41
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 307 place count 22 transition count 32
Iterating global reduction 7 with 3 rules applied. Total rules applied 310 place count 22 transition count 32
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 312 place count 22 transition count 30
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 314 place count 21 transition count 37
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 317 place count 21 transition count 34
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 321 place count 21 transition count 30
Free-agglomeration rule applied 4 times.
Iterating global reduction 9 with 4 rules applied. Total rules applied 325 place count 21 transition count 26
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 330 place count 17 transition count 25
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 331 place count 17 transition count 25
Graph (complete) has 44 edges and 17 vertex of which 16 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 10 with 1 rules applied. Total rules applied 332 place count 16 transition count 25
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 333 place count 16 transition count 24
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 334 place count 16 transition count 24
Graph (complete) has 41 edges and 16 vertex of which 15 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 12 with 1 rules applied. Total rules applied 335 place count 15 transition count 24
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 336 place count 15 transition count 23
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 337 place count 15 transition count 23
Graph (complete) has 38 edges and 15 vertex of which 14 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 14 with 1 rules applied. Total rules applied 338 place count 14 transition count 23
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 339 place count 14 transition count 22
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 340 place count 13 transition count 21
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t49.t209 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 342 place count 10 transition count 19
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 343 place count 10 transition count 18
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 344 place count 9 transition count 16
Iterating global reduction 17 with 1 rules applied. Total rules applied 345 place count 9 transition count 16
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 346 place count 9 transition count 15
Free-agglomeration rule applied 2 times.
Iterating global reduction 18 with 2 rules applied. Total rules applied 348 place count 9 transition count 13
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 350 place count 7 transition count 13
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 19 with 2 rules applied. Total rules applied 352 place count 7 transition count 11
Applied a total of 352 rules in 51 ms. Remains 7 /174 variables (removed 167) and now considering 11/226 (removed 215) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 7/174 places, 11/226 transitions.
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
FORMULA CO4-PT-07-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 12 stabilizing places and 15 stable transitions
Graph (complete) has 294 edges and 174 vertex of which 171 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.5 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 226/226 transitions.
Graph (trivial) has 180 edges and 174 vertex of which 2 / 174 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 293 edges and 173 vertex of which 170 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 57 place count 169 transition count 166
Reduce places removed 55 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 57 rules applied. Total rules applied 114 place count 114 transition count 164
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 115 place count 113 transition count 164
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 115 place count 113 transition count 143
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 157 place count 92 transition count 143
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 159 place count 90 transition count 140
Iterating global reduction 3 with 2 rules applied. Total rules applied 161 place count 90 transition count 140
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 162 place count 90 transition count 139
Performed 26 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 214 place count 64 transition count 108
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 4 with 4 rules applied. Total rules applied 218 place count 64 transition count 104
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 220 place count 63 transition count 103
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 222 place count 61 transition count 101
Iterating global reduction 6 with 2 rules applied. Total rules applied 224 place count 61 transition count 101
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 228 place count 59 transition count 99
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 256 place count 45 transition count 100
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 263 place count 45 transition count 93
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 274 place count 34 transition count 71
Iterating global reduction 7 with 11 rules applied. Total rules applied 285 place count 34 transition count 71
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 291 place count 34 transition count 65
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 294 place count 31 transition count 56
Iterating global reduction 8 with 3 rules applied. Total rules applied 297 place count 31 transition count 56
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 299 place count 31 transition count 54
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 303 place count 31 transition count 50
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 305 place count 29 transition count 48
Applied a total of 305 rules in 57 ms. Remains 29 /174 variables (removed 145) and now considering 48/226 (removed 178) transitions.
[2024-06-02 22:50:32] [INFO ] Flow matrix only has 45 transitions (discarded 3 similar events)
// Phase 1: matrix 45 rows 29 cols
[2024-06-02 22:50:32] [INFO ] Computed 3 invariants in 0 ms
[2024-06-02 22:50:32] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-02 22:50:32] [INFO ] Flow matrix only has 45 transitions (discarded 3 similar events)
[2024-06-02 22:50:32] [INFO ] Invariant cache hit.
[2024-06-02 22:50:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:50:32] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2024-06-02 22:50:32] [INFO ] Redundant transitions in 2 ms returned []
[2024-06-02 22:50:32] [INFO ] Flow matrix only has 45 transitions (discarded 3 similar events)
[2024-06-02 22:50:32] [INFO ] Invariant cache hit.
[2024-06-02 22:50:32] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 29/174 places, 48/226 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 317 ms. Remains : 29/174 places, 48/226 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 145 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-07-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s7 1) (EQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 2 ms.
FORMULA CO4-PT-07-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-07-LTLFireability-00 finished in 527 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))||(p1&&G(F(p2))))))'
Support contains 4 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 226/226 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 171 transition count 222
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 171 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 170 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 170 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 169 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 169 transition count 220
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 169 transition count 219
Applied a total of 11 rules in 8 ms. Remains 169 /174 variables (removed 5) and now considering 219/226 (removed 7) transitions.
// Phase 1: matrix 219 rows 169 cols
[2024-06-02 22:50:32] [INFO ] Computed 3 invariants in 3 ms
[2024-06-02 22:50:32] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-02 22:50:32] [INFO ] Invariant cache hit.
[2024-06-02 22:50:33] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2024-06-02 22:50:33] [INFO ] Invariant cache hit.
[2024-06-02 22:50:33] [INFO ] Dead Transitions using invariants and state equation in 231 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 169/174 places, 219/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 424 ms. Remains : 169/174 places, 219/226 transitions.
Stuttering acceptance computed with spot in 307 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : CO4-PT-07-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=4, aps=[p1:(EQ s56 1), p0:(AND (EQ s82 1) (EQ s143 1)), p2:(EQ s2 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 0 reset in 199 ms.
Stack based approach found an accepted trace after 21 steps with 0 reset with depth 22 and stack size 22 in 1 ms.
FORMULA CO4-PT-07-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property CO4-PT-07-LTLFireability-01 finished in 953 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)||p0))&&X(X(p0))))'
Support contains 2 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 226/226 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 170 transition count 221
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 170 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 169 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 169 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 168 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 168 transition count 219
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 168 transition count 218
Applied a total of 13 rules in 12 ms. Remains 168 /174 variables (removed 6) and now considering 218/226 (removed 8) transitions.
// Phase 1: matrix 218 rows 168 cols
[2024-06-02 22:50:33] [INFO ] Computed 3 invariants in 1 ms
[2024-06-02 22:50:33] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-06-02 22:50:33] [INFO ] Invariant cache hit.
[2024-06-02 22:50:33] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2024-06-02 22:50:33] [INFO ] Invariant cache hit.
[2024-06-02 22:50:34] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 168/174 places, 218/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 235 ms. Remains : 168/174 places, 218/226 transitions.
Stuttering acceptance computed with spot in 210 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-07-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s9 1) (EQ s157 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA CO4-PT-07-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-07-LTLFireability-02 finished in 466 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, 226/226 transitions.
Graph (trivial) has 184 edges and 174 vertex of which 2 / 174 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 293 edges and 173 vertex of which 170 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 59 place count 169 transition count 164
Reduce places removed 57 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 58 rules applied. Total rules applied 117 place count 112 transition count 163
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 117 place count 112 transition count 142
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 159 place count 91 transition count 142
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 161 place count 89 transition count 139
Iterating global reduction 2 with 2 rules applied. Total rules applied 163 place count 89 transition count 139
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 164 place count 89 transition count 138
Performed 28 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 220 place count 61 transition count 103
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 224 place count 61 transition count 99
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 226 place count 60 transition count 98
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 228 place count 58 transition count 96
Iterating global reduction 5 with 2 rules applied. Total rules applied 230 place count 58 transition count 96
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 234 place count 56 transition count 94
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -1
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 260 place count 43 transition count 95
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 268 place count 43 transition count 87
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 278 place count 33 transition count 67
Iterating global reduction 6 with 10 rules applied. Total rules applied 288 place count 33 transition count 67
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 295 place count 33 transition count 60
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 298 place count 30 transition count 51
Iterating global reduction 7 with 3 rules applied. Total rules applied 301 place count 30 transition count 51
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 303 place count 30 transition count 49
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 308 place count 30 transition count 44
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 310 place count 28 transition count 42
Applied a total of 310 rules in 31 ms. Remains 28 /174 variables (removed 146) and now considering 42/226 (removed 184) transitions.
[2024-06-02 22:50:34] [INFO ] Flow matrix only has 39 transitions (discarded 3 similar events)
// Phase 1: matrix 39 rows 28 cols
[2024-06-02 22:50:34] [INFO ] Computed 3 invariants in 0 ms
[2024-06-02 22:50:34] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-02 22:50:34] [INFO ] Flow matrix only has 39 transitions (discarded 3 similar events)
[2024-06-02 22:50:34] [INFO ] Invariant cache hit.
[2024-06-02 22:50:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:50:34] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2024-06-02 22:50:34] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 22:50:34] [INFO ] Flow matrix only has 39 transitions (discarded 3 similar events)
[2024-06-02 22:50:34] [INFO ] Invariant cache hit.
[2024-06-02 22:50:34] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/174 places, 42/226 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 134 ms. Remains : 28/174 places, 42/226 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-07-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s8 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 15 reset in 73 ms.
Product exploration explored 100000 steps with 4 reset in 72 ms.
Computed a total of 7 stabilizing places and 11 stable transitions
Computed a total of 7 stabilizing places and 11 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Finished random walk after 315 steps, including 44 resets, run visited all 1 properties in 3 ms. (steps per millisecond=105 )
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 114 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Support contains 1 out of 28 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 28/28 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 28 /28 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2024-06-02 22:50:34] [INFO ] Flow matrix only has 39 transitions (discarded 3 similar events)
[2024-06-02 22:50:34] [INFO ] Invariant cache hit.
[2024-06-02 22:50:34] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-02 22:50:34] [INFO ] Flow matrix only has 39 transitions (discarded 3 similar events)
[2024-06-02 22:50:34] [INFO ] Invariant cache hit.
[2024-06-02 22:50:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:50:35] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2024-06-02 22:50:35] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 22:50:35] [INFO ] Flow matrix only has 39 transitions (discarded 3 similar events)
[2024-06-02 22:50:35] [INFO ] Invariant cache hit.
[2024-06-02 22:50:35] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 120 ms. Remains : 28/28 places, 42/42 transitions.
Computed a total of 7 stabilizing places and 11 stable transitions
Computed a total of 7 stabilizing places and 11 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Finished random walk after 336 steps, including 47 resets, run visited all 1 properties in 5 ms. (steps per millisecond=67 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 13 reset in 47 ms.
Product exploration explored 100000 steps with 7 reset in 65 ms.
Built C files in :
/tmp/ltsmin1300460718720227713
[2024-06-02 22:50:35] [INFO ] Computing symmetric may disable matrix : 42 transitions.
[2024-06-02 22:50:35] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:50:35] [INFO ] Computing symmetric may enable matrix : 42 transitions.
[2024-06-02 22:50:35] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:50:35] [INFO ] Computing Do-Not-Accords matrix : 42 transitions.
[2024-06-02 22:50:35] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:50:35] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1300460718720227713
Running compilation step : cd /tmp/ltsmin1300460718720227713;'/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 332 ms.
Running link step : cd /tmp/ltsmin1300460718720227713;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin1300460718720227713;'/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/stateBased7804107789881790089.hoa' '--buchi-type=spotba'
LTSmin run took 95 ms.
FORMULA CO4-PT-07-LTLFireability-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-07-LTLFireability-03 finished in 1839 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)&&(F(G(p1))||G(p2)||(p2&&F(p3)))))'
Support contains 5 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 226/226 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 172 transition count 224
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 172 transition count 224
Applied a total of 4 rules in 6 ms. Remains 172 /174 variables (removed 2) and now considering 224/226 (removed 2) transitions.
// Phase 1: matrix 224 rows 172 cols
[2024-06-02 22:50:36] [INFO ] Computed 3 invariants in 3 ms
[2024-06-02 22:50:36] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-02 22:50:36] [INFO ] Invariant cache hit.
[2024-06-02 22:50:36] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
[2024-06-02 22:50:36] [INFO ] Invariant cache hit.
[2024-06-02 22:50:36] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 172/174 places, 224/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 238 ms. Remains : 172/174 places, 224/226 transitions.
Stuttering acceptance computed with spot in 231 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p2) (NOT p3) (NOT p1)), true, (AND (NOT p3) (NOT p1))]
Running random walk in product with property : CO4-PT-07-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 (NOT p3)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(NEQ s110 1), p3:(NEQ s136 1), p0:(AND (EQ s25 1) (EQ s161 1)), p1:(EQ s125 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CO4-PT-07-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-07-LTLFireability-05 finished in 492 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||(!p0&&X((F(p1)||G(!p0)))))))'
Support contains 3 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 226/226 transitions.
Graph (trivial) has 181 edges and 174 vertex of which 2 / 174 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 293 edges and 173 vertex of which 170 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 58 place count 169 transition count 165
Reduce places removed 56 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 58 rules applied. Total rules applied 116 place count 113 transition count 163
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 117 place count 112 transition count 163
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 117 place count 112 transition count 143
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 157 place count 92 transition count 143
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 158 place count 91 transition count 141
Iterating global reduction 3 with 1 rules applied. Total rules applied 159 place count 91 transition count 141
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 160 place count 91 transition count 140
Performed 27 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 214 place count 64 transition count 108
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 4 with 4 rules applied. Total rules applied 218 place count 64 transition count 104
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 220 place count 63 transition count 103
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 222 place count 61 transition count 101
Iterating global reduction 6 with 2 rules applied. Total rules applied 224 place count 61 transition count 101
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 228 place count 59 transition count 99
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 256 place count 45 transition count 100
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 265 place count 45 transition count 91
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 276 place count 34 transition count 69
Iterating global reduction 7 with 11 rules applied. Total rules applied 287 place count 34 transition count 69
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 294 place count 34 transition count 62
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 297 place count 31 transition count 53
Iterating global reduction 8 with 3 rules applied. Total rules applied 300 place count 31 transition count 53
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 302 place count 31 transition count 51
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 307 place count 31 transition count 46
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 308 place count 31 transition count 46
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 310 place count 29 transition count 44
Applied a total of 310 rules in 22 ms. Remains 29 /174 variables (removed 145) and now considering 44/226 (removed 182) transitions.
[2024-06-02 22:50:36] [INFO ] Flow matrix only has 41 transitions (discarded 3 similar events)
// Phase 1: matrix 41 rows 29 cols
[2024-06-02 22:50:36] [INFO ] Computed 3 invariants in 0 ms
[2024-06-02 22:50:36] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-02 22:50:36] [INFO ] Flow matrix only has 41 transitions (discarded 3 similar events)
[2024-06-02 22:50:36] [INFO ] Invariant cache hit.
[2024-06-02 22:50:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:50:36] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2024-06-02 22:50:36] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 22:50:36] [INFO ] Flow matrix only has 41 transitions (discarded 3 similar events)
[2024-06-02 22:50:36] [INFO ] Invariant cache hit.
[2024-06-02 22:50:36] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 29/174 places, 44/226 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 127 ms. Remains : 29/174 places, 44/226 transitions.
Stuttering acceptance computed with spot in 108 ms :[false, (AND (NOT p1) p0), (NOT p1)]
Running random walk in product with property : CO4-PT-07-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s14 1) (EQ s20 1)), p1:(NEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 33477 reset in 137 ms.
Product exploration explored 100000 steps with 33554 reset in 150 ms.
Computed a total of 8 stabilizing places and 12 stable transitions
Computed a total of 8 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter insensitive) to 3 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 130 ms :[false, (AND (NOT p1) p0), (NOT p1)]
Finished random walk after 2997 steps, including 375 resets, run visited all 3 properties in 15 ms. (steps per millisecond=199 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 167 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter insensitive) to 3 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[false, (AND (NOT p1) p0), (NOT p1)]
Stuttering acceptance computed with spot in 125 ms :[false, (AND (NOT p1) p0), (NOT p1)]
Support contains 3 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 44/44 transitions.
Applied a total of 0 rules in 3 ms. Remains 29 /29 variables (removed 0) and now considering 44/44 (removed 0) transitions.
[2024-06-02 22:50:37] [INFO ] Flow matrix only has 41 transitions (discarded 3 similar events)
[2024-06-02 22:50:37] [INFO ] Invariant cache hit.
[2024-06-02 22:50:37] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-02 22:50:37] [INFO ] Flow matrix only has 41 transitions (discarded 3 similar events)
[2024-06-02 22:50:37] [INFO ] Invariant cache hit.
[2024-06-02 22:50:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:50:37] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2024-06-02 22:50:37] [INFO ] Redundant transitions in 0 ms returned []
[2024-06-02 22:50:37] [INFO ] Flow matrix only has 41 transitions (discarded 3 similar events)
[2024-06-02 22:50:37] [INFO ] Invariant cache hit.
[2024-06-02 22:50:37] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 101 ms. Remains : 29/29 places, 44/44 transitions.
Computed a total of 8 stabilizing places and 12 stable transitions
Computed a total of 8 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter insensitive) to 3 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[false, (AND (NOT p1) p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 1246 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 210 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 22:50:38] [INFO ] Flow matrix only has 41 transitions (discarded 3 similar events)
[2024-06-02 22:50:38] [INFO ] Invariant cache hit.
[2024-06-02 22:50:38] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-02 22:50:38] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:50:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-06-02 22:50:38] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 22:50:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:50:38] [INFO ] After 3ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 22:50:38] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-06-02 22:50:38] [INFO ] After 37ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 7 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter insensitive) to 3 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[false, (AND (NOT p1) p0), (NOT p1)]
Stuttering acceptance computed with spot in 108 ms :[false, (AND (NOT p1) p0), (NOT p1)]
Stuttering acceptance computed with spot in 106 ms :[false, (AND (NOT p1) p0), (NOT p1)]
Product exploration explored 100000 steps with 33626 reset in 90 ms.
Product exploration explored 100000 steps with 33554 reset in 94 ms.
Built C files in :
/tmp/ltsmin16686651720282442674
[2024-06-02 22:50:38] [INFO ] Computing symmetric may disable matrix : 44 transitions.
[2024-06-02 22:50:38] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:50:38] [INFO ] Computing symmetric may enable matrix : 44 transitions.
[2024-06-02 22:50:38] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:50:38] [INFO ] Computing Do-Not-Accords matrix : 44 transitions.
[2024-06-02 22:50:38] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:50:38] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16686651720282442674
Running compilation step : cd /tmp/ltsmin16686651720282442674;'/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 119 ms.
Running link step : cd /tmp/ltsmin16686651720282442674;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin16686651720282442674;'/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/stateBased4090295010733384373.hoa' '--buchi-type=spotba'
LTSmin run took 119 ms.
FORMULA CO4-PT-07-LTLFireability-07 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-07-LTLFireability-07 finished in 2553 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 U !p1)&&X(X(X(p1))))))'
Support contains 3 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 226/226 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 171 transition count 222
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 171 transition count 222
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 170 transition count 221
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 170 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 169 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 169 transition count 220
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 169 transition count 219
Applied a total of 11 rules in 9 ms. Remains 169 /174 variables (removed 5) and now considering 219/226 (removed 7) transitions.
// Phase 1: matrix 219 rows 169 cols
[2024-06-02 22:50:39] [INFO ] Computed 3 invariants in 1 ms
[2024-06-02 22:50:39] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-02 22:50:39] [INFO ] Invariant cache hit.
[2024-06-02 22:50:39] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
[2024-06-02 22:50:39] [INFO ] Invariant cache hit.
[2024-06-02 22:50:39] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 169/174 places, 219/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 237 ms. Remains : 169/174 places, 219/226 transitions.
Stuttering acceptance computed with spot in 273 ms :[true, true, true, p1, (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : CO4-PT-07-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 p0), acceptance={} source=1 dest: 3}, { cond=(OR (NOT p1) p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={} source=6 dest: 2}]], initial=0, aps=[p1:(NEQ s110 1), p0:(OR (EQ s125 1) (EQ s46 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CO4-PT-07-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-07-LTLFireability-09 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' '!(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, 226/226 transitions.
Graph (trivial) has 184 edges and 174 vertex of which 2 / 174 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 293 edges and 173 vertex of which 170 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 59 place count 169 transition count 164
Reduce places removed 57 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 58 rules applied. Total rules applied 117 place count 112 transition count 163
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 117 place count 112 transition count 142
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 159 place count 91 transition count 142
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 161 place count 89 transition count 139
Iterating global reduction 2 with 2 rules applied. Total rules applied 163 place count 89 transition count 139
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 164 place count 89 transition count 138
Performed 27 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 218 place count 62 transition count 107
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 6 rules applied. Total rules applied 224 place count 62 transition count 101
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 226 place count 61 transition count 100
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 228 place count 59 transition count 98
Iterating global reduction 5 with 2 rules applied. Total rules applied 230 place count 59 transition count 98
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 234 place count 57 transition count 96
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 262 place count 43 transition count 97
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 271 place count 43 transition count 88
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 282 place count 32 transition count 66
Iterating global reduction 6 with 11 rules applied. Total rules applied 293 place count 32 transition count 66
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 300 place count 32 transition count 59
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 303 place count 29 transition count 50
Iterating global reduction 7 with 3 rules applied. Total rules applied 306 place count 29 transition count 50
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 308 place count 29 transition count 48
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 312 place count 29 transition count 44
Partial Post-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 320 place count 29 transition count 44
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 322 place count 27 transition count 42
Applied a total of 322 rules in 23 ms. Remains 27 /174 variables (removed 147) and now considering 42/226 (removed 184) transitions.
[2024-06-02 22:50:39] [INFO ] Flow matrix only has 39 transitions (discarded 3 similar events)
// Phase 1: matrix 39 rows 27 cols
[2024-06-02 22:50:39] [INFO ] Computed 3 invariants in 1 ms
[2024-06-02 22:50:39] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-06-02 22:50:39] [INFO ] Flow matrix only has 39 transitions (discarded 3 similar events)
[2024-06-02 22:50:39] [INFO ] Invariant cache hit.
[2024-06-02 22:50:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:50:39] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2024-06-02 22:50:39] [INFO ] Redundant transitions in 0 ms returned []
[2024-06-02 22:50:39] [INFO ] Flow matrix only has 39 transitions (discarded 3 similar events)
[2024-06-02 22:50:39] [INFO ] Invariant cache hit.
[2024-06-02 22:50:39] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/174 places, 42/226 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 204 ms. Remains : 27/174 places, 42/226 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-07-LTLFireability-10 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 s6 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 5 steps with 0 reset in 0 ms.
FORMULA CO4-PT-07-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-07-LTLFireability-10 finished in 277 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 226/226 transitions.
Graph (trivial) has 184 edges and 174 vertex of which 2 / 174 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 293 edges and 173 vertex of which 170 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 57 place count 169 transition count 166
Reduce places removed 55 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 57 rules applied. Total rules applied 114 place count 114 transition count 164
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 115 place count 113 transition count 164
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 115 place count 113 transition count 143
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 157 place count 92 transition count 143
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 159 place count 90 transition count 140
Iterating global reduction 3 with 2 rules applied. Total rules applied 161 place count 90 transition count 140
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 162 place count 90 transition count 139
Performed 28 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 218 place count 62 transition count 104
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 4 with 4 rules applied. Total rules applied 222 place count 62 transition count 100
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 224 place count 61 transition count 99
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 226 place count 59 transition count 97
Iterating global reduction 6 with 2 rules applied. Total rules applied 228 place count 59 transition count 97
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 232 place count 57 transition count 95
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 260 place count 43 transition count 96
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 268 place count 43 transition count 88
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 279 place count 32 transition count 66
Iterating global reduction 7 with 11 rules applied. Total rules applied 290 place count 32 transition count 66
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 297 place count 32 transition count 59
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 300 place count 29 transition count 50
Iterating global reduction 8 with 3 rules applied. Total rules applied 303 place count 29 transition count 50
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 305 place count 29 transition count 48
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 309 place count 29 transition count 44
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 311 place count 27 transition count 42
Applied a total of 311 rules in 19 ms. Remains 27 /174 variables (removed 147) and now considering 42/226 (removed 184) transitions.
[2024-06-02 22:50:39] [INFO ] Flow matrix only has 39 transitions (discarded 3 similar events)
// Phase 1: matrix 39 rows 27 cols
[2024-06-02 22:50:39] [INFO ] Computed 3 invariants in 1 ms
[2024-06-02 22:50:40] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-06-02 22:50:40] [INFO ] Flow matrix only has 39 transitions (discarded 3 similar events)
[2024-06-02 22:50:40] [INFO ] Invariant cache hit.
[2024-06-02 22:50:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:50:40] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2024-06-02 22:50:40] [INFO ] Redundant transitions in 0 ms returned []
[2024-06-02 22:50:40] [INFO ] Flow matrix only has 39 transitions (discarded 3 similar events)
[2024-06-02 22:50:40] [INFO ] Invariant cache hit.
[2024-06-02 22:50:40] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/174 places, 42/226 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 204 ms. Remains : 27/174 places, 42/226 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-07-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA CO4-PT-07-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-07-LTLFireability-11 finished in 275 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 1 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 226/226 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 170 transition count 221
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 170 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 169 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 169 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 168 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 168 transition count 219
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 168 transition count 218
Applied a total of 13 rules in 6 ms. Remains 168 /174 variables (removed 6) and now considering 218/226 (removed 8) transitions.
// Phase 1: matrix 218 rows 168 cols
[2024-06-02 22:50:40] [INFO ] Computed 3 invariants in 3 ms
[2024-06-02 22:50:40] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-02 22:50:40] [INFO ] Invariant cache hit.
[2024-06-02 22:50:40] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2024-06-02 22:50:40] [INFO ] Invariant cache hit.
[2024-06-02 22:50:40] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 168/174 places, 218/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 274 ms. Remains : 168/174 places, 218/226 transitions.
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-07-LTLFireability-14 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:(EQ s102 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 1 steps with 0 reset in 0 ms.
FORMULA CO4-PT-07-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-07-LTLFireability-14 finished in 395 ms.
All properties solved by simple procedures.
Total runtime 12074 ms.

BK_STOP 1717368642007

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/CO4-PT-07.tgz
mv CO4-PT-07 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;