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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 5.9K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K 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 174K 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-14-LTLFireability-00
FORMULA_NAME CO4-PT-14-LTLFireability-01
FORMULA_NAME CO4-PT-14-LTLFireability-02
FORMULA_NAME CO4-PT-14-LTLFireability-03
FORMULA_NAME CO4-PT-14-LTLFireability-04
FORMULA_NAME CO4-PT-14-LTLFireability-05
FORMULA_NAME CO4-PT-14-LTLFireability-06
FORMULA_NAME CO4-PT-14-LTLFireability-07
FORMULA_NAME CO4-PT-14-LTLFireability-08
FORMULA_NAME CO4-PT-14-LTLFireability-09
FORMULA_NAME CO4-PT-14-LTLFireability-10
FORMULA_NAME CO4-PT-14-LTLFireability-11
FORMULA_NAME CO4-PT-14-LTLFireability-12
FORMULA_NAME CO4-PT-14-LTLFireability-13
FORMULA_NAME CO4-PT-14-LTLFireability-14
FORMULA_NAME CO4-PT-14-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717368730971

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-14
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-06-02 22:52:12] [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:52:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:52:12] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2024-06-02 22:52:12] [INFO ] Transformed 680 places.
[2024-06-02 22:52:12] [INFO ] Transformed 812 transitions.
[2024-06-02 22:52:12] [INFO ] Found NUPN structural information;
[2024-06-02 22:52:12] [INFO ] Parsed PT model containing 680 places and 812 transitions and 1822 arcs in 133 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 100 places in 7 ms
Reduce places removed 100 places and 120 transitions.
FORMULA CO4-PT-14-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-14-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-14-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-14-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-14-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-14-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 580 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 580/580 places, 692/692 transitions.
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 569 transition count 691
Discarding 121 places :
Symmetric choice reduction at 1 with 121 rule applications. Total rules 133 place count 448 transition count 568
Iterating global reduction 1 with 121 rules applied. Total rules applied 254 place count 448 transition count 568
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 259 place count 448 transition count 563
Discarding 65 places :
Symmetric choice reduction at 2 with 65 rule applications. Total rules 324 place count 383 transition count 498
Iterating global reduction 2 with 65 rules applied. Total rules applied 389 place count 383 transition count 498
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 390 place count 383 transition count 497
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 402 place count 371 transition count 482
Iterating global reduction 3 with 12 rules applied. Total rules applied 414 place count 371 transition count 482
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 417 place count 371 transition count 479
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 420 place count 368 transition count 476
Iterating global reduction 4 with 3 rules applied. Total rules applied 423 place count 368 transition count 476
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 425 place count 366 transition count 474
Iterating global reduction 4 with 2 rules applied. Total rules applied 427 place count 366 transition count 474
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 429 place count 366 transition count 472
Applied a total of 429 rules in 116 ms. Remains 366 /580 variables (removed 214) and now considering 472/692 (removed 220) transitions.
// Phase 1: matrix 472 rows 366 cols
[2024-06-02 22:52:13] [INFO ] Computed 5 invariants in 22 ms
[2024-06-02 22:52:13] [INFO ] Implicit Places using invariants in 258 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 416 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 365/580 places, 472/692 transitions.
Applied a total of 0 rules in 8 ms. Remains 365 /365 variables (removed 0) and now considering 472/472 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 540 ms. Remains : 365/580 places, 472/692 transitions.
Support contains 25 out of 365 places after structural reductions.
[2024-06-02 22:52:13] [INFO ] Flatten gal took : 52 ms
[2024-06-02 22:52:13] [INFO ] Flatten gal took : 28 ms
[2024-06-02 22:52:13] [INFO ] Input system was already deterministic with 472 transitions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 382 ms. (steps per millisecond=26 ) properties (out of 21) seen :4
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :1
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 472 rows 365 cols
[2024-06-02 22:52:14] [INFO ] Computed 4 invariants in 4 ms
[2024-06-02 22:52:14] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-02 22:52:14] [INFO ] After 230ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2024-06-02 22:52:14] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-02 22:52:15] [INFO ] After 449ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2024-06-02 22:52:15] [INFO ] After 943ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 258 ms.
[2024-06-02 22:52:15] [INFO ] After 1466ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Parikh walk visited 14 properties in 50 ms.
Support contains 2 out of 365 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 365/365 places, 472/472 transitions.
Graph (trivial) has 392 edges and 365 vertex of which 2 / 365 are part of one of the 1 SCC in 9 ms
Free SCC test removed 1 places
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 610 edges and 364 vertex of which 346 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.2 ms
Discarding 18 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 132 transitions
Trivial Post-agglo rules discarded 132 transitions
Performed 132 trivial Post agglomeration. Transition count delta: 132
Iterating post reduction 0 with 145 rules applied. Total rules applied 147 place count 346 transition count 310
Reduce places removed 132 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 133 rules applied. Total rules applied 280 place count 214 transition count 309
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 280 place count 214 transition count 268
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 362 place count 173 transition count 268
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 365 place count 170 transition count 265
Iterating global reduction 2 with 3 rules applied. Total rules applied 368 place count 170 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 369 place count 170 transition count 264
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 369 place count 170 transition count 263
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 371 place count 169 transition count 263
Performed 60 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 491 place count 109 transition count 192
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 8 rules applied. Total rules applied 499 place count 109 transition count 184
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 501 place count 108 transition count 183
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 505 place count 104 transition count 179
Iterating global reduction 5 with 4 rules applied. Total rules applied 509 place count 104 transition count 179
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 5 with 6 rules applied. Total rules applied 515 place count 101 transition count 176
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 519 place count 101 transition count 172
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 523 place count 97 transition count 168
Iterating global reduction 6 with 4 rules applied. Total rules applied 527 place count 97 transition count 168
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 528 place count 97 transition count 167
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 534 place count 94 transition count 164
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 537 place count 94 transition count 161
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 540 place count 91 transition count 158
Iterating global reduction 8 with 3 rules applied. Total rules applied 543 place count 91 transition count 158
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 545 place count 91 transition count 156
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 546 place count 90 transition count 155
Iterating global reduction 9 with 1 rules applied. Total rules applied 547 place count 90 transition count 155
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 548 place count 90 transition count 154
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 10 with 56 rules applied. Total rules applied 604 place count 62 transition count 156
Drop transitions removed 16 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 10 with 36 rules applied. Total rules applied 640 place count 62 transition count 120
Discarding 25 places :
Symmetric choice reduction at 11 with 25 rule applications. Total rules 665 place count 37 transition count 84
Iterating global reduction 11 with 25 rules applied. Total rules applied 690 place count 37 transition count 84
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 11 with 19 rules applied. Total rules applied 709 place count 37 transition count 65
Discarding 4 places :
Symmetric choice reduction at 12 with 4 rule applications. Total rules 713 place count 33 transition count 54
Iterating global reduction 12 with 4 rules applied. Total rules applied 717 place count 33 transition count 54
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 720 place count 33 transition count 51
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 721 place count 33 transition count 50
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 722 place count 32 transition count 49
Iterating global reduction 13 with 1 rules applied. Total rules applied 723 place count 32 transition count 49
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 724 place count 32 transition count 48
Free-agglomeration rule applied 7 times.
Iterating global reduction 14 with 7 rules applied. Total rules applied 731 place count 32 transition count 41
Reduce places removed 7 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 9 rules applied. Total rules applied 740 place count 25 transition count 39
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 15 with 2 rules applied. Total rules applied 742 place count 25 transition count 37
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 743 place count 25 transition count 37
Graph (complete) has 73 edges and 25 vertex of which 24 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 15 with 1 rules applied. Total rules applied 744 place count 24 transition count 37
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 745 place count 24 transition count 36
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 746 place count 24 transition count 36
Graph (complete) has 70 edges and 24 vertex of which 23 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 747 place count 23 transition count 36
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 748 place count 23 transition count 35
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 749 place count 23 transition count 35
Graph (complete) has 67 edges and 23 vertex of which 22 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 750 place count 22 transition count 35
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 751 place count 22 transition count 34
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 21 with 1 rules applied. Total rules applied 752 place count 21 transition count 33
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t44.t420 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 14 edges and 17 vertex of which 3 / 17 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 21 with 3 rules applied. Total rules applied 755 place count 15 transition count 31
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t41.t406.t123.t27.t28.t29.t31.t120.t461.t124.t125 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 10 edges and 13 vertex of which 3 / 13 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 22 with 8 rules applied. Total rules applied 763 place count 11 transition count 24
Drop transitions removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 23 with 5 rules applied. Total rules applied 768 place count 11 transition count 19
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 24 with 3 rules applied. Total rules applied 771 place count 11 transition count 16
Discarding 2 places :
Symmetric choice reduction at 24 with 2 rule applications. Total rules 773 place count 9 transition count 14
Iterating global reduction 24 with 2 rules applied. Total rules applied 775 place count 9 transition count 14
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 24 with 2 rules applied. Total rules applied 777 place count 9 transition count 12
Discarding 1 places :
Symmetric choice reduction at 25 with 1 rule applications. Total rules 778 place count 8 transition count 11
Iterating global reduction 25 with 1 rules applied. Total rules applied 779 place count 8 transition count 11
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 25 with 1 rules applied. Total rules applied 780 place count 8 transition count 10
Free-agglomeration rule applied 1 times.
Iterating global reduction 26 with 1 rules applied. Total rules applied 781 place count 8 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 26 with 1 rules applied. Total rules applied 782 place count 7 transition count 9
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 27 with 1 rules applied. Total rules applied 783 place count 7 transition count 9
Applied a total of 783 rules in 116 ms. Remains 7 /365 variables (removed 358) and now considering 9/472 (removed 463) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 7/365 places, 9/472 transitions.
Finished random walk after 5 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 612 edges and 365 vertex of which 362 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.5 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (p1||G((G(F(!p0)) U p2)))))'
Support contains 3 out of 365 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 365/365 places, 472/472 transitions.
Graph (trivial) has 390 edges and 365 vertex of which 2 / 365 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 611 edges and 364 vertex of which 361 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 131 transitions
Trivial Post-agglo rules discarded 131 transitions
Performed 131 trivial Post agglomeration. Transition count delta: 131
Iterating post reduction 0 with 131 rules applied. Total rules applied 133 place count 360 transition count 336
Reduce places removed 131 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 133 rules applied. Total rules applied 266 place count 229 transition count 334
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 267 place count 228 transition count 334
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 267 place count 228 transition count 293
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 349 place count 187 transition count 293
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 351 place count 185 transition count 291
Iterating global reduction 3 with 2 rules applied. Total rules applied 353 place count 185 transition count 291
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 353 place count 185 transition count 290
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 355 place count 184 transition count 290
Performed 62 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 479 place count 122 transition count 214
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 8 rules applied. Total rules applied 487 place count 122 transition count 206
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 489 place count 121 transition count 205
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 494 place count 116 transition count 200
Iterating global reduction 5 with 5 rules applied. Total rules applied 499 place count 116 transition count 200
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 500 place count 116 transition count 199
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 6 with 6 rules applied. Total rules applied 506 place count 113 transition count 196
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 6 with 64 rules applied. Total rules applied 570 place count 81 transition count 198
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 20 rules applied. Total rules applied 590 place count 81 transition count 178
Discarding 27 places :
Symmetric choice reduction at 7 with 27 rule applications. Total rules 617 place count 54 transition count 124
Iterating global reduction 7 with 27 rules applied. Total rules applied 644 place count 54 transition count 124
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 7 with 18 rules applied. Total rules applied 662 place count 54 transition count 106
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 668 place count 48 transition count 89
Iterating global reduction 8 with 6 rules applied. Total rules applied 674 place count 48 transition count 89
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 678 place count 48 transition count 85
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 682 place count 48 transition count 81
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 684 place count 46 transition count 79
Applied a total of 684 rules in 45 ms. Remains 46 /365 variables (removed 319) and now considering 79/472 (removed 393) transitions.
[2024-06-02 22:52:16] [INFO ] Flow matrix only has 74 transitions (discarded 5 similar events)
// Phase 1: matrix 74 rows 46 cols
[2024-06-02 22:52:16] [INFO ] Computed 4 invariants in 0 ms
[2024-06-02 22:52:16] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-02 22:52:16] [INFO ] Flow matrix only has 74 transitions (discarded 5 similar events)
[2024-06-02 22:52:16] [INFO ] Invariant cache hit.
[2024-06-02 22:52:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 22:52:16] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2024-06-02 22:52:16] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 22:52:16] [INFO ] Flow matrix only has 74 transitions (discarded 5 similar events)
[2024-06-02 22:52:16] [INFO ] Invariant cache hit.
[2024-06-02 22:52:16] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/365 places, 79/472 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 247 ms. Remains : 46/365 places, 79/472 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 569 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) p0), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) p0)]
Running random walk in product with property : CO4-PT-14-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=0 dest: 5}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(NOT p0), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) p2 p0), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s24 1), p2:(EQ s6 1), p0:(EQ s20 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 2 ms.
FORMULA CO4-PT-14-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-14-LTLFireability-00 finished in 874 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&&(p1 U (F(G(!p2)) U p2))))))'
Support contains 4 out of 365 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 365/365 places, 472/472 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 356 transition count 463
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 356 transition count 463
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 355 transition count 462
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 355 transition count 462
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 354 transition count 461
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 354 transition count 461
Applied a total of 22 rules in 26 ms. Remains 354 /365 variables (removed 11) and now considering 461/472 (removed 11) transitions.
// Phase 1: matrix 461 rows 354 cols
[2024-06-02 22:52:17] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 22:52:17] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-02 22:52:17] [INFO ] Invariant cache hit.
[2024-06-02 22:52:17] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
[2024-06-02 22:52:17] [INFO ] Invariant cache hit.
[2024-06-02 22:52:17] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 354/365 places, 461/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 568 ms. Remains : 354/365 places, 461/472 transitions.
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, p2, (NOT p2), (NOT p2)]
Running random walk in product with property : CO4-PT-14-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=p2, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s273 1), p2:(AND (EQ s270 1) (EQ s343 1)), p1:(EQ s152 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CO4-PT-14-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-14-LTLFireability-01 finished in 780 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0&&X(p1)))||(p0&&X((p1&&X(F(p2)))))))'
Support contains 3 out of 365 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 365/365 places, 472/472 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 355 transition count 462
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 355 transition count 462
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 354 transition count 461
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 354 transition count 461
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 353 transition count 460
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 353 transition count 460
Applied a total of 24 rules in 22 ms. Remains 353 /365 variables (removed 12) and now considering 460/472 (removed 12) transitions.
// Phase 1: matrix 460 rows 353 cols
[2024-06-02 22:52:17] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 22:52:18] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-02 22:52:18] [INFO ] Invariant cache hit.
[2024-06-02 22:52:18] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
[2024-06-02 22:52:18] [INFO ] Invariant cache hit.
[2024-06-02 22:52:18] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 353/365 places, 460/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 445 ms. Remains : 353/365 places, 460/472 transitions.
Stuttering acceptance computed with spot in 147 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : CO4-PT-14-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=1, aps=[p0:(NEQ s176 1), p1:(NEQ s242 1), p2:(OR (EQ s176 1) (EQ s341 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, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 77094 steps with 2634 reset in 224 ms.
FORMULA CO4-PT-14-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-14-LTLFireability-02 finished in 835 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p1))||p0)))'
Support contains 3 out of 365 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 365/365 places, 472/472 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 356 transition count 463
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 356 transition count 463
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 355 transition count 462
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 355 transition count 462
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 354 transition count 461
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 354 transition count 461
Applied a total of 22 rules in 13 ms. Remains 354 /365 variables (removed 11) and now considering 461/472 (removed 11) transitions.
// Phase 1: matrix 461 rows 354 cols
[2024-06-02 22:52:18] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 22:52:18] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-02 22:52:18] [INFO ] Invariant cache hit.
[2024-06-02 22:52:19] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
[2024-06-02 22:52:19] [INFO ] Invariant cache hit.
[2024-06-02 22:52:19] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 354/365 places, 461/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 433 ms. Remains : 354/365 places, 461/472 transitions.
Stuttering acceptance computed with spot in 106 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CO4-PT-14-LTLFireability-03 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: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (EQ s38 1) (EQ s228 1)), p1:(EQ s88 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 12 reset in 111 ms.
Product exploration explored 100000 steps with 10 reset in 125 ms.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 600 edges and 354 vertex of which 351 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.12 ms
Computed a total of 13 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 163 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 1832 steps, including 53 resets, run visited all 1 properties in 6 ms. (steps per millisecond=305 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Support contains 1 out of 354 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 354/354 places, 461/461 transitions.
Applied a total of 0 rules in 8 ms. Remains 354 /354 variables (removed 0) and now considering 461/461 (removed 0) transitions.
[2024-06-02 22:52:20] [INFO ] Invariant cache hit.
[2024-06-02 22:52:20] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 22:52:20] [INFO ] Invariant cache hit.
[2024-06-02 22:52:20] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2024-06-02 22:52:20] [INFO ] Invariant cache hit.
[2024-06-02 22:52:20] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 394 ms. Remains : 354/354 places, 461/461 transitions.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 600 edges and 354 vertex of which 351 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Computed a total of 13 stabilizing places and 16 stable transitions
Knowledge obtained : [p1, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 58 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1812954 steps, run timeout after 3001 ms. (steps per millisecond=604 ) properties seen :{}
Probabilistic random walk after 1812954 steps, saw 319937 distinct states, run finished after 3002 ms. (steps per millisecond=603 ) properties seen :0
Running SMT prover for 1 properties.
[2024-06-02 22:52:23] [INFO ] Invariant cache hit.
[2024-06-02 22:52:23] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:52:23] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-02 22:52:24] [INFO ] After 108ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 22:52:24] [INFO ] After 130ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-06-02 22:52:24] [INFO ] After 197ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 20 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=20 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p1, (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 3 reset in 67 ms.
Product exploration explored 100000 steps with 5 reset in 88 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Support contains 1 out of 354 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 354/354 places, 461/461 transitions.
Graph (trivial) has 382 edges and 354 vertex of which 2 / 354 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 599 edges and 353 vertex of which 350 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 123 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 123 rules applied. Total rules applied 125 place count 350 transition count 457
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 126 place count 350 transition count 456
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 126 place count 350 transition count 499
Deduced a syphon composed of 168 places in 0 ms
Iterating global reduction 2 with 45 rules applied. Total rules applied 171 place count 350 transition count 499
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 198 place count 323 transition count 472
Deduced a syphon composed of 141 places in 0 ms
Iterating global reduction 2 with 27 rules applied. Total rules applied 225 place count 323 transition count 472
Performed 42 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 183 places in 0 ms
Iterating global reduction 2 with 42 rules applied. Total rules applied 267 place count 323 transition count 521
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 274 place count 323 transition count 514
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 296 place count 301 transition count 488
Deduced a syphon composed of 166 places in 0 ms
Iterating global reduction 3 with 22 rules applied. Total rules applied 318 place count 301 transition count 488
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 320 place count 299 transition count 485
Deduced a syphon composed of 165 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 322 place count 299 transition count 485
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 323 place count 299 transition count 484
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 324 place count 298 transition count 483
Deduced a syphon composed of 164 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 325 place count 298 transition count 483
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 165 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 326 place count 298 transition count 483
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 327 place count 298 transition count 482
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 329 place count 296 transition count 480
Deduced a syphon composed of 163 places in 0 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 331 place count 296 transition count 480
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 164 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 332 place count 296 transition count 480
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 333 place count 295 transition count 479
Deduced a syphon composed of 163 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 334 place count 295 transition count 479
Performed 54 Post agglomeration using F-continuation condition with reduction of 23 identical transitions.
Deduced a syphon composed of 217 places in 0 ms
Iterating global reduction 5 with 54 rules applied. Total rules applied 388 place count 295 transition count 696
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 5 with 52 rules applied. Total rules applied 440 place count 295 transition count 644
Discarding 111 places :
Symmetric choice reduction at 6 with 111 rule applications. Total rules 551 place count 184 transition count 393
Deduced a syphon composed of 134 places in 0 ms
Iterating global reduction 6 with 111 rules applied. Total rules applied 662 place count 184 transition count 393
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 6 with 34 rules applied. Total rules applied 696 place count 184 transition count 359
Discarding 70 places :
Symmetric choice reduction at 7 with 70 rule applications. Total rules 766 place count 114 transition count 234
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 7 with 70 rules applied. Total rules applied 836 place count 114 transition count 234
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 843 place count 114 transition count 227
Discarding 14 places :
Symmetric choice reduction at 8 with 14 rule applications. Total rules 857 place count 100 transition count 199
Deduced a syphon composed of 57 places in 0 ms
Iterating global reduction 8 with 14 rules applied. Total rules applied 871 place count 100 transition count 199
Deduced a syphon composed of 57 places in 0 ms
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 8 with 12 rules applied. Total rules applied 883 place count 100 transition count 187
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 884 place count 99 transition count 186
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 885 place count 99 transition count 186
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 57 places in 0 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 886 place count 99 transition count 207
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 887 place count 98 transition count 199
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 888 place count 98 transition count 199
Deduced a syphon composed of 56 places in 0 ms
Applied a total of 888 rules in 103 ms. Remains 98 /354 variables (removed 256) and now considering 199/461 (removed 262) transitions.
[2024-06-02 22:52:25] [INFO ] Redundant transitions in 5 ms returned []
[2024-06-02 22:52:25] [INFO ] Flow matrix only has 194 transitions (discarded 5 similar events)
// Phase 1: matrix 194 rows 98 cols
[2024-06-02 22:52:25] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:52:25] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 98/354 places, 199/461 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 270 ms. Remains : 98/354 places, 199/461 transitions.
Built C files in :
/tmp/ltsmin13126921862997339932
[2024-06-02 22:52:25] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13126921862997339932
Running compilation step : cd /tmp/ltsmin13126921862997339932;'/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 729 ms.
Running link step : cd /tmp/ltsmin13126921862997339932;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin13126921862997339932;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9302976775730860319.hoa' '--buchi-type=spotba'
LTSmin run took 996 ms.
FORMULA CO4-PT-14-LTLFireability-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-14-LTLFireability-03 finished in 8368 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(X(p1)&&F(p2))))'
Support contains 3 out of 365 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 365/365 places, 472/472 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 357 transition count 464
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 357 transition count 464
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 356 transition count 463
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 356 transition count 463
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 355 transition count 462
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 355 transition count 462
Applied a total of 20 rules in 24 ms. Remains 355 /365 variables (removed 10) and now considering 462/472 (removed 10) transitions.
// Phase 1: matrix 462 rows 355 cols
[2024-06-02 22:52:27] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 22:52:27] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-02 22:52:27] [INFO ] Invariant cache hit.
[2024-06-02 22:52:27] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
[2024-06-02 22:52:27] [INFO ] Invariant cache hit.
[2024-06-02 22:52:27] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 355/365 places, 462/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 442 ms. Remains : 355/365 places, 462/472 transitions.
Stuttering acceptance computed with spot in 259 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : CO4-PT-14-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={} source=1 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s43 0), p2:(EQ s67 1), p1:(EQ s234 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 6 reset in 68 ms.
Product exploration explored 100000 steps with 1 reset in 67 ms.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 601 edges and 355 vertex of which 352 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p1)), (X (AND p0 (NOT p1))), true, (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 108 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1879704 steps, run timeout after 3003 ms. (steps per millisecond=625 ) properties seen :{}
Probabilistic random walk after 1879704 steps, saw 330126 distinct states, run finished after 3003 ms. (steps per millisecond=625 ) properties seen :0
Running SMT prover for 1 properties.
[2024-06-02 22:52:31] [INFO ] Invariant cache hit.
[2024-06-02 22:52:31] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:52:31] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-02 22:52:31] [INFO ] After 120ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 22:52:31] [INFO ] After 145ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2024-06-02 22:52:31] [INFO ] After 212ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 32 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=32 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p1)), (X (AND p0 (NOT p1))), true, (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 12 factoid took 139 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-14-LTLFireability-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-14-LTLFireability-06 finished in 4471 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 365 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 365/365 places, 472/472 transitions.
Graph (trivial) has 394 edges and 365 vertex of which 2 / 365 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 611 edges and 364 vertex of which 361 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 132 transitions
Trivial Post-agglo rules discarded 132 transitions
Performed 132 trivial Post agglomeration. Transition count delta: 132
Iterating post reduction 0 with 132 rules applied. Total rules applied 134 place count 360 transition count 335
Reduce places removed 132 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 133 rules applied. Total rules applied 267 place count 228 transition count 334
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 267 place count 228 transition count 292
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 351 place count 186 transition count 292
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 353 place count 184 transition count 290
Iterating global reduction 2 with 2 rules applied. Total rules applied 355 place count 184 transition count 290
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 355 place count 184 transition count 289
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 357 place count 183 transition count 289
Performed 63 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 483 place count 120 transition count 212
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 491 place count 120 transition count 204
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 493 place count 119 transition count 203
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 498 place count 114 transition count 198
Iterating global reduction 4 with 5 rules applied. Total rules applied 503 place count 114 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 504 place count 114 transition count 197
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 5 with 6 rules applied. Total rules applied 510 place count 111 transition count 194
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 5 with 66 rules applied. Total rules applied 576 place count 78 transition count 196
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 5 with 20 rules applied. Total rules applied 596 place count 78 transition count 176
Discarding 28 places :
Symmetric choice reduction at 6 with 28 rule applications. Total rules 624 place count 50 transition count 120
Iterating global reduction 6 with 28 rules applied. Total rules applied 652 place count 50 transition count 120
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 6 with 18 rules applied. Total rules applied 670 place count 50 transition count 102
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 677 place count 43 transition count 82
Iterating global reduction 7 with 7 rules applied. Total rules applied 684 place count 43 transition count 82
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 689 place count 43 transition count 77
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 693 place count 43 transition count 73
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 695 place count 41 transition count 71
Applied a total of 695 rules in 35 ms. Remains 41 /365 variables (removed 324) and now considering 71/472 (removed 401) transitions.
[2024-06-02 22:52:31] [INFO ] Flow matrix only has 66 transitions (discarded 5 similar events)
// Phase 1: matrix 66 rows 41 cols
[2024-06-02 22:52:31] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:52:31] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-02 22:52:31] [INFO ] Flow matrix only has 66 transitions (discarded 5 similar events)
[2024-06-02 22:52:31] [INFO ] Invariant cache hit.
[2024-06-02 22:52:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 22:52:31] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2024-06-02 22:52:31] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 22:52:31] [INFO ] Flow matrix only has 66 transitions (discarded 5 similar events)
[2024-06-02 22:52:31] [INFO ] Invariant cache hit.
[2024-06-02 22:52:31] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/365 places, 71/472 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 166 ms. Remains : 41/365 places, 71/472 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-14-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s13 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA CO4-PT-14-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-14-LTLFireability-08 finished in 208 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 365 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 365/365 places, 472/472 transitions.
Graph (trivial) has 390 edges and 365 vertex of which 2 / 365 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 611 edges and 364 vertex of which 361 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 132 transitions
Trivial Post-agglo rules discarded 132 transitions
Performed 132 trivial Post agglomeration. Transition count delta: 132
Iterating post reduction 0 with 132 rules applied. Total rules applied 134 place count 360 transition count 335
Reduce places removed 132 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 133 rules applied. Total rules applied 267 place count 228 transition count 334
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 267 place count 228 transition count 293
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 349 place count 187 transition count 293
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 351 place count 185 transition count 291
Iterating global reduction 2 with 2 rules applied. Total rules applied 353 place count 185 transition count 291
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 353 place count 185 transition count 290
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 355 place count 184 transition count 290
Performed 62 Post agglomeration using F-continuation condition with reduction of 13 identical transitions.
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 2 with 124 rules applied. Total rules applied 479 place count 122 transition count 215
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 486 place count 122 transition count 208
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 488 place count 121 transition count 207
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 493 place count 116 transition count 202
Iterating global reduction 4 with 5 rules applied. Total rules applied 498 place count 116 transition count 202
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 499 place count 116 transition count 201
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 5 with 6 rules applied. Total rules applied 505 place count 113 transition count 198
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 5 with 66 rules applied. Total rules applied 571 place count 80 transition count 200
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 5 with 21 rules applied. Total rules applied 592 place count 80 transition count 179
Discarding 28 places :
Symmetric choice reduction at 6 with 28 rule applications. Total rules 620 place count 52 transition count 123
Iterating global reduction 6 with 28 rules applied. Total rules applied 648 place count 52 transition count 123
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 6 with 18 rules applied. Total rules applied 666 place count 52 transition count 105
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 672 place count 46 transition count 87
Iterating global reduction 7 with 6 rules applied. Total rules applied 678 place count 46 transition count 87
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 682 place count 46 transition count 83
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 688 place count 46 transition count 77
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 8 with 2 rules applied. Total rules applied 690 place count 45 transition count 85
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 692 place count 43 transition count 83
Applied a total of 692 rules in 36 ms. Remains 43 /365 variables (removed 322) and now considering 83/472 (removed 389) transitions.
[2024-06-02 22:52:31] [INFO ] Flow matrix only has 76 transitions (discarded 7 similar events)
// Phase 1: matrix 76 rows 43 cols
[2024-06-02 22:52:31] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:52:31] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-02 22:52:31] [INFO ] Flow matrix only has 76 transitions (discarded 7 similar events)
[2024-06-02 22:52:31] [INFO ] Invariant cache hit.
[2024-06-02 22:52:31] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 22:52:31] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2024-06-02 22:52:31] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 22:52:31] [INFO ] Flow matrix only has 76 transitions (discarded 7 similar events)
[2024-06-02 22:52:31] [INFO ] Invariant cache hit.
[2024-06-02 22:52:31] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/365 places, 83/472 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 177 ms. Remains : 43/365 places, 83/472 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-14-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s14 1) (OR (NEQ s12 1) (NEQ s19 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 54 reset in 82 ms.
Product exploration explored 100000 steps with 24 reset in 88 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 78 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 149 steps, including 14 resets, run visited all 1 properties in 2 ms. (steps per millisecond=74 )
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 89 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 30 ms :[(NOT p0)]
Support contains 3 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 83/83 transitions.
Applied a total of 0 rules in 3 ms. Remains 43 /43 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2024-06-02 22:52:32] [INFO ] Flow matrix only has 76 transitions (discarded 7 similar events)
[2024-06-02 22:52:32] [INFO ] Invariant cache hit.
[2024-06-02 22:52:32] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-02 22:52:32] [INFO ] Flow matrix only has 76 transitions (discarded 7 similar events)
[2024-06-02 22:52:32] [INFO ] Invariant cache hit.
[2024-06-02 22:52:32] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 22:52:32] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2024-06-02 22:52:32] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 22:52:32] [INFO ] Flow matrix only has 76 transitions (discarded 7 similar events)
[2024-06-02 22:52:32] [INFO ] Invariant cache hit.
[2024-06-02 22:52:32] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 134 ms. Remains : 43/43 places, 83/83 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 84 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 29 ms :[(NOT p0)]
Finished random walk after 853 steps, including 82 resets, run visited all 1 properties in 5 ms. (steps per millisecond=170 )
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 75 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Product exploration explored 100000 steps with 30 reset in 49 ms.
Product exploration explored 100000 steps with 19 reset in 44 ms.
Built C files in :
/tmp/ltsmin3118246898295953448
[2024-06-02 22:52:33] [INFO ] Computing symmetric may disable matrix : 83 transitions.
[2024-06-02 22:52:33] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:52:33] [INFO ] Computing symmetric may enable matrix : 83 transitions.
[2024-06-02 22:52:33] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:52:33] [INFO ] Computing Do-Not-Accords matrix : 83 transitions.
[2024-06-02 22:52:33] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:52:33] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3118246898295953448
Running compilation step : cd /tmp/ltsmin3118246898295953448;'/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 173 ms.
Running link step : cd /tmp/ltsmin3118246898295953448;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin3118246898295953448;'/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/stateBased8162532647230067237.hoa' '--buchi-type=spotba'
LTSmin run took 107 ms.
FORMULA CO4-PT-14-LTLFireability-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-14-LTLFireability-09 finished in 1576 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((F(p0)&&(!p1||X(G(p2))))))))'
Support contains 3 out of 365 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 365/365 places, 472/472 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 355 transition count 462
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 355 transition count 462
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 354 transition count 461
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 354 transition count 461
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 353 transition count 460
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 353 transition count 460
Applied a total of 24 rules in 17 ms. Remains 353 /365 variables (removed 12) and now considering 460/472 (removed 12) transitions.
// Phase 1: matrix 460 rows 353 cols
[2024-06-02 22:52:33] [INFO ] Computed 4 invariants in 3 ms
[2024-06-02 22:52:33] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-02 22:52:33] [INFO ] Invariant cache hit.
[2024-06-02 22:52:33] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
[2024-06-02 22:52:33] [INFO ] Invariant cache hit.
[2024-06-02 22:52:33] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 353/365 places, 460/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 446 ms. Remains : 353/365 places, 460/472 transitions.
Stuttering acceptance computed with spot in 240 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CO4-PT-14-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p1 p2), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s242 0), p1:(NEQ s242 1), p2:(OR (NEQ s313 1) (NEQ s315 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 82 ms.
Stack based approach found an accepted trace after 941 steps with 28 reset with depth 35 and stack size 35 in 2 ms.
FORMULA CO4-PT-14-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property CO4-PT-14-LTLFireability-12 finished in 789 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(F(p0)))))))'
Support contains 1 out of 365 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 365/365 places, 472/472 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 356 transition count 463
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 356 transition count 463
Applied a total of 18 rules in 9 ms. Remains 356 /365 variables (removed 9) and now considering 463/472 (removed 9) transitions.
// Phase 1: matrix 463 rows 356 cols
[2024-06-02 22:52:34] [INFO ] Computed 4 invariants in 2 ms
[2024-06-02 22:52:34] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-02 22:52:34] [INFO ] Invariant cache hit.
[2024-06-02 22:52:34] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
[2024-06-02 22:52:34] [INFO ] Invariant cache hit.
[2024-06-02 22:52:34] [INFO ] Dead Transitions using invariants and state equation in 164 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 356/365 places, 463/472 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 454 ms. Remains : 356/365 places, 463/472 transitions.
Stuttering acceptance computed with spot in 219 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-14-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=4, aps=[p0:(EQ s217 0)], 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, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 16666 reset in 149 ms.
Product exploration explored 100000 steps with 16666 reset in 154 ms.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 602 edges and 356 vertex of which 353 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 103 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Finished probabilistic random walk after 14471 steps, run visited all 1 properties in 33 ms. (steps per millisecond=438 )
Probabilistic random walk after 14471 steps, saw 3647 distinct states, run finished after 34 ms. (steps per millisecond=425 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 125 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 285 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 320 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 356 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 356/356 places, 463/463 transitions.
Applied a total of 0 rules in 7 ms. Remains 356 /356 variables (removed 0) and now considering 463/463 (removed 0) transitions.
[2024-06-02 22:52:36] [INFO ] Invariant cache hit.
[2024-06-02 22:52:36] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-06-02 22:52:36] [INFO ] Invariant cache hit.
[2024-06-02 22:52:36] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
[2024-06-02 22:52:36] [INFO ] Invariant cache hit.
[2024-06-02 22:52:36] [INFO ] Dead Transitions using invariants and state equation in 164 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 524 ms. Remains : 356/356 places, 463/463 transitions.
Computed a total of 13 stabilizing places and 16 stable transitions
Graph (complete) has 602 edges and 356 vertex of which 353 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 13 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 75 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 37 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Finished probabilistic random walk after 14471 steps, run visited all 1 properties in 36 ms. (steps per millisecond=401 )
Probabilistic random walk after 14471 steps, saw 3647 distinct states, run finished after 36 ms. (steps per millisecond=401 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 117 ms. Reduced automaton from 6 states, 6 edges and 1 AP (stutter sensitive) to 6 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 242 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 282 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 221 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 16666 reset in 163 ms.
Product exploration explored 100000 steps with 16666 reset in 174 ms.
Applying partial POR strategy [true, false, false, false, false, false]
Stuttering acceptance computed with spot in 228 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 356 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 356/356 places, 463/463 transitions.
Graph (trivial) has 386 edges and 356 vertex of which 2 / 356 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 601 edges and 355 vertex of which 352 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 124 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 124 rules applied. Total rules applied 126 place count 352 transition count 459
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 127 place count 352 transition count 458
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 127 place count 352 transition count 502
Deduced a syphon composed of 170 places in 0 ms
Iterating global reduction 2 with 46 rules applied. Total rules applied 173 place count 352 transition count 502
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 200 place count 325 transition count 475
Deduced a syphon composed of 143 places in 1 ms
Iterating global reduction 2 with 27 rules applied. Total rules applied 227 place count 325 transition count 475
Performed 41 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 184 places in 1 ms
Iterating global reduction 2 with 41 rules applied. Total rules applied 268 place count 325 transition count 524
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 275 place count 325 transition count 517
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 296 place count 304 transition count 492
Deduced a syphon composed of 168 places in 0 ms
Iterating global reduction 3 with 21 rules applied. Total rules applied 317 place count 304 transition count 492
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 319 place count 302 transition count 489
Deduced a syphon composed of 167 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 321 place count 302 transition count 489
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 322 place count 302 transition count 488
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 323 place count 301 transition count 487
Deduced a syphon composed of 166 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 324 place count 301 transition count 487
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 167 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 325 place count 301 transition count 487
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 326 place count 301 transition count 486
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 328 place count 299 transition count 484
Deduced a syphon composed of 165 places in 0 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 330 place count 299 transition count 484
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 166 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 331 place count 299 transition count 484
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 332 place count 298 transition count 483
Deduced a syphon composed of 165 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 333 place count 298 transition count 483
Performed 54 Post agglomeration using F-continuation condition with reduction of 23 identical transitions.
Deduced a syphon composed of 219 places in 0 ms
Iterating global reduction 5 with 54 rules applied. Total rules applied 387 place count 298 transition count 700
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 5 with 49 rules applied. Total rules applied 436 place count 298 transition count 651
Discarding 111 places :
Symmetric choice reduction at 6 with 111 rule applications. Total rules 547 place count 187 transition count 399
Deduced a syphon composed of 135 places in 0 ms
Iterating global reduction 6 with 111 rules applied. Total rules applied 658 place count 187 transition count 399
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 6 with 32 rules applied. Total rules applied 690 place count 187 transition count 367
Discarding 67 places :
Symmetric choice reduction at 7 with 67 rule applications. Total rules 757 place count 120 transition count 248
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 7 with 67 rules applied. Total rules applied 824 place count 120 transition count 248
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 829 place count 120 transition count 243
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 841 place count 108 transition count 219
Deduced a syphon composed of 62 places in 0 ms
Iterating global reduction 8 with 12 rules applied. Total rules applied 853 place count 108 transition count 219
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 63 places in 0 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 854 place count 108 transition count 244
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 861 place count 108 transition count 237
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 864 place count 105 transition count 219
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 867 place count 105 transition count 219
Deduced a syphon composed of 60 places in 0 ms
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 9 with 13 rules applied. Total rules applied 880 place count 105 transition count 206
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 881 place count 104 transition count 205
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 882 place count 104 transition count 205
Deduced a syphon composed of 59 places in 0 ms
Applied a total of 882 rules in 81 ms. Remains 104 /356 variables (removed 252) and now considering 205/463 (removed 258) transitions.
[2024-06-02 22:52:38] [INFO ] Redundant transitions in 2 ms returned []
[2024-06-02 22:52:38] [INFO ] Flow matrix only has 198 transitions (discarded 7 similar events)
// Phase 1: matrix 198 rows 104 cols
[2024-06-02 22:52:38] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 22:52:39] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/356 places, 205/463 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 243 ms. Remains : 104/356 places, 205/463 transitions.
Built C files in :
/tmp/ltsmin3020969860238925619
[2024-06-02 22:52:39] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3020969860238925619
Running compilation step : cd /tmp/ltsmin3020969860238925619;'/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 645 ms.
Running link step : cd /tmp/ltsmin3020969860238925619;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin3020969860238925619;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14028795380468203047.hoa' '--buchi-type=spotba'
LTSmin run took 230 ms.
FORMULA CO4-PT-14-LTLFireability-14 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-14-LTLFireability-14 finished in 5789 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)&&F(G(p1)))))'
Support contains 2 out of 365 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 365/365 places, 472/472 transitions.
Graph (trivial) has 394 edges and 365 vertex of which 2 / 365 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 611 edges and 364 vertex of which 361 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 133 transitions
Trivial Post-agglo rules discarded 133 transitions
Performed 133 trivial Post agglomeration. Transition count delta: 133
Iterating post reduction 0 with 133 rules applied. Total rules applied 135 place count 360 transition count 334
Reduce places removed 133 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 134 rules applied. Total rules applied 269 place count 227 transition count 333
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 269 place count 227 transition count 291
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 353 place count 185 transition count 291
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 355 place count 183 transition count 289
Iterating global reduction 2 with 2 rules applied. Total rules applied 357 place count 183 transition count 289
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 357 place count 183 transition count 288
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 359 place count 182 transition count 288
Performed 61 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 2 with 122 rules applied. Total rules applied 481 place count 121 transition count 216
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 10 rules applied. Total rules applied 491 place count 121 transition count 206
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 493 place count 120 transition count 205
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 498 place count 115 transition count 200
Iterating global reduction 4 with 5 rules applied. Total rules applied 503 place count 115 transition count 200
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 504 place count 115 transition count 199
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 5 with 6 rules applied. Total rules applied 510 place count 112 transition count 196
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 5 with 66 rules applied. Total rules applied 576 place count 79 transition count 198
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 5 with 21 rules applied. Total rules applied 597 place count 79 transition count 177
Discarding 28 places :
Symmetric choice reduction at 6 with 28 rule applications. Total rules 625 place count 51 transition count 121
Iterating global reduction 6 with 28 rules applied. Total rules applied 653 place count 51 transition count 121
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 672 place count 51 transition count 102
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 679 place count 44 transition count 82
Iterating global reduction 7 with 7 rules applied. Total rules applied 686 place count 44 transition count 82
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 691 place count 44 transition count 77
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
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 693 place count 43 transition count 94
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 8 with 11 rules applied. Total rules applied 704 place count 43 transition count 83
Partial Post-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 8 with 10 rules applied. Total rules applied 714 place count 43 transition count 83
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 715 place count 42 transition count 82
Applied a total of 715 rules in 33 ms. Remains 42 /365 variables (removed 323) and now considering 82/472 (removed 390) transitions.
[2024-06-02 22:52:40] [INFO ] Flow matrix only has 72 transitions (discarded 10 similar events)
// Phase 1: matrix 72 rows 42 cols
[2024-06-02 22:52:40] [INFO ] Computed 4 invariants in 0 ms
[2024-06-02 22:52:40] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-02 22:52:40] [INFO ] Flow matrix only has 72 transitions (discarded 10 similar events)
[2024-06-02 22:52:40] [INFO ] Invariant cache hit.
[2024-06-02 22:52:40] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-06-02 22:52:40] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2024-06-02 22:52:40] [INFO ] Redundant transitions in 0 ms returned []
[2024-06-02 22:52:40] [INFO ] Flow matrix only has 72 transitions (discarded 10 similar events)
[2024-06-02 22:52:40] [INFO ] Invariant cache hit.
[2024-06-02 22:52:40] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/365 places, 82/472 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 160 ms. Remains : 42/365 places, 82/472 transitions.
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CO4-PT-14-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s21 1), p1:(NEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA CO4-PT-14-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-14-LTLFireability-15 finished in 499 ms.
All properties solved by simple procedures.
Total runtime 28011 ms.

BK_STOP 1717368761731

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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-14"
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-14, 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-171734910200068"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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