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-171734910100053.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-11, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r571-tall-171734910100053
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 6.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 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 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K 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 132K 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-11-LTLFireability-00
FORMULA_NAME CO4-PT-11-LTLFireability-01
FORMULA_NAME CO4-PT-11-LTLFireability-02
FORMULA_NAME CO4-PT-11-LTLFireability-03
FORMULA_NAME CO4-PT-11-LTLFireability-04
FORMULA_NAME CO4-PT-11-LTLFireability-05
FORMULA_NAME CO4-PT-11-LTLFireability-06
FORMULA_NAME CO4-PT-11-LTLFireability-07
FORMULA_NAME CO4-PT-11-LTLFireability-08
FORMULA_NAME CO4-PT-11-LTLFireability-09
FORMULA_NAME CO4-PT-11-LTLFireability-10
FORMULA_NAME CO4-PT-11-LTLFireability-11
FORMULA_NAME CO4-PT-11-LTLFireability-12
FORMULA_NAME CO4-PT-11-LTLFireability-13
FORMULA_NAME CO4-PT-11-LTLFireability-14
FORMULA_NAME CO4-PT-11-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717368686916

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-11
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-06-02 22:51: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:51:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:51:28] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2024-06-02 22:51:28] [INFO ] Transformed 545 places.
[2024-06-02 22:51:28] [INFO ] Transformed 617 transitions.
[2024-06-02 22:51:28] [INFO ] Found NUPN structural information;
[2024-06-02 22:51:28] [INFO ] Parsed PT model containing 545 places and 617 transitions and 1344 arcs in 137 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 157 places in 8 ms
Reduce places removed 157 places and 177 transitions.
FORMULA CO4-PT-11-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-11-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 388 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 388/388 places, 440/440 transitions.
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 376 transition count 437
Discarding 60 places :
Symmetric choice reduction at 1 with 60 rule applications. Total rules 75 place count 316 transition count 375
Iterating global reduction 1 with 60 rules applied. Total rules applied 135 place count 316 transition count 375
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 182 place count 269 transition count 328
Iterating global reduction 1 with 47 rules applied. Total rules applied 229 place count 269 transition count 328
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 232 place count 269 transition count 325
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 253 place count 248 transition count 304
Iterating global reduction 2 with 21 rules applied. Total rules applied 274 place count 248 transition count 304
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 286 place count 236 transition count 292
Iterating global reduction 2 with 12 rules applied. Total rules applied 298 place count 236 transition count 292
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 300 place count 236 transition count 290
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 305 place count 231 transition count 285
Iterating global reduction 3 with 5 rules applied. Total rules applied 310 place count 231 transition count 285
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 311 place count 230 transition count 284
Iterating global reduction 3 with 1 rules applied. Total rules applied 312 place count 230 transition count 284
Applied a total of 312 rules in 81 ms. Remains 230 /388 variables (removed 158) and now considering 284/440 (removed 156) transitions.
// Phase 1: matrix 284 rows 230 cols
[2024-06-02 22:51:29] [INFO ] Computed 4 invariants in 14 ms
[2024-06-02 22:51:29] [INFO ] Implicit Places using invariants in 234 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 683 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 229/388 places, 284/440 transitions.
Applied a total of 0 rules in 5 ms. Remains 229 /229 variables (removed 0) and now considering 284/284 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 769 ms. Remains : 229/388 places, 284/440 transitions.
Support contains 22 out of 229 places after structural reductions.
[2024-06-02 22:51:29] [INFO ] Flatten gal took : 43 ms
[2024-06-02 22:51:29] [INFO ] Flatten gal took : 18 ms
[2024-06-02 22:51:29] [INFO ] Input system was already deterministic with 284 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 548 ms. (steps per millisecond=18 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 11 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 18) seen :1
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 17) seen :2
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 284 rows 229 cols
[2024-06-02 22:51:30] [INFO ] Computed 3 invariants in 7 ms
[2024-06-02 22:51:30] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-02 22:51:30] [INFO ] After 314ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2024-06-02 22:51:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-02 22:51:31] [INFO ] After 232ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :14
[2024-06-02 22:51:31] [INFO ] After 529ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :14
Attempting to minimize the solution found.
Minimization took 180 ms.
[2024-06-02 22:51:31] [INFO ] After 911ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :14
Fused 15 Parikh solutions to 13 different solutions.
Finished Parikh walk after 35 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=35 )
Parikh walk visited 13 properties in 38 ms.
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 284/284 transitions.
Graph (trivial) has 239 edges and 229 vertex of which 3 / 229 are part of one of the 1 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 354 edges and 227 vertex of which 214 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 0 with 116 rules applied. Total rules applied 118 place count 214 transition count 154
Reduce places removed 102 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 104 rules applied. Total rules applied 222 place count 112 transition count 152
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 226 place count 111 transition count 149
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 230 place count 109 transition count 147
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 232 place count 108 transition count 146
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 233 place count 107 transition count 146
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 19 Pre rules applied. Total rules applied 233 place count 107 transition count 127
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 6 with 38 rules applied. Total rules applied 271 place count 88 transition count 127
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 274 place count 85 transition count 124
Iterating global reduction 6 with 3 rules applied. Total rules applied 277 place count 85 transition count 124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 278 place count 85 transition count 123
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 278 place count 85 transition count 122
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 280 place count 84 transition count 122
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 282 place count 82 transition count 120
Iterating global reduction 7 with 2 rules applied. Total rules applied 284 place count 82 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 285 place count 82 transition count 119
Performed 32 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 8 with 64 rules applied. Total rules applied 349 place count 50 transition count 81
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 351 place count 50 transition count 79
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 354 place count 47 transition count 76
Iterating global reduction 9 with 3 rules applied. Total rules applied 357 place count 47 transition count 76
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 9 with 2 rules applied. Total rules applied 359 place count 46 transition count 75
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 113 edges and 46 vertex of which 45 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 9 with 6 rules applied. Total rules applied 365 place count 45 transition count 70
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 369 place count 41 transition count 66
Iterating global reduction 10 with 4 rules applied. Total rules applied 373 place count 41 transition count 66
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 374 place count 41 transition count 65
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 11 with 6 rules applied. Total rules applied 380 place count 38 transition count 62
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 383 place count 38 transition count 59
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 386 place count 35 transition count 56
Iterating global reduction 12 with 3 rules applied. Total rules applied 389 place count 35 transition count 56
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 391 place count 35 transition count 54
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 392 place count 34 transition count 53
Iterating global reduction 13 with 1 rules applied. Total rules applied 393 place count 34 transition count 53
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 394 place count 34 transition count 52
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 14 with 16 rules applied. Total rules applied 410 place count 26 transition count 52
Drop transitions removed 8 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 14 with 15 rules applied. Total rules applied 425 place count 26 transition count 37
Discarding 8 places :
Symmetric choice reduction at 15 with 8 rule applications. Total rules 433 place count 18 transition count 29
Iterating global reduction 15 with 8 rules applied. Total rules applied 441 place count 18 transition count 29
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 15 with 7 rules applied. Total rules applied 448 place count 18 transition count 22
Free-agglomeration rule applied 5 times.
Iterating global reduction 16 with 5 rules applied. Total rules applied 453 place count 18 transition count 17
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 7 rules applied. Total rules applied 460 place count 13 transition count 15
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 461 place count 13 transition count 15
Graph (complete) has 28 edges and 13 vertex of which 12 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 17 with 1 rules applied. Total rules applied 462 place count 12 transition count 15
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 463 place count 12 transition count 14
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 464 place count 12 transition count 14
Graph (complete) has 25 edges and 12 vertex of which 11 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 19 with 1 rules applied. Total rules applied 465 place count 11 transition count 14
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 466 place count 11 transition count 13
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 21 with 1 rules applied. Total rules applied 467 place count 11 transition count 13
Graph (complete) has 22 edges and 11 vertex of which 10 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 21 with 1 rules applied. Total rules applied 468 place count 10 transition count 13
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 469 place count 10 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 23 with 1 rules applied. Total rules applied 470 place count 9 transition count 11
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t65.t69.t259.t267.t62 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 23 with 3 rules applied. Total rules applied 473 place count 6 transition count 8
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 5 edges and 5 vertex of which 3 / 5 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 24 with 2 rules applied. Total rules applied 475 place count 3 transition count 8
Drop transitions removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 25 with 5 rules applied. Total rules applied 480 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 26 with 1 Pre rules applied. Total rules applied 480 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 26 with 2 rules applied. Total rules applied 482 place count 2 transition count 2
Applied a total of 482 rules in 65 ms. Remains 2 /229 variables (removed 227) and now considering 2/284 (removed 282) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 2/229 places, 2/284 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 0 properties in 0 ms.
FORMULA CO4-PT-11-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 16 stabilizing places and 19 stable transitions
Graph (complete) has 357 edges and 229 vertex of which 224 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.7 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(F(p1))&&p0)))'
Support contains 3 out of 229 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 229/229 places, 284/284 transitions.
Graph (trivial) has 236 edges and 229 vertex of which 3 / 229 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 355 edges and 227 vertex of which 222 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 98 place count 221 transition count 179
Reduce places removed 96 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 98 rules applied. Total rules applied 196 place count 125 transition count 177
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 197 place count 124 transition count 177
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 197 place count 124 transition count 157
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 237 place count 104 transition count 157
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 240 place count 101 transition count 154
Iterating global reduction 3 with 3 rules applied. Total rules applied 243 place count 101 transition count 154
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 244 place count 101 transition count 153
Performed 36 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 316 place count 65 transition count 106
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 318 place count 65 transition count 104
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 321 place count 62 transition count 101
Iterating global reduction 5 with 3 rules applied. Total rules applied 324 place count 62 transition count 101
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -2
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 352 place count 48 transition count 103
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 359 place count 48 transition count 96
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 368 place count 39 transition count 78
Iterating global reduction 6 with 9 rules applied. Total rules applied 377 place count 39 transition count 78
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 383 place count 39 transition count 72
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 384 place count 38 transition count 69
Iterating global reduction 7 with 1 rules applied. Total rules applied 385 place count 38 transition count 69
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 389 place count 38 transition count 65
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 391 place count 36 transition count 63
Applied a total of 391 rules in 48 ms. Remains 36 /229 variables (removed 193) and now considering 63/284 (removed 221) transitions.
[2024-06-02 22:51:32] [INFO ] Flow matrix only has 59 transitions (discarded 4 similar events)
// Phase 1: matrix 59 rows 36 cols
[2024-06-02 22:51:32] [INFO ] Computed 3 invariants in 1 ms
[2024-06-02 22:51:32] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-02 22:51:32] [INFO ] Flow matrix only has 59 transitions (discarded 4 similar events)
[2024-06-02 22:51:32] [INFO ] Invariant cache hit.
[2024-06-02 22:51:32] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 22:51:32] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2024-06-02 22:51:32] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 22:51:32] [INFO ] Flow matrix only has 59 transitions (discarded 4 similar events)
[2024-06-02 22:51:32] [INFO ] Invariant cache hit.
[2024-06-02 22:51:32] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 36/229 places, 63/284 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 179 ms. Remains : 36/229 places, 63/284 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : CO4-PT-11-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s14 0), p0:(AND (EQ s3 1) (EQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 2 ms.
FORMULA CO4-PT-11-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-11-LTLFireability-01 finished in 501 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 229 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 229/229 places, 284/284 transitions.
Graph (trivial) has 231 edges and 229 vertex of which 3 / 229 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 355 edges and 227 vertex of which 222 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 0 with 94 rules applied. Total rules applied 96 place count 221 transition count 181
Reduce places removed 94 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 96 rules applied. Total rules applied 192 place count 127 transition count 179
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 195 place count 126 transition count 177
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 197 place count 124 transition count 177
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 22 Pre rules applied. Total rules applied 197 place count 124 transition count 155
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 241 place count 102 transition count 155
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 246 place count 97 transition count 150
Iterating global reduction 4 with 5 rules applied. Total rules applied 251 place count 97 transition count 150
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 252 place count 97 transition count 149
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 252 place count 97 transition count 148
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 254 place count 96 transition count 148
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 255 place count 95 transition count 147
Iterating global reduction 5 with 1 rules applied. Total rules applied 256 place count 95 transition count 147
Performed 34 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 5 with 68 rules applied. Total rules applied 324 place count 61 transition count 102
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 326 place count 61 transition count 100
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 329 place count 58 transition count 97
Iterating global reduction 6 with 3 rules applied. Total rules applied 332 place count 58 transition count 97
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 360 place count 44 transition count 98
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 368 place count 44 transition count 90
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 379 place count 33 transition count 68
Iterating global reduction 7 with 11 rules applied. Total rules applied 390 place count 33 transition count 68
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 397 place count 33 transition count 61
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 400 place count 30 transition count 52
Iterating global reduction 8 with 3 rules applied. Total rules applied 403 place count 30 transition count 52
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 405 place count 30 transition count 50
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 407 place count 29 transition count 58
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 415 place count 29 transition count 50
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 417 place count 29 transition count 50
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 419 place count 27 transition count 48
Applied a total of 419 rules in 41 ms. Remains 27 /229 variables (removed 202) and now considering 48/284 (removed 236) transitions.
[2024-06-02 22:51:32] [INFO ] Flow matrix only has 46 transitions (discarded 2 similar events)
// Phase 1: matrix 46 rows 27 cols
[2024-06-02 22:51:32] [INFO ] Computed 3 invariants in 0 ms
[2024-06-02 22:51:32] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-02 22:51:32] [INFO ] Flow matrix only has 46 transitions (discarded 2 similar events)
[2024-06-02 22:51:32] [INFO ] Invariant cache hit.
[2024-06-02 22:51:32] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 22:51:32] [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:51:32] [INFO ] Redundant transitions in 12 ms returned []
[2024-06-02 22:51:32] [INFO ] Flow matrix only has 46 transitions (discarded 2 similar events)
[2024-06-02 22:51:32] [INFO ] Invariant cache hit.
[2024-06-02 22:51:32] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 27/229 places, 48/284 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 168 ms. Remains : 27/229 places, 48/284 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-11-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s6 1) (EQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA CO4-PT-11-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-11-LTLFireability-04 finished in 253 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 229 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 229/229 places, 284/284 transitions.
Graph (trivial) has 240 edges and 229 vertex of which 3 / 229 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 355 edges and 227 vertex of which 222 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 101 place count 221 transition count 176
Reduce places removed 99 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 101 rules applied. Total rules applied 202 place count 122 transition count 174
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 203 place count 121 transition count 174
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 203 place count 121 transition count 154
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 243 place count 101 transition count 154
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 246 place count 98 transition count 151
Iterating global reduction 3 with 3 rules applied. Total rules applied 249 place count 98 transition count 151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 250 place count 98 transition count 150
Performed 36 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 322 place count 62 transition count 103
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 324 place count 62 transition count 101
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 327 place count 59 transition count 98
Iterating global reduction 5 with 3 rules applied. Total rules applied 330 place count 59 transition count 98
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 360 place count 44 transition count 100
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 369 place count 44 transition count 91
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 380 place count 33 transition count 69
Iterating global reduction 6 with 11 rules applied. Total rules applied 391 place count 33 transition count 69
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 399 place count 33 transition count 61
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 401 place count 31 transition count 55
Iterating global reduction 7 with 2 rules applied. Total rules applied 403 place count 31 transition count 55
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 404 place count 31 transition count 54
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
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 406 place count 30 transition count 66
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 8 with 17 rules applied. Total rules applied 423 place count 30 transition count 49
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 425 place count 28 transition count 47
Applied a total of 425 rules in 26 ms. Remains 28 /229 variables (removed 201) and now considering 47/284 (removed 237) transitions.
[2024-06-02 22:51:32] [INFO ] Flow matrix only has 44 transitions (discarded 3 similar events)
// Phase 1: matrix 44 rows 28 cols
[2024-06-02 22:51:32] [INFO ] Computed 3 invariants in 0 ms
[2024-06-02 22:51:32] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-02 22:51:32] [INFO ] Flow matrix only has 44 transitions (discarded 3 similar events)
[2024-06-02 22:51:32] [INFO ] Invariant cache hit.
[2024-06-02 22:51:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:51:33] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2024-06-02 22:51:33] [INFO ] Redundant transitions in 0 ms returned []
[2024-06-02 22:51:33] [INFO ] Flow matrix only has 44 transitions (discarded 3 similar events)
[2024-06-02 22:51:33] [INFO ] Invariant cache hit.
[2024-06-02 22:51:33] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/229 places, 47/284 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 141 ms. Remains : 28/229 places, 47/284 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-11-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s4 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 5 reset in 132 ms.
Product exploration explored 100000 steps with 3 reset in 69 ms.
Computed a total of 7 stabilizing places and 13 stable transitions
Computed a total of 7 stabilizing places and 13 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 159 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 27 ms :[(NOT p0)]
Finished random walk after 5337 steps, including 768 resets, run visited all 1 properties in 19 ms. (steps per millisecond=280 )
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 86 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 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 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, 47/47 transitions.
Applied a total of 0 rules in 4 ms. Remains 28 /28 variables (removed 0) and now considering 47/47 (removed 0) transitions.
[2024-06-02 22:51:33] [INFO ] Flow matrix only has 44 transitions (discarded 3 similar events)
[2024-06-02 22:51:33] [INFO ] Invariant cache hit.
[2024-06-02 22:51:33] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-02 22:51:33] [INFO ] Flow matrix only has 44 transitions (discarded 3 similar events)
[2024-06-02 22:51:33] [INFO ] Invariant cache hit.
[2024-06-02 22:51:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-02 22:51:33] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2024-06-02 22:51:33] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 22:51:33] [INFO ] Flow matrix only has 44 transitions (discarded 3 similar events)
[2024-06-02 22:51:33] [INFO ] Invariant cache hit.
[2024-06-02 22:51:33] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 122 ms. Remains : 28/28 places, 47/47 transitions.
Computed a total of 7 stabilizing places and 13 stable transitions
Computed a total of 7 stabilizing places and 13 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 64 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 26 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1438 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 246 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 628 steps, run visited all 1 properties in 10 ms. (steps per millisecond=62 )
Probabilistic random walk after 628 steps, saw 255 distinct states, run finished after 10 ms. (steps per millisecond=62 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 86 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)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3 reset in 49 ms.
Product exploration explored 100000 steps with 1 reset in 135 ms.
Built C files in :
/tmp/ltsmin11669328160780829338
[2024-06-02 22:51:34] [INFO ] Computing symmetric may disable matrix : 47 transitions.
[2024-06-02 22:51:34] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:51:34] [INFO ] Computing symmetric may enable matrix : 47 transitions.
[2024-06-02 22:51:34] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:51:34] [INFO ] Computing Do-Not-Accords matrix : 47 transitions.
[2024-06-02 22:51:34] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:51:34] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11669328160780829338
Running compilation step : cd /tmp/ltsmin11669328160780829338;'/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 228 ms.
Running link step : cd /tmp/ltsmin11669328160780829338;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin11669328160780829338;'/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/stateBased16974672541104302961.hoa' '--buchi-type=spotba'
LTSmin run took 89 ms.
FORMULA CO4-PT-11-LTLFireability-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-11-LTLFireability-06 finished in 1808 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 229 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 284/284 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 220 transition count 275
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 220 transition count 275
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 220 transition count 274
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 25 place count 214 transition count 268
Iterating global reduction 1 with 6 rules applied. Total rules applied 31 place count 214 transition count 268
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 32 place count 214 transition count 267
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 36 place count 210 transition count 263
Iterating global reduction 2 with 4 rules applied. Total rules applied 40 place count 210 transition count 263
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 44 place count 206 transition count 259
Iterating global reduction 2 with 4 rules applied. Total rules applied 48 place count 206 transition count 259
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 205 transition count 258
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 205 transition count 258
Applied a total of 50 rules in 21 ms. Remains 205 /229 variables (removed 24) and now considering 258/284 (removed 26) transitions.
// Phase 1: matrix 258 rows 205 cols
[2024-06-02 22:51:34] [INFO ] Computed 3 invariants in 1 ms
[2024-06-02 22:51:34] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-06-02 22:51:34] [INFO ] Invariant cache hit.
[2024-06-02 22:51:34] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2024-06-02 22:51:34] [INFO ] Invariant cache hit.
[2024-06-02 22:51:35] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 205/229 places, 258/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 299 ms. Remains : 205/229 places, 258/284 transitions.
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-11-LTLFireability-08 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 s2 0)], 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 207 steps with 8 reset in 1 ms.
FORMULA CO4-PT-11-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-11-LTLFireability-08 finished in 384 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U (p1||G(p0))))))'
Support contains 4 out of 229 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 229/229 places, 284/284 transitions.
Graph (trivial) has 233 edges and 229 vertex of which 3 / 229 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 355 edges and 227 vertex of which 222 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 0 with 94 rules applied. Total rules applied 96 place count 221 transition count 181
Reduce places removed 94 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 96 rules applied. Total rules applied 192 place count 127 transition count 179
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 194 place count 126 transition count 178
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 195 place count 125 transition count 178
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 20 Pre rules applied. Total rules applied 195 place count 125 transition count 158
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 235 place count 105 transition count 158
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 239 place count 101 transition count 154
Iterating global reduction 4 with 4 rules applied. Total rules applied 243 place count 101 transition count 154
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 243 place count 101 transition count 153
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 245 place count 100 transition count 153
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 246 place count 99 transition count 152
Iterating global reduction 4 with 1 rules applied. Total rules applied 247 place count 99 transition count 152
Performed 35 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 317 place count 64 transition count 107
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 319 place count 64 transition count 105
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 322 place count 61 transition count 102
Iterating global reduction 5 with 3 rules applied. Total rules applied 325 place count 61 transition count 102
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -2
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 353 place count 47 transition count 104
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 362 place count 47 transition count 95
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 373 place count 36 transition count 73
Iterating global reduction 6 with 11 rules applied. Total rules applied 384 place count 36 transition count 73
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 392 place count 36 transition count 65
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 395 place count 33 transition count 56
Iterating global reduction 7 with 3 rules applied. Total rules applied 398 place count 33 transition count 56
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 400 place count 33 transition count 54
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 402 place count 32 transition count 71
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 8 with 17 rules applied. Total rules applied 419 place count 32 transition count 54
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 421 place count 30 transition count 52
Applied a total of 421 rules in 32 ms. Remains 30 /229 variables (removed 199) and now considering 52/284 (removed 232) transitions.
[2024-06-02 22:51:35] [INFO ] Flow matrix only has 47 transitions (discarded 5 similar events)
// Phase 1: matrix 47 rows 30 cols
[2024-06-02 22:51:35] [INFO ] Computed 3 invariants in 0 ms
[2024-06-02 22:51:35] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-02 22:51:35] [INFO ] Flow matrix only has 47 transitions (discarded 5 similar events)
[2024-06-02 22:51:35] [INFO ] Invariant cache hit.
[2024-06-02 22:51:35] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 22:51:35] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2024-06-02 22:51:35] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 22:51:35] [INFO ] Flow matrix only has 47 transitions (discarded 5 similar events)
[2024-06-02 22:51:35] [INFO ] Invariant cache hit.
[2024-06-02 22:51:35] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/229 places, 52/284 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 140 ms. Remains : 30/229 places, 52/284 transitions.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-11-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NOT (AND (EQ s9 1) (EQ s13 1) (EQ s16 1))) (NEQ s14 1)), p0:(NEQ s14 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 13 reset in 114 ms.
Product exploration explored 100000 steps with 1 reset in 75 ms.
Computed a total of 7 stabilizing places and 13 stable transitions
Computed a total of 7 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 123 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 819 steps, including 88 resets, run visited all 2 properties in 13 ms. (steps per millisecond=63 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 216 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 52/52 transitions.
Applied a total of 0 rules in 5 ms. Remains 30 /30 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2024-06-02 22:51:36] [INFO ] Flow matrix only has 47 transitions (discarded 5 similar events)
[2024-06-02 22:51:36] [INFO ] Invariant cache hit.
[2024-06-02 22:51:36] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-02 22:51:36] [INFO ] Flow matrix only has 47 transitions (discarded 5 similar events)
[2024-06-02 22:51:36] [INFO ] Invariant cache hit.
[2024-06-02 22:51:36] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 22:51:36] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2024-06-02 22:51:36] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 22:51:36] [INFO ] Flow matrix only has 47 transitions (discarded 5 similar events)
[2024-06-02 22:51:36] [INFO ] Invariant cache hit.
[2024-06-02 22:51:36] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 127 ms. Remains : 30/30 places, 52/52 transitions.
Computed a total of 7 stabilizing places and 13 stable transitions
Computed a total of 7 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 74 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 228 steps, including 23 resets, run visited all 2 properties in 4 ms. (steps per millisecond=57 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 149 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5 reset in 51 ms.
Product exploration explored 100000 steps with 1 reset in 64 ms.
Built C files in :
/tmp/ltsmin7832876983345002640
[2024-06-02 22:51:36] [INFO ] Computing symmetric may disable matrix : 52 transitions.
[2024-06-02 22:51:36] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:51:36] [INFO ] Computing symmetric may enable matrix : 52 transitions.
[2024-06-02 22:51:36] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:51:36] [INFO ] Computing Do-Not-Accords matrix : 52 transitions.
[2024-06-02 22:51:36] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:51:36] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7832876983345002640
Running compilation step : cd /tmp/ltsmin7832876983345002640;'/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 130 ms.
Running link step : cd /tmp/ltsmin7832876983345002640;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin7832876983345002640;'/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/stateBased5853015199495214576.hoa' '--buchi-type=spotba'
LTSmin run took 88 ms.
FORMULA CO4-PT-11-LTLFireability-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-11-LTLFireability-10 finished in 2120 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(p0)&&(p1||X(p2))))&&F(p3)))'
Support contains 3 out of 229 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 284/284 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 223 transition count 278
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 223 transition count 278
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 223 transition count 277
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 219 transition count 273
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 219 transition count 273
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 22 place count 219 transition count 272
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 25 place count 216 transition count 269
Iterating global reduction 2 with 3 rules applied. Total rules applied 28 place count 216 transition count 269
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 31 place count 213 transition count 266
Iterating global reduction 2 with 3 rules applied. Total rules applied 34 place count 213 transition count 266
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 212 transition count 265
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 212 transition count 265
Applied a total of 36 rules in 19 ms. Remains 212 /229 variables (removed 17) and now considering 265/284 (removed 19) transitions.
// Phase 1: matrix 265 rows 212 cols
[2024-06-02 22:51:37] [INFO ] Computed 3 invariants in 2 ms
[2024-06-02 22:51:37] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-02 22:51:37] [INFO ] Invariant cache hit.
[2024-06-02 22:51:37] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2024-06-02 22:51:37] [INFO ] Invariant cache hit.
[2024-06-02 22:51:37] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 212/229 places, 265/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 291 ms. Remains : 212/229 places, 265/284 transitions.
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p3) (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND p0 (NOT p2)), (NOT p3), true]
Running random walk in product with property : CO4-PT-11-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(NOT p3), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s123 1), p3:(EQ s123 0), p0:(EQ s178 1), p2:(EQ s28 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CO4-PT-11-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-11-LTLFireability-11 finished in 520 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&&(p1||X(p1))))))'
Support contains 2 out of 229 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 284/284 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 220 transition count 275
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 220 transition count 275
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 220 transition count 274
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 25 place count 214 transition count 268
Iterating global reduction 1 with 6 rules applied. Total rules applied 31 place count 214 transition count 268
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 32 place count 214 transition count 267
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 36 place count 210 transition count 263
Iterating global reduction 2 with 4 rules applied. Total rules applied 40 place count 210 transition count 263
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 44 place count 206 transition count 259
Iterating global reduction 2 with 4 rules applied. Total rules applied 48 place count 206 transition count 259
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 205 transition count 258
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 205 transition count 258
Applied a total of 50 rules in 21 ms. Remains 205 /229 variables (removed 24) and now considering 258/284 (removed 26) transitions.
// Phase 1: matrix 258 rows 205 cols
[2024-06-02 22:51:37] [INFO ] Computed 3 invariants in 1 ms
[2024-06-02 22:51:37] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-02 22:51:37] [INFO ] Invariant cache hit.
[2024-06-02 22:51:37] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2024-06-02 22:51:37] [INFO ] Invariant cache hit.
[2024-06-02 22:51:38] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 205/229 places, 258/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 283 ms. Remains : 205/229 places, 258/284 transitions.
Stuttering acceptance computed with spot in 75 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CO4-PT-11-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s37 1), p1:(EQ s105 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 32 steps with 0 reset in 1 ms.
FORMULA CO4-PT-11-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-11-LTLFireability-12 finished in 379 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 (G(p0)||(p0&&G(p1))))))'
Support contains 2 out of 229 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 284/284 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 220 transition count 275
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 220 transition count 275
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 220 transition count 274
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 25 place count 214 transition count 268
Iterating global reduction 1 with 6 rules applied. Total rules applied 31 place count 214 transition count 268
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 32 place count 214 transition count 267
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 36 place count 210 transition count 263
Iterating global reduction 2 with 4 rules applied. Total rules applied 40 place count 210 transition count 263
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 44 place count 206 transition count 259
Iterating global reduction 2 with 4 rules applied. Total rules applied 48 place count 206 transition count 259
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 205 transition count 258
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 205 transition count 258
Applied a total of 50 rules in 11 ms. Remains 205 /229 variables (removed 24) and now considering 258/284 (removed 26) transitions.
[2024-06-02 22:51:38] [INFO ] Invariant cache hit.
[2024-06-02 22:51:38] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-02 22:51:38] [INFO ] Invariant cache hit.
[2024-06-02 22:51:38] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2024-06-02 22:51:38] [INFO ] Invariant cache hit.
[2024-06-02 22:51:38] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 205/229 places, 258/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 263 ms. Remains : 205/229 places, 258/284 transitions.
Stuttering acceptance computed with spot in 184 ms :[true, (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CO4-PT-11-LTLFireability-13 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=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(NEQ s179 1), p1:(EQ s57 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 21 reset in 86 ms.
Product exploration explored 100000 steps with 15 reset in 119 ms.
Computed a total of 12 stabilizing places and 15 stable transitions
Graph (complete) has 327 edges and 205 vertex of which 200 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 12 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND (NOT p1) p0)), (X (NOT (AND p1 p0))), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 107 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 178 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 23 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 6) seen :0
Finished probabilistic random walk after 92677 steps, run visited all 6 properties in 316 ms. (steps per millisecond=293 )
Probabilistic random walk after 92677 steps, saw 23148 distinct states, run finished after 316 ms. (steps per millisecond=293 ) properties seen :6
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND (NOT p1) p0)), (X (NOT (AND p1 p0))), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F (AND p0 p1)), (F (NOT p0)), (F p1), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p0) (NOT p1)))
Knowledge based reduction with 10 factoid took 266 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-11-LTLFireability-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-11-LTLFireability-13 finished in 2621 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 284/284 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 220 transition count 275
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 220 transition count 275
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 220 transition count 274
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 25 place count 214 transition count 268
Iterating global reduction 1 with 6 rules applied. Total rules applied 31 place count 214 transition count 268
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 32 place count 214 transition count 267
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 36 place count 210 transition count 263
Iterating global reduction 2 with 4 rules applied. Total rules applied 40 place count 210 transition count 263
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 44 place count 206 transition count 259
Iterating global reduction 2 with 4 rules applied. Total rules applied 48 place count 206 transition count 259
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 205 transition count 258
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 205 transition count 258
Applied a total of 50 rules in 18 ms. Remains 205 /229 variables (removed 24) and now considering 258/284 (removed 26) transitions.
[2024-06-02 22:51:40] [INFO ] Invariant cache hit.
[2024-06-02 22:51:40] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-02 22:51:40] [INFO ] Invariant cache hit.
[2024-06-02 22:51:40] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2024-06-02 22:51:40] [INFO ] Invariant cache hit.
[2024-06-02 22:51:41] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 205/229 places, 258/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 289 ms. Remains : 205/229 places, 258/284 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-11-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s122 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 23 steps with 0 reset in 1 ms.
FORMULA CO4-PT-11-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-11-LTLFireability-15 finished in 431 ms.
All properties solved by simple procedures.
Total runtime 12783 ms.

BK_STOP 1717368702278

--------------------
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-11"
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-11, 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-171734910100053"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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