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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 5.8K 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 4.5K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 64K 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 71K 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 255K 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-15-LTLFireability-00
FORMULA_NAME CO4-PT-15-LTLFireability-01
FORMULA_NAME CO4-PT-15-LTLFireability-02
FORMULA_NAME CO4-PT-15-LTLFireability-03
FORMULA_NAME CO4-PT-15-LTLFireability-04
FORMULA_NAME CO4-PT-15-LTLFireability-05
FORMULA_NAME CO4-PT-15-LTLFireability-06
FORMULA_NAME CO4-PT-15-LTLFireability-07
FORMULA_NAME CO4-PT-15-LTLFireability-08
FORMULA_NAME CO4-PT-15-LTLFireability-09
FORMULA_NAME CO4-PT-15-LTLFireability-10
FORMULA_NAME CO4-PT-15-LTLFireability-11
FORMULA_NAME CO4-PT-15-LTLFireability-12
FORMULA_NAME CO4-PT-15-LTLFireability-13
FORMULA_NAME CO4-PT-15-LTLFireability-14
FORMULA_NAME CO4-PT-15-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717368752893

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-15
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-06-02 22:52:34] [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:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:52:34] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2024-06-02 22:52:34] [INFO ] Transformed 833 places.
[2024-06-02 22:52:34] [INFO ] Transformed 1106 transitions.
[2024-06-02 22:52:34] [INFO ] Found NUPN structural information;
[2024-06-02 22:52:34] [INFO ] Parsed PT model containing 833 places and 1106 transitions and 2980 arcs in 150 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 1 formulas.
Deduced a syphon composed of 124 places in 10 ms
Reduce places removed 124 places and 197 transitions.
FORMULA CO4-PT-15-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-15-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 709 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 709/709 places, 909/909 transitions.
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 689 transition count 906
Discarding 158 places :
Symmetric choice reduction at 1 with 158 rule applications. Total rules 181 place count 531 transition count 746
Iterating global reduction 1 with 158 rules applied. Total rules applied 339 place count 531 transition count 746
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 346 place count 531 transition count 739
Discarding 77 places :
Symmetric choice reduction at 2 with 77 rule applications. Total rules 423 place count 454 transition count 652
Iterating global reduction 2 with 77 rules applied. Total rules applied 500 place count 454 transition count 652
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 502 place count 454 transition count 650
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 517 place count 439 transition count 628
Iterating global reduction 3 with 15 rules applied. Total rules applied 532 place count 439 transition count 628
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 534 place count 439 transition count 626
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 541 place count 432 transition count 619
Iterating global reduction 4 with 7 rules applied. Total rules applied 548 place count 432 transition count 619
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 553 place count 427 transition count 614
Iterating global reduction 4 with 5 rules applied. Total rules applied 558 place count 427 transition count 614
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 563 place count 427 transition count 609
Applied a total of 563 rules in 153 ms. Remains 427 /709 variables (removed 282) and now considering 609/909 (removed 300) transitions.
// Phase 1: matrix 609 rows 427 cols
[2024-06-02 22:52:35] [INFO ] Computed 7 invariants in 28 ms
[2024-06-02 22:52:35] [INFO ] Implicit Places using invariants in 276 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 304 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 426/709 places, 609/909 transitions.
Applied a total of 0 rules in 12 ms. Remains 426 /426 variables (removed 0) and now considering 609/609 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 469 ms. Remains : 426/709 places, 609/909 transitions.
Support contains 33 out of 426 places after structural reductions.
[2024-06-02 22:52:35] [INFO ] Flatten gal took : 69 ms
[2024-06-02 22:52:35] [INFO ] Flatten gal took : 36 ms
[2024-06-02 22:52:35] [INFO ] Input system was already deterministic with 609 transitions.
Support contains 31 out of 426 places (down from 33) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 221 resets, run finished after 456 ms. (steps per millisecond=21 ) properties (out of 26) seen :5
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :1
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) 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 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
// Phase 1: matrix 609 rows 426 cols
[2024-06-02 22:52:36] [INFO ] Computed 6 invariants in 5 ms
[2024-06-02 22:52:36] [INFO ] After 326ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2024-06-02 22:52:37] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-02 22:52:37] [INFO ] After 602ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2024-06-02 22:52:38] [INFO ] After 1287ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 396 ms.
[2024-06-02 22:52:38] [INFO ] After 2042ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
Fused 19 Parikh solutions to 18 different solutions.
Parikh walk visited 14 properties in 84 ms.
Support contains 5 out of 426 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 426/426 places, 609/609 transitions.
Graph (trivial) has 453 edges and 426 vertex of which 2 / 426 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 907 edges and 425 vertex of which 403 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.2 ms
Discarding 22 places :
Also discarding 11 output transitions
Drop transitions removed 11 transitions
Drop transitions removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 153 transitions
Trivial Post-agglo rules discarded 153 transitions
Performed 153 trivial Post agglomeration. Transition count delta: 153
Iterating post reduction 0 with 170 rules applied. Total rules applied 172 place count 403 transition count 417
Reduce places removed 153 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 156 rules applied. Total rules applied 328 place count 250 transition count 414
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 329 place count 249 transition count 414
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 329 place count 249 transition count 369
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 419 place count 204 transition count 369
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 426 place count 197 transition count 360
Iterating global reduction 3 with 7 rules applied. Total rules applied 433 place count 197 transition count 360
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 436 place count 197 transition count 357
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 436 place count 197 transition count 356
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 438 place count 196 transition count 356
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 440 place count 194 transition count 354
Iterating global reduction 4 with 2 rules applied. Total rules applied 442 place count 194 transition count 354
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 443 place count 194 transition count 353
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 444 place count 193 transition count 352
Iterating global reduction 5 with 1 rules applied. Total rules applied 445 place count 193 transition count 352
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 446 place count 193 transition count 351
Performed 62 Post agglomeration using F-continuation condition with reduction of 15 identical transitions.
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 6 with 124 rules applied. Total rules applied 570 place count 131 transition count 274
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 581 place count 131 transition count 263
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 585 place count 127 transition count 255
Iterating global reduction 7 with 4 rules applied. Total rules applied 589 place count 127 transition count 255
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 593 place count 125 transition count 253
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 595 place count 125 transition count 251
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 596 place count 124 transition count 249
Iterating global reduction 8 with 1 rules applied. Total rules applied 597 place count 124 transition count 249
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 598 place count 124 transition count 248
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 9 with 78 rules applied. Total rules applied 676 place count 85 transition count 289
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 9 with 19 rules applied. Total rules applied 695 place count 85 transition count 270
Discarding 28 places :
Symmetric choice reduction at 10 with 28 rule applications. Total rules 723 place count 57 transition count 158
Iterating global reduction 10 with 28 rules applied. Total rules applied 751 place count 57 transition count 158
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 10 with 18 rules applied. Total rules applied 769 place count 57 transition count 140
Discarding 7 places :
Symmetric choice reduction at 11 with 7 rule applications. Total rules 776 place count 50 transition count 102
Iterating global reduction 11 with 7 rules applied. Total rules applied 783 place count 50 transition count 102
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 788 place count 50 transition count 97
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 12 with 6 rules applied. Total rules applied 794 place count 47 transition count 120
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 803 place count 47 transition count 111
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 13 with 19 rules applied. Total rules applied 822 place count 47 transition count 92
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 824 place count 46 transition count 99
Free-agglomeration rule applied 8 times.
Iterating global reduction 13 with 8 rules applied. Total rules applied 832 place count 46 transition count 91
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 10 rules applied. Total rules applied 842 place count 38 transition count 89
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 843 place count 38 transition count 89
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 844 place count 37 transition count 88
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t323.t489 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 18 edges and 33 vertex of which 3 / 33 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 14 with 3 rules applied. Total rules applied 847 place count 31 transition count 86
Drop transitions removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 15 with 5 rules applied. Total rules applied 852 place count 31 transition count 81
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 853 place count 30 transition count 76
Iterating global reduction 16 with 1 rules applied. Total rules applied 854 place count 30 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 855 place count 30 transition count 75
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 17 with 12 rules applied. Total rules applied 867 place count 30 transition count 63
Discarding 2 places :
Symmetric choice reduction at 17 with 2 rule applications. Total rules 869 place count 28 transition count 56
Iterating global reduction 17 with 2 rules applied. Total rules applied 871 place count 28 transition count 56
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 873 place count 28 transition count 54
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 18 with 4 rules applied. Total rules applied 877 place count 28 transition count 50
Free-agglomeration rule applied 4 times.
Iterating global reduction 18 with 4 rules applied. Total rules applied 881 place count 28 transition count 46
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 885 place count 24 transition count 46
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 19 with 4 rules applied. Total rules applied 889 place count 24 transition count 42
Applied a total of 889 rules in 131 ms. Remains 24 /426 variables (removed 402) and now considering 42/609 (removed 567) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 132 ms. Remains : 24/426 places, 42/609 transitions.
Finished random walk after 57 steps, including 0 resets, run visited all 5 properties in 2 ms. (steps per millisecond=28 )
Parikh walk visited 0 properties in 0 ms.
FORMULA CO4-PT-15-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 15 stabilizing places and 18 stable transitions
Graph (complete) has 909 edges and 426 vertex of which 423 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.9 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&&X(F(p1)))))'
Support contains 2 out of 426 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 426/426 places, 609/609 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 411 transition count 591
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 411 transition count 591
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 411 transition count 589
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 38 place count 405 transition count 583
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 405 transition count 583
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 403 transition count 581
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 403 transition count 581
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 49 place count 403 transition count 580
Applied a total of 49 rules in 38 ms. Remains 403 /426 variables (removed 23) and now considering 580/609 (removed 29) transitions.
// Phase 1: matrix 580 rows 403 cols
[2024-06-02 22:52:39] [INFO ] Computed 6 invariants in 3 ms
[2024-06-02 22:52:39] [INFO ] Implicit Places using invariants in 101 ms returned [346]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 103 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 402/426 places, 580/609 transitions.
Applied a total of 0 rules in 12 ms. Remains 402 /402 variables (removed 0) and now considering 580/580 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 155 ms. Remains : 402/426 places, 580/609 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 189 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CO4-PT-15-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s139 0), p1:(EQ s375 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 353 ms.
Product exploration explored 100000 steps with 50000 reset in 293 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 853 edges and 402 vertex of which 399 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.5 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 23 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-15-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-15-LTLFireability-00 finished in 1091 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(p0))))'
Support contains 1 out of 426 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 426/426 places, 609/609 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 410 transition count 590
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 410 transition count 590
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 410 transition count 588
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 41 place count 403 transition count 581
Iterating global reduction 1 with 7 rules applied. Total rules applied 48 place count 403 transition count 581
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 50 place count 401 transition count 579
Iterating global reduction 1 with 2 rules applied. Total rules applied 52 place count 401 transition count 579
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 53 place count 401 transition count 578
Applied a total of 53 rules in 34 ms. Remains 401 /426 variables (removed 25) and now considering 578/609 (removed 31) transitions.
// Phase 1: matrix 578 rows 401 cols
[2024-06-02 22:52:40] [INFO ] Computed 6 invariants in 6 ms
[2024-06-02 22:52:40] [INFO ] Implicit Places using invariants in 104 ms returned [345]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 105 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 400/426 places, 578/609 transitions.
Applied a total of 0 rules in 4 ms. Remains 400 /400 variables (removed 0) and now considering 578/578 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 144 ms. Remains : 400/426 places, 578/609 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-15-LTLFireability-01 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}]], initial=2, aps=[p0:(EQ s352 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][false, false, false]]
Stuttering criterion allowed to conclude after 39 steps with 0 reset in 2 ms.
FORMULA CO4-PT-15-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-15-LTLFireability-01 finished in 255 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) U (p1&&G(p0)))))'
Support contains 4 out of 426 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 426/426 places, 609/609 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 412 transition count 593
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 412 transition count 593
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 412 transition count 592
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 35 place count 406 transition count 586
Iterating global reduction 1 with 6 rules applied. Total rules applied 41 place count 406 transition count 586
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 404 transition count 584
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 404 transition count 584
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 46 place count 404 transition count 583
Applied a total of 46 rules in 23 ms. Remains 404 /426 variables (removed 22) and now considering 583/609 (removed 26) transitions.
// Phase 1: matrix 583 rows 404 cols
[2024-06-02 22:52:40] [INFO ] Computed 6 invariants in 5 ms
[2024-06-02 22:52:40] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-02 22:52:40] [INFO ] Invariant cache hit.
[2024-06-02 22:52:41] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
[2024-06-02 22:52:41] [INFO ] Invariant cache hit.
[2024-06-02 22:52:41] [INFO ] Dead Transitions using invariants and state equation in 221 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 404/426 places, 583/609 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 576 ms. Remains : 404/426 places, 583/609 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CO4-PT-15-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(AND (EQ s343 1) (EQ s347 1) (EQ s359 1)), p1:(EQ s140 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CO4-PT-15-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-15-LTLFireability-02 finished in 739 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||G(p1)||X(p2))) U (!p2&&G((p0||G(p1)||X(p2)))))))'
Support contains 3 out of 426 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 426/426 places, 609/609 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 411 transition count 591
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 411 transition count 591
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 411 transition count 589
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 39 place count 404 transition count 582
Iterating global reduction 1 with 7 rules applied. Total rules applied 46 place count 404 transition count 582
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 48 place count 402 transition count 580
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 402 transition count 580
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 51 place count 402 transition count 579
Applied a total of 51 rules in 32 ms. Remains 402 /426 variables (removed 24) and now considering 579/609 (removed 30) transitions.
// Phase 1: matrix 579 rows 402 cols
[2024-06-02 22:52:41] [INFO ] Computed 6 invariants in 6 ms
[2024-06-02 22:52:41] [INFO ] Implicit Places using invariants in 96 ms returned [346]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 98 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 401/426 places, 579/609 transitions.
Applied a total of 0 rules in 5 ms. Remains 401 /401 variables (removed 0) and now considering 579/579 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 136 ms. Remains : 401/426 places, 579/609 transitions.
Stuttering acceptance computed with spot in 396 ms :[(OR p2 (AND (NOT p0) (NOT p1))), (OR p2 (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, (NOT p1)]
Running random walk in product with property : CO4-PT-15-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(NOT p2), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(NEQ s103 1), p0:(NEQ s379 1), p1:(NEQ s267 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]]
Stuttering criterion allowed to conclude after 39 steps with 0 reset in 0 ms.
FORMULA CO4-PT-15-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-15-LTLFireability-03 finished in 559 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 426 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 426/426 places, 609/609 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 410 transition count 590
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 410 transition count 590
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 410 transition count 588
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 41 place count 403 transition count 581
Iterating global reduction 1 with 7 rules applied. Total rules applied 48 place count 403 transition count 581
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 50 place count 401 transition count 579
Iterating global reduction 1 with 2 rules applied. Total rules applied 52 place count 401 transition count 579
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 53 place count 401 transition count 578
Applied a total of 53 rules in 28 ms. Remains 401 /426 variables (removed 25) and now considering 578/609 (removed 31) transitions.
// Phase 1: matrix 578 rows 401 cols
[2024-06-02 22:52:42] [INFO ] Computed 6 invariants in 6 ms
[2024-06-02 22:52:42] [INFO ] Implicit Places using invariants in 89 ms returned [345]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 91 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 400/426 places, 578/609 transitions.
Applied a total of 0 rules in 5 ms. Remains 400 /400 variables (removed 0) and now considering 578/578 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 124 ms. Remains : 400/426 places, 578/609 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : CO4-PT-15-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (NEQ s92 1) (NEQ s337 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 256 ms.
Product exploration explored 100000 steps with 50000 reset in 253 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 851 edges and 400 vertex of which 397 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 16 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-15-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-15-LTLFireability-04 finished in 770 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||X(p1)))||G(p2))))'
Support contains 4 out of 426 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 426/426 places, 609/609 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 413 transition count 594
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 413 transition count 594
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 413 transition count 592
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 34 place count 407 transition count 586
Iterating global reduction 1 with 6 rules applied. Total rules applied 40 place count 407 transition count 586
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 405 transition count 584
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 405 transition count 584
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 45 place count 405 transition count 583
Applied a total of 45 rules in 25 ms. Remains 405 /426 variables (removed 21) and now considering 583/609 (removed 26) transitions.
// Phase 1: matrix 583 rows 405 cols
[2024-06-02 22:52:42] [INFO ] Computed 6 invariants in 3 ms
[2024-06-02 22:52:42] [INFO ] Implicit Places using invariants in 84 ms returned [349]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 85 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 404/426 places, 583/609 transitions.
Applied a total of 0 rules in 4 ms. Remains 404 /404 variables (removed 0) and now considering 583/583 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 114 ms. Remains : 404/426 places, 583/609 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : CO4-PT-15-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p2 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p2 p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=0 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={1} source=1 dest: 0}, { cond=(AND p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={1} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s304 0), p2:(EQ s343 1), p1:(OR (EQ s17 0) (EQ s158 0))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1456 reset in 143 ms.
Product exploration explored 100000 steps with 853 reset in 243 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 857 edges and 404 vertex of which 401 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p0 p2 p1))), (X (AND p0 (NOT p2))), (X (AND p0 (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND p0 (NOT p2)))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 243 ms. Reduced automaton from 2 states, 12 edges and 3 AP (stutter sensitive) to 2 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 222 resets, run finished after 361 ms. (steps per millisecond=27 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 41 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 583 rows 404 cols
[2024-06-02 22:52:44] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 22:52:44] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-06-02 22:52:44] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-02 22:52:44] [INFO ] After 247ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-06-02 22:52:45] [INFO ] After 467ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 117 ms.
[2024-06-02 22:52:45] [INFO ] After 703ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Finished Parikh walk after 49 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=49 )
Parikh walk visited 7 properties in 7 ms.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p0 p2 p1))), (X (AND p0 (NOT p2))), (X (AND p0 (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND p0 (NOT p2)))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(F (AND (NOT p0) p2)), (F (AND p0 (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p2))), (F (AND p0 p2 p1)), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (NOT (AND p0 (NOT p2) p1))), (F (AND p0 p2 (NOT p1))), (F (AND (NOT p0) p2 p1)), (F (AND (NOT p0) (NOT p2) p1)), (F (AND (NOT p0) p2 (NOT p1))), (F (NOT (AND p0 (NOT p2)))), (F (AND p0 p2))]
Knowledge based reduction with 25 factoid took 893 ms. Reduced automaton from 2 states, 12 edges and 3 AP (stutter sensitive) to 2 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 4 out of 404 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 404/404 places, 583/583 transitions.
Applied a total of 0 rules in 11 ms. Remains 404 /404 variables (removed 0) and now considering 583/583 (removed 0) transitions.
[2024-06-02 22:52:46] [INFO ] Invariant cache hit.
[2024-06-02 22:52:46] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-02 22:52:46] [INFO ] Invariant cache hit.
[2024-06-02 22:52:46] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
[2024-06-02 22:52:46] [INFO ] Invariant cache hit.
[2024-06-02 22:52:46] [INFO ] Dead Transitions using invariants and state equation in 196 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 545 ms. Remains : 404/404 places, 583/583 transitions.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 857 edges and 404 vertex of which 401 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p0 p2 p1))), (X (AND p0 (NOT p2))), (X (AND p0 (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND p0 (NOT p2)))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 333 ms. Reduced automaton from 2 states, 12 edges and 3 AP (stutter sensitive) to 2 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 221 resets, run finished after 331 ms. (steps per millisecond=30 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 40 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2024-06-02 22:52:47] [INFO ] Invariant cache hit.
[2024-06-02 22:52:47] [INFO ] After 215ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-06-02 22:52:48] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-02 22:52:48] [INFO ] After 394ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2024-06-02 22:52:48] [INFO ] After 695ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 210 ms.
[2024-06-02 22:52:49] [INFO ] After 1098ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 10 Parikh solutions to 9 different solutions.
Finished Parikh walk after 57 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=57 )
Parikh walk visited 10 properties in 12 ms.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p0 p2 p1))), (X (AND p0 (NOT p2))), (X (AND p0 (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 p2 p1)))), (X (X (AND p0 (NOT p2)))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(F (AND (NOT p0) p2)), (F (AND p0 (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p2))), (F (AND p0 p2 p1)), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (NOT (AND p0 (NOT p2) p1))), (F (AND p0 p2 (NOT p1))), (F (AND (NOT p0) p2 p1)), (F (AND (NOT p0) (NOT p2) p1)), (F (AND (NOT p0) p2 (NOT p1))), (F (NOT (AND p0 (NOT p2)))), (F (AND p0 p2))]
Knowledge based reduction with 25 factoid took 1067 ms. Reduced automaton from 2 states, 12 edges and 3 AP (stutter sensitive) to 2 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 477 reset in 119 ms.
Product exploration explored 100000 steps with 1189 reset in 164 ms.
Built C files in :
/tmp/ltsmin14251881847446431267
[2024-06-02 22:52:51] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14251881847446431267
Running compilation step : cd /tmp/ltsmin14251881847446431267;'/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 1063 ms.
Running link step : cd /tmp/ltsmin14251881847446431267;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin14251881847446431267;'/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/stateBased4831702281156812742.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 404 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 404/404 places, 583/583 transitions.
Applied a total of 0 rules in 8 ms. Remains 404 /404 variables (removed 0) and now considering 583/583 (removed 0) transitions.
[2024-06-02 22:53:06] [INFO ] Invariant cache hit.
[2024-06-02 22:53:06] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-06-02 22:53:06] [INFO ] Invariant cache hit.
[2024-06-02 22:53:06] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2024-06-02 22:53:06] [INFO ] Invariant cache hit.
[2024-06-02 22:53:06] [INFO ] Dead Transitions using invariants and state equation in 214 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 563 ms. Remains : 404/404 places, 583/583 transitions.
Built C files in :
/tmp/ltsmin16253033152174225245
[2024-06-02 22:53:06] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16253033152174225245
Running compilation step : cd /tmp/ltsmin16253033152174225245;'/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 806 ms.
Running link step : cd /tmp/ltsmin16253033152174225245;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin16253033152174225245;'/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/stateBased2858630699405043426.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-06-02 22:53:21] [INFO ] Flatten gal took : 25 ms
[2024-06-02 22:53:21] [INFO ] Flatten gal took : 23 ms
[2024-06-02 22:53:21] [INFO ] Time to serialize gal into /tmp/LTL17450264412930116498.gal : 5 ms
[2024-06-02 22:53:21] [INFO ] Time to serialize properties into /tmp/LTL2028160342780076816.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17450264412930116498.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4492446760298102274.hoa' '-atoms' '/tmp/LTL2028160342780076816.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL2028160342780076816.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4492446760298102274.hoa
Detected timeout of ITS tools.
[2024-06-02 22:53:37] [INFO ] Flatten gal took : 22 ms
[2024-06-02 22:53:37] [INFO ] Flatten gal took : 24 ms
[2024-06-02 22:53:37] [INFO ] Time to serialize gal into /tmp/LTL11793889454578146784.gal : 5 ms
[2024-06-02 22:53:37] [INFO ] Time to serialize properties into /tmp/LTL8001520156132613455.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11793889454578146784.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8001520156132613455.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G(("(p606==0)")||(X("((p100==0)||(p371==0))"))))||(G("(p666==1)")))))
Formula 0 simplified : G(F(!"(p606==0)" & X!"((p100==0)||(p371==0))") & F!"(p666==1)")
Detected timeout of ITS tools.
[2024-06-02 22:53:52] [INFO ] Flatten gal took : 24 ms
[2024-06-02 22:53:52] [INFO ] Applying decomposition
[2024-06-02 22:53:52] [INFO ] Flatten gal took : 38 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph1604683159582344921.txt' '-o' '/tmp/graph1604683159582344921.bin' '-w' '/tmp/graph1604683159582344921.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1604683159582344921.bin' '-l' '-1' '-v' '-w' '/tmp/graph1604683159582344921.weights' '-q' '0' '-e' '0.001'
[2024-06-02 22:53:52] [INFO ] Decomposing Gal with order
[2024-06-02 22:53:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 22:53:52] [INFO ] Removed a total of 378 redundant transitions.
[2024-06-02 22:53:52] [INFO ] Flatten gal took : 123 ms
[2024-06-02 22:53:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 22 ms.
[2024-06-02 22:53:52] [INFO ] Time to serialize gal into /tmp/LTL6189055723298126656.gal : 9 ms
[2024-06-02 22:53:52] [INFO ] Time to serialize properties into /tmp/LTL10824519058461533578.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6189055723298126656.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10824519058461533578.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((G(("(i14.u118.p606==0)")||(X("((i1.u7.p100==0)||(i6.u58.p371==0))"))))||(G("(i0.u130.p666==1)")))))
Formula 0 simplified : G(F(!"(i14.u118.p606==0)" & X!"((i1.u7.p100==0)||(i6.u58.p371==0))") & F!"(i0.u130.p666==1)")
Reverse transition relation is NOT exact ! Due to transitions t9, t12, t16, t49, t82, t125, t142, t152, t190, t193, t223, t228, t251, t290, t322, t432, t44...1117
Computing Next relation with stutter on 407999 deadlock states
65 unique states visited
5 strongly connected components in search stack
71 transitions explored
65 items max in DFS search stack
796 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,8.03714,246432,1,0,409077,1247,6954,1.30196e+06,346,6761,627704
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CO4-PT-15-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property CO4-PT-15-LTLFireability-05 finished in 79389 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((G(F(p0)) U (p1&&F(p2)))))))'
Support contains 3 out of 426 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 426/426 places, 609/609 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 411 transition count 591
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 411 transition count 591
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 411 transition count 590
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 38 place count 404 transition count 583
Iterating global reduction 1 with 7 rules applied. Total rules applied 45 place count 404 transition count 583
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 402 transition count 581
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 402 transition count 581
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 50 place count 402 transition count 580
Applied a total of 50 rules in 34 ms. Remains 402 /426 variables (removed 24) and now considering 580/609 (removed 29) transitions.
// Phase 1: matrix 580 rows 402 cols
[2024-06-02 22:54:02] [INFO ] Computed 6 invariants in 2 ms
[2024-06-02 22:54:02] [INFO ] Implicit Places using invariants in 184 ms returned [346]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 186 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 401/426 places, 580/609 transitions.
Applied a total of 0 rules in 5 ms. Remains 401 /401 variables (removed 0) and now considering 580/580 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 225 ms. Remains : 401/426 places, 580/609 transitions.
Stuttering acceptance computed with spot in 389 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p0), (NOT p2)]
Running random walk in product with property : CO4-PT-15-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 4}, { cond=(NOT p1), acceptance={0} source=3 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(NEQ s222 1), p0:(OR (EQ s222 1) (EQ s266 1)), p2:(NEQ s262 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 25000 reset in 214 ms.
Product exploration explored 100000 steps with 25000 reset in 263 ms.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 853 edges and 401 vertex of which 398 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 165 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 316 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p0), (NOT p2)]
Incomplete random walk after 10000 steps, including 222 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 580 rows 401 cols
[2024-06-02 22:54:04] [INFO ] Computed 5 invariants in 2 ms
[2024-06-02 22:54:04] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-02 22:54:04] [INFO ] After 342ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2024-06-02 22:54:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-02 22:54:04] [INFO ] After 167ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-06-02 22:54:04] [INFO ] After 224ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 52 ms.
[2024-06-02 22:54:04] [INFO ] After 355ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 26 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=26 )
Parikh walk visited 1 properties in 1 ms.
Support contains 1 out of 401 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 401/401 places, 580/580 transitions.
Graph (trivial) has 439 edges and 401 vertex of which 2 / 401 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 851 edges and 400 vertex of which 378 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.0 ms
Discarding 22 places :
Also discarding 11 output transitions
Drop transitions removed 11 transitions
Drop transitions removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 139 transitions
Trivial Post-agglo rules discarded 139 transitions
Performed 139 trivial Post agglomeration. Transition count delta: 139
Iterating post reduction 0 with 156 rules applied. Total rules applied 158 place count 378 transition count 402
Reduce places removed 139 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 144 rules applied. Total rules applied 302 place count 239 transition count 397
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 303 place count 238 transition count 397
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 52 Pre rules applied. Total rules applied 303 place count 238 transition count 345
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 3 with 104 rules applied. Total rules applied 407 place count 186 transition count 345
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 410 place count 183 transition count 342
Iterating global reduction 3 with 3 rules applied. Total rules applied 413 place count 183 transition count 342
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 416 place count 183 transition count 339
Performed 58 Post agglomeration using F-continuation condition with reduction of 13 identical transitions.
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 532 place count 125 transition count 268
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 17 rules applied. Total rules applied 549 place count 125 transition count 251
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 555 place count 122 transition count 248
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 559 place count 118 transition count 240
Iterating global reduction 6 with 4 rules applied. Total rules applied 563 place count 118 transition count 240
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 571 place count 114 transition count 236
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 572 place count 114 transition count 235
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 573 place count 113 transition count 233
Iterating global reduction 7 with 1 rules applied. Total rules applied 574 place count 113 transition count 233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 575 place count 113 transition count 232
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 8 with 78 rules applied. Total rules applied 653 place count 74 transition count 273
Drop transitions removed 62 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 81 transitions.
Iterating post reduction 8 with 81 rules applied. Total rules applied 734 place count 74 transition count 192
Discarding 29 places :
Symmetric choice reduction at 9 with 29 rule applications. Total rules 763 place count 45 transition count 123
Iterating global reduction 9 with 29 rules applied. Total rules applied 792 place count 45 transition count 123
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 9 with 20 rules applied. Total rules applied 812 place count 45 transition count 103
Discarding 7 places :
Symmetric choice reduction at 10 with 7 rule applications. Total rules 819 place count 38 transition count 74
Iterating global reduction 10 with 7 rules applied. Total rules applied 826 place count 38 transition count 74
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 830 place count 38 transition count 70
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 832 place count 37 transition count 77
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 835 place count 37 transition count 74
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 12 with 9 rules applied. Total rules applied 844 place count 37 transition count 65
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 845 place count 36 transition count 63
Iterating global reduction 12 with 1 rules applied. Total rules applied 846 place count 36 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 847 place count 36 transition count 62
Free-agglomeration rule applied 8 times.
Iterating global reduction 13 with 8 rules applied. Total rules applied 855 place count 36 transition count 54
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 9 rules applied. Total rules applied 864 place count 28 transition count 53
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 14 with 3 rules applied. Total rules applied 867 place count 28 transition count 53
Graph (complete) has 95 edges and 28 vertex of which 27 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 14 with 1 rules applied. Total rules applied 868 place count 27 transition count 53
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 15 with 3 rules applied. Total rules applied 871 place count 27 transition count 50
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 16 with 2 rules applied. Total rules applied 873 place count 27 transition count 50
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 874 place count 27 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 17 with 1 rules applied. Total rules applied 875 place count 26 transition count 48
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t323.t489 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 16 edges and 22 vertex of which 3 / 22 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 17 with 5 rules applied. Total rules applied 880 place count 20 transition count 44
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 20 edges and 14 vertex of which 11 / 14 are part of one of the 2 SCC in 0 ms
Free SCC test removed 9 places
Iterating post reduction 18 with 18 rules applied. Total rules applied 898 place count 5 transition count 33
Drop transitions removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Graph (complete) has 4 edges and 5 vertex of which 3 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 19 with 30 rules applied. Total rules applied 928 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 20 with 1 Pre rules applied. Total rules applied 928 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 20 with 2 rules applied. Total rules applied 930 place count 2 transition count 2
Applied a total of 930 rules in 57 ms. Remains 2 /401 variables (removed 399) and now considering 2/580 (removed 578) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 2/401 places, 2/580 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0) p2), true]
False Knowledge obtained : [(F (NOT p2)), (F p0), (F (NOT p1)), (F (AND p1 (NOT p2))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 200 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 321 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 309 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p0), (NOT p2)]
Support contains 3 out of 401 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 401/401 places, 580/580 transitions.
Applied a total of 0 rules in 4 ms. Remains 401 /401 variables (removed 0) and now considering 580/580 (removed 0) transitions.
[2024-06-02 22:54:05] [INFO ] Invariant cache hit.
[2024-06-02 22:54:05] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-02 22:54:05] [INFO ] Invariant cache hit.
[2024-06-02 22:54:06] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
[2024-06-02 22:54:06] [INFO ] Invariant cache hit.
[2024-06-02 22:54:06] [INFO ] Dead Transitions using invariants and state equation in 208 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 548 ms. Remains : 401/401 places, 580/580 transitions.
Computed a total of 14 stabilizing places and 17 stable transitions
Graph (complete) has 853 edges and 401 vertex of which 398 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Computed a total of 14 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 276 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p0), (NOT p2)]
Incomplete random walk after 10000 steps, including 225 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10000 steps, including 39 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-06-02 22:54:06] [INFO ] Invariant cache hit.
[2024-06-02 22:54:06] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-02 22:54:07] [INFO ] After 258ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2024-06-02 22:54:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-02 22:54:07] [INFO ] After 207ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-06-02 22:54:07] [INFO ] After 272ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 48 ms.
[2024-06-02 22:54:07] [INFO ] After 405ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 25 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=25 )
Parikh walk visited 1 properties in 1 ms.
Support contains 1 out of 401 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 401/401 places, 580/580 transitions.
Graph (trivial) has 439 edges and 401 vertex of which 2 / 401 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 851 edges and 400 vertex of which 378 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.0 ms
Discarding 22 places :
Also discarding 11 output transitions
Drop transitions removed 11 transitions
Drop transitions removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 139 transitions
Trivial Post-agglo rules discarded 139 transitions
Performed 139 trivial Post agglomeration. Transition count delta: 139
Iterating post reduction 0 with 156 rules applied. Total rules applied 158 place count 378 transition count 402
Reduce places removed 139 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 144 rules applied. Total rules applied 302 place count 239 transition count 397
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 303 place count 238 transition count 397
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 52 Pre rules applied. Total rules applied 303 place count 238 transition count 345
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 3 with 104 rules applied. Total rules applied 407 place count 186 transition count 345
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 410 place count 183 transition count 342
Iterating global reduction 3 with 3 rules applied. Total rules applied 413 place count 183 transition count 342
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 416 place count 183 transition count 339
Performed 58 Post agglomeration using F-continuation condition with reduction of 13 identical transitions.
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 532 place count 125 transition count 268
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 17 rules applied. Total rules applied 549 place count 125 transition count 251
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 555 place count 122 transition count 248
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 559 place count 118 transition count 240
Iterating global reduction 6 with 4 rules applied. Total rules applied 563 place count 118 transition count 240
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 571 place count 114 transition count 236
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 572 place count 114 transition count 235
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 573 place count 113 transition count 233
Iterating global reduction 7 with 1 rules applied. Total rules applied 574 place count 113 transition count 233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 575 place count 113 transition count 232
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 8 with 78 rules applied. Total rules applied 653 place count 74 transition count 273
Drop transitions removed 62 transitions
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 81 transitions.
Iterating post reduction 8 with 81 rules applied. Total rules applied 734 place count 74 transition count 192
Discarding 29 places :
Symmetric choice reduction at 9 with 29 rule applications. Total rules 763 place count 45 transition count 123
Iterating global reduction 9 with 29 rules applied. Total rules applied 792 place count 45 transition count 123
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 9 with 20 rules applied. Total rules applied 812 place count 45 transition count 103
Discarding 7 places :
Symmetric choice reduction at 10 with 7 rule applications. Total rules 819 place count 38 transition count 74
Iterating global reduction 10 with 7 rules applied. Total rules applied 826 place count 38 transition count 74
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 830 place count 38 transition count 70
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 832 place count 37 transition count 77
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 835 place count 37 transition count 74
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 12 with 9 rules applied. Total rules applied 844 place count 37 transition count 65
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 845 place count 36 transition count 63
Iterating global reduction 12 with 1 rules applied. Total rules applied 846 place count 36 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 847 place count 36 transition count 62
Free-agglomeration rule applied 8 times.
Iterating global reduction 13 with 8 rules applied. Total rules applied 855 place count 36 transition count 54
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 9 rules applied. Total rules applied 864 place count 28 transition count 53
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 14 with 3 rules applied. Total rules applied 867 place count 28 transition count 53
Graph (complete) has 95 edges and 28 vertex of which 27 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 14 with 1 rules applied. Total rules applied 868 place count 27 transition count 53
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 15 with 3 rules applied. Total rules applied 871 place count 27 transition count 50
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 16 with 2 rules applied. Total rules applied 873 place count 27 transition count 50
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 874 place count 27 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 17 with 1 rules applied. Total rules applied 875 place count 26 transition count 48
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t323.t489 and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 16 edges and 22 vertex of which 3 / 22 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 17 with 5 rules applied. Total rules applied 880 place count 20 transition count 44
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 20 edges and 14 vertex of which 11 / 14 are part of one of the 2 SCC in 0 ms
Free SCC test removed 9 places
Iterating post reduction 18 with 18 rules applied. Total rules applied 898 place count 5 transition count 33
Drop transitions removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Graph (complete) has 4 edges and 5 vertex of which 3 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 19 with 30 rules applied. Total rules applied 928 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 20 with 1 Pre rules applied. Total rules applied 928 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 20 with 2 rules applied. Total rules applied 930 place count 2 transition count 2
Applied a total of 930 rules in 33 ms. Remains 2 /401 variables (removed 399) and now considering 2/580 (removed 578) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 2/401 places, 2/580 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0) p2), true]
False Knowledge obtained : [(F (NOT p2)), (F p0), (F (NOT p1)), (F (AND p1 (NOT p2))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 223 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 293 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 291 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 297 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p0), (NOT p2)]
Product exploration explored 100000 steps with 25000 reset in 192 ms.
Product exploration explored 100000 steps with 25000 reset in 201 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 290 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p0), (NOT p2)]
Support contains 3 out of 401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 401/401 places, 580/580 transitions.
Graph (trivial) has 434 edges and 401 vertex of which 2 / 401 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 852 edges and 400 vertex of which 397 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 143 rules applied. Total rules applied 145 place count 397 transition count 573
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 148 place count 397 transition count 570
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 148 place count 397 transition count 615
Deduced a syphon composed of 186 places in 0 ms
Iterating global reduction 2 with 46 rules applied. Total rules applied 194 place count 397 transition count 615
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 227 place count 364 transition count 582
Deduced a syphon composed of 153 places in 0 ms
Iterating global reduction 2 with 33 rules applied. Total rules applied 260 place count 364 transition count 582
Performed 48 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 201 places in 0 ms
Iterating global reduction 2 with 48 rules applied. Total rules applied 308 place count 364 transition count 619
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 321 place count 364 transition count 606
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 348 place count 337 transition count 575
Deduced a syphon composed of 178 places in 0 ms
Iterating global reduction 3 with 27 rules applied. Total rules applied 375 place count 337 transition count 575
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 182 places in 0 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 379 place count 337 transition count 575
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 382 place count 337 transition count 572
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 390 place count 329 transition count 563
Deduced a syphon composed of 175 places in 0 ms
Iterating global reduction 4 with 8 rules applied. Total rules applied 398 place count 329 transition count 563
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 400 place count 327 transition count 560
Deduced a syphon composed of 174 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 402 place count 327 transition count 560
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 403 place count 327 transition count 559
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 404 place count 326 transition count 558
Deduced a syphon composed of 173 places in 0 ms
Iterating global reduction 5 with 1 rules applied. Total rules applied 405 place count 326 transition count 558
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 176 places in 0 ms
Iterating global reduction 5 with 3 rules applied. Total rules applied 408 place count 326 transition count 558
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 411 place count 323 transition count 555
Deduced a syphon composed of 173 places in 1 ms
Iterating global reduction 5 with 3 rules applied. Total rules applied 414 place count 323 transition count 555
Performed 57 Post agglomeration using F-continuation condition with reduction of 23 identical transitions.
Deduced a syphon composed of 230 places in 0 ms
Iterating global reduction 5 with 57 rules applied. Total rules applied 471 place count 323 transition count 825
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Iterating post reduction 5 with 46 rules applied. Total rules applied 517 place count 323 transition count 779
Discarding 114 places :
Symmetric choice reduction at 6 with 114 rule applications. Total rules 631 place count 209 transition count 467
Deduced a syphon composed of 143 places in 0 ms
Iterating global reduction 6 with 114 rules applied. Total rules applied 745 place count 209 transition count 467
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 6 with 29 rules applied. Total rules applied 774 place count 209 transition count 438
Discarding 67 places :
Symmetric choice reduction at 7 with 67 rule applications. Total rules 841 place count 142 transition count 300
Deduced a syphon composed of 83 places in 0 ms
Iterating global reduction 7 with 67 rules applied. Total rules applied 908 place count 142 transition count 300
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 914 place count 142 transition count 294
Discarding 12 places :
Symmetric choice reduction at 8 with 12 rule applications. Total rules 926 place count 130 transition count 270
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 8 with 12 rules applied. Total rules applied 938 place count 130 transition count 270
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 8 with 1 rules applied. Total rules applied 939 place count 130 transition count 295
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 946 place count 130 transition count 288
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 949 place count 127 transition count 270
Deduced a syphon composed of 69 places in 0 ms
Iterating global reduction 9 with 3 rules applied. Total rules applied 952 place count 127 transition count 270
Deduced a syphon composed of 69 places in 0 ms
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 9 with 26 rules applied. Total rules applied 978 place count 127 transition count 244
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 979 place count 126 transition count 243
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 980 place count 126 transition count 243
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 69 places in 1 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 981 place count 126 transition count 264
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 982 place count 125 transition count 256
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 9 with 1 rules applied. Total rules applied 983 place count 125 transition count 256
Deduced a syphon composed of 68 places in 0 ms
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 985 place count 125 transition count 254
Deduced a syphon composed of 68 places in 0 ms
Applied a total of 985 rules in 140 ms. Remains 125 /401 variables (removed 276) and now considering 254/580 (removed 326) transitions.
[2024-06-02 22:54:09] [INFO ] Redundant transitions in 11 ms returned []
[2024-06-02 22:54:09] [INFO ] Flow matrix only has 235 transitions (discarded 19 similar events)
// Phase 1: matrix 235 rows 125 cols
[2024-06-02 22:54:09] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 22:54:09] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 125/401 places, 254/580 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 264 ms. Remains : 125/401 places, 254/580 transitions.
Built C files in :
/tmp/ltsmin11968998687820024367
[2024-06-02 22:54:09] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11968998687820024367
Running compilation step : cd /tmp/ltsmin11968998687820024367;'/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 807 ms.
Running link step : cd /tmp/ltsmin11968998687820024367;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin11968998687820024367;'/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/stateBased14136673377196464228.hoa' '--buchi-type=spotba'
LTSmin run took 209 ms.
FORMULA CO4-PT-15-LTLFireability-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-15-LTLFireability-06 finished in 8655 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 426 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 426/426 places, 609/609 transitions.
Graph (trivial) has 462 edges and 426 vertex of which 2 / 426 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 908 edges and 425 vertex of which 422 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.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 159 transitions
Trivial Post-agglo rules discarded 159 transitions
Performed 159 trivial Post agglomeration. Transition count delta: 159
Iterating post reduction 0 with 162 rules applied. Total rules applied 164 place count 421 transition count 442
Reduce places removed 159 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 162 rules applied. Total rules applied 326 place count 262 transition count 439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 327 place count 261 transition count 439
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 327 place count 261 transition count 393
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 419 place count 215 transition count 393
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 426 place count 208 transition count 383
Iterating global reduction 3 with 7 rules applied. Total rules applied 433 place count 208 transition count 383
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 435 place count 208 transition count 381
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 435 place count 208 transition count 380
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 437 place count 207 transition count 380
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 438 place count 206 transition count 379
Iterating global reduction 4 with 1 rules applied. Total rules applied 439 place count 206 transition count 379
Performed 65 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 4 with 130 rules applied. Total rules applied 569 place count 141 transition count 298
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 17 rules applied. Total rules applied 586 place count 141 transition count 281
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 590 place count 139 transition count 279
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 594 place count 135 transition count 271
Iterating global reduction 6 with 4 rules applied. Total rules applied 598 place count 135 transition count 271
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 606 place count 131 transition count 267
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 607 place count 130 transition count 265
Iterating global reduction 6 with 1 rules applied. Total rules applied 608 place count 130 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 609 place count 130 transition count 264
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 7 with 82 rules applied. Total rules applied 691 place count 89 transition count 310
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 7 with 20 rules applied. Total rules applied 711 place count 89 transition count 290
Discarding 28 places :
Symmetric choice reduction at 8 with 28 rule applications. Total rules 739 place count 61 transition count 178
Iterating global reduction 8 with 28 rules applied. Total rules applied 767 place count 61 transition count 178
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 785 place count 61 transition count 160
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 792 place count 54 transition count 122
Iterating global reduction 9 with 7 rules applied. Total rules applied 799 place count 54 transition count 122
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 804 place count 54 transition count 117
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 10 with 2 rules applied. Total rules applied 806 place count 53 transition count 134
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 10 with 20 rules applied. Total rules applied 826 place count 53 transition count 114
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 827 place count 53 transition count 114
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 829 place count 51 transition count 112
Applied a total of 829 rules in 58 ms. Remains 51 /426 variables (removed 375) and now considering 112/609 (removed 497) transitions.
[2024-06-02 22:54:10] [INFO ] Flow matrix only has 84 transitions (discarded 28 similar events)
// Phase 1: matrix 84 rows 51 cols
[2024-06-02 22:54:10] [INFO ] Computed 6 invariants in 0 ms
[2024-06-02 22:54:10] [INFO ] Implicit Places using invariants in 32 ms returned [34]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 33 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/426 places, 112/609 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 112/112 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 94 ms. Remains : 50/426 places, 112/609 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-15-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA CO4-PT-15-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-15-LTLFireability-07 finished in 178 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 426 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 426/426 places, 609/609 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 410 transition count 590
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 410 transition count 590
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 410 transition count 588
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 41 place count 403 transition count 581
Iterating global reduction 1 with 7 rules applied. Total rules applied 48 place count 403 transition count 581
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 50 place count 401 transition count 579
Iterating global reduction 1 with 2 rules applied. Total rules applied 52 place count 401 transition count 579
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 53 place count 401 transition count 578
Applied a total of 53 rules in 33 ms. Remains 401 /426 variables (removed 25) and now considering 578/609 (removed 31) transitions.
// Phase 1: matrix 578 rows 401 cols
[2024-06-02 22:54:11] [INFO ] Computed 6 invariants in 6 ms
[2024-06-02 22:54:11] [INFO ] Implicit Places using invariants in 86 ms returned [345]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 88 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 400/426 places, 578/609 transitions.
Applied a total of 0 rules in 5 ms. Remains 400 /400 variables (removed 0) and now considering 578/578 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 127 ms. Remains : 400/426 places, 578/609 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-15-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s240 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 43 steps with 0 reset in 0 ms.
FORMULA CO4-PT-15-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-15-LTLFireability-08 finished in 204 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 426 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 426/426 places, 609/609 transitions.
Graph (trivial) has 462 edges and 426 vertex of which 2 / 426 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 908 edges and 425 vertex of which 422 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
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 159 transitions
Trivial Post-agglo rules discarded 159 transitions
Performed 159 trivial Post agglomeration. Transition count delta: 159
Iterating post reduction 0 with 162 rules applied. Total rules applied 164 place count 421 transition count 442
Reduce places removed 159 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 162 rules applied. Total rules applied 326 place count 262 transition count 439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 327 place count 261 transition count 439
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 327 place count 261 transition count 393
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 419 place count 215 transition count 393
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 426 place count 208 transition count 383
Iterating global reduction 3 with 7 rules applied. Total rules applied 433 place count 208 transition count 383
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 435 place count 208 transition count 381
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 435 place count 208 transition count 380
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 437 place count 207 transition count 380
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 438 place count 206 transition count 379
Iterating global reduction 4 with 1 rules applied. Total rules applied 439 place count 206 transition count 379
Performed 65 Post agglomeration using F-continuation condition with reduction of 17 identical transitions.
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 4 with 130 rules applied. Total rules applied 569 place count 141 transition count 297
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 16 rules applied. Total rules applied 585 place count 141 transition count 281
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 589 place count 139 transition count 279
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 593 place count 135 transition count 271
Iterating global reduction 6 with 4 rules applied. Total rules applied 597 place count 135 transition count 271
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 605 place count 131 transition count 267
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 606 place count 130 transition count 265
Iterating global reduction 6 with 1 rules applied. Total rules applied 607 place count 130 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 608 place count 130 transition count 264
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 7 with 82 rules applied. Total rules applied 690 place count 89 transition count 310
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 7 with 20 rules applied. Total rules applied 710 place count 89 transition count 290
Discarding 28 places :
Symmetric choice reduction at 8 with 28 rule applications. Total rules 738 place count 61 transition count 178
Iterating global reduction 8 with 28 rules applied. Total rules applied 766 place count 61 transition count 178
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 784 place count 61 transition count 160
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 791 place count 54 transition count 122
Iterating global reduction 9 with 7 rules applied. Total rules applied 798 place count 54 transition count 122
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 803 place count 54 transition count 117
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 10 with 14 rules applied. Total rules applied 817 place count 54 transition count 103
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 10 with 2 rules applied. Total rules applied 819 place count 53 transition count 111
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 821 place count 51 transition count 109
Applied a total of 821 rules in 50 ms. Remains 51 /426 variables (removed 375) and now considering 109/609 (removed 500) transitions.
[2024-06-02 22:54:11] [INFO ] Flow matrix only has 90 transitions (discarded 19 similar events)
// Phase 1: matrix 90 rows 51 cols
[2024-06-02 22:54:11] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 22:54:11] [INFO ] Implicit Places using invariants in 34 ms returned [34]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/426 places, 109/609 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 86 ms. Remains : 50/426 places, 109/609 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-15-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s19 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 200 reset in 83 ms.
Product exploration explored 100000 steps with 36 reset in 76 ms.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 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 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1590 steps, including 127 resets, run visited all 1 properties in 9 ms. (steps per millisecond=176 )
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 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 109/109 transitions.
Applied a total of 0 rules in 5 ms. Remains 50 /50 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2024-06-02 22:54:11] [INFO ] Flow matrix only has 90 transitions (discarded 19 similar events)
// Phase 1: matrix 90 rows 50 cols
[2024-06-02 22:54:11] [INFO ] Computed 5 invariants in 0 ms
[2024-06-02 22:54:12] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-06-02 22:54:12] [INFO ] Flow matrix only has 90 transitions (discarded 19 similar events)
[2024-06-02 22:54:12] [INFO ] Invariant cache hit.
[2024-06-02 22:54:12] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 22:54:12] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2024-06-02 22:54:12] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 22:54:12] [INFO ] Flow matrix only has 90 transitions (discarded 19 similar events)
[2024-06-02 22:54:12] [INFO ] Invariant cache hit.
[2024-06-02 22:54:12] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 165 ms. Remains : 50/50 places, 109/109 transitions.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Finished random walk after 393 steps, including 32 resets, run visited all 1 properties in 1 ms. (steps per millisecond=393 )
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 97 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 504 reset in 38 ms.
Product exploration explored 100000 steps with 23 reset in 93 ms.
Built C files in :
/tmp/ltsmin16639606107159716527
[2024-06-02 22:54:12] [INFO ] Computing symmetric may disable matrix : 109 transitions.
[2024-06-02 22:54:12] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:54:12] [INFO ] Computing symmetric may enable matrix : 109 transitions.
[2024-06-02 22:54:12] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:54:12] [INFO ] Computing Do-Not-Accords matrix : 109 transitions.
[2024-06-02 22:54:12] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:54:12] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16639606107159716527
Running compilation step : cd /tmp/ltsmin16639606107159716527;'/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 213 ms.
Running link step : cd /tmp/ltsmin16639606107159716527;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin16639606107159716527;'/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/stateBased8340139923890323627.hoa' '--buchi-type=spotba'
LTSmin run took 121 ms.
FORMULA CO4-PT-15-LTLFireability-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-15-LTLFireability-09 finished in 1936 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)||G(p1))))'
Support contains 3 out of 426 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 426/426 places, 609/609 transitions.
Graph (trivial) has 458 edges and 426 vertex of which 2 / 426 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 908 edges and 425 vertex of which 422 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.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 154 transitions
Trivial Post-agglo rules discarded 154 transitions
Performed 154 trivial Post agglomeration. Transition count delta: 154
Iterating post reduction 0 with 157 rules applied. Total rules applied 159 place count 421 transition count 447
Reduce places removed 154 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 157 rules applied. Total rules applied 316 place count 267 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 317 place count 266 transition count 444
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 317 place count 266 transition count 398
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 409 place count 220 transition count 398
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 416 place count 213 transition count 388
Iterating global reduction 3 with 7 rules applied. Total rules applied 423 place count 213 transition count 388
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 425 place count 213 transition count 386
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 425 place count 213 transition count 385
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 427 place count 212 transition count 385
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 428 place count 211 transition count 384
Iterating global reduction 4 with 1 rules applied. Total rules applied 429 place count 211 transition count 384
Performed 66 Post agglomeration using F-continuation condition with reduction of 17 identical transitions.
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 4 with 132 rules applied. Total rules applied 561 place count 145 transition count 301
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 15 rules applied. Total rules applied 576 place count 145 transition count 286
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 580 place count 143 transition count 284
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 584 place count 139 transition count 276
Iterating global reduction 6 with 4 rules applied. Total rules applied 588 place count 139 transition count 276
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 594 place count 136 transition count 273
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 595 place count 135 transition count 271
Iterating global reduction 6 with 1 rules applied. Total rules applied 596 place count 135 transition count 271
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 597 place count 135 transition count 270
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 7 with 82 rules applied. Total rules applied 679 place count 94 transition count 316
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 7 with 20 rules applied. Total rules applied 699 place count 94 transition count 296
Discarding 27 places :
Symmetric choice reduction at 8 with 27 rule applications. Total rules 726 place count 67 transition count 188
Iterating global reduction 8 with 27 rules applied. Total rules applied 753 place count 67 transition count 188
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 8 with 17 rules applied. Total rules applied 770 place count 67 transition count 171
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 776 place count 61 transition count 139
Iterating global reduction 9 with 6 rules applied. Total rules applied 782 place count 61 transition count 139
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 786 place count 61 transition count 135
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 10 with 2 rules applied. Total rules applied 788 place count 60 transition count 143
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 10 with 16 rules applied. Total rules applied 804 place count 60 transition count 127
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 806 place count 58 transition count 125
Applied a total of 806 rules in 44 ms. Remains 58 /426 variables (removed 368) and now considering 125/609 (removed 484) transitions.
[2024-06-02 22:54:13] [INFO ] Flow matrix only has 102 transitions (discarded 23 similar events)
// Phase 1: matrix 102 rows 58 cols
[2024-06-02 22:54:13] [INFO ] Computed 6 invariants in 1 ms
[2024-06-02 22:54:13] [INFO ] Implicit Places using invariants in 40 ms returned [39]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 41 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/426 places, 125/609 transitions.
Applied a total of 0 rules in 2 ms. Remains 57 /57 variables (removed 0) and now considering 125/125 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 88 ms. Remains : 57/426 places, 125/609 transitions.
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : CO4-PT-15-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s24 1) (EQ s3 1)), p1:(EQ s45 0)], nbAcceptance=2, 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 333 reset in 81 ms.
Product exploration explored 100000 steps with 152 reset in 120 ms.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 103 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 9872 steps, including 789 resets, run visited all 4 properties in 22 ms. (steps per millisecond=448 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 p1)), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 190 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1))]
Support contains 3 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 125/125 transitions.
Applied a total of 0 rules in 7 ms. Remains 57 /57 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-06-02 22:54:13] [INFO ] Flow matrix only has 102 transitions (discarded 23 similar events)
// Phase 1: matrix 102 rows 57 cols
[2024-06-02 22:54:13] [INFO ] Computed 5 invariants in 1 ms
[2024-06-02 22:54:14] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-02 22:54:14] [INFO ] Flow matrix only has 102 transitions (discarded 23 similar events)
[2024-06-02 22:54:14] [INFO ] Invariant cache hit.
[2024-06-02 22:54:14] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 22:54:14] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2024-06-02 22:54:14] [INFO ] Redundant transitions in 0 ms returned []
[2024-06-02 22:54:14] [INFO ] Flow matrix only has 102 transitions (discarded 23 similar events)
[2024-06-02 22:54:14] [INFO ] Invariant cache hit.
[2024-06-02 22:54:14] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 154 ms. Remains : 57/57 places, 125/125 transitions.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 93 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 4384 steps, including 352 resets, run visited all 4 properties in 17 ms. (steps per millisecond=257 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 p1)), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 233 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 129 reset in 106 ms.
Product exploration explored 100000 steps with 189 reset in 112 ms.
Built C files in :
/tmp/ltsmin4675044833604221844
[2024-06-02 22:54:14] [INFO ] Computing symmetric may disable matrix : 125 transitions.
[2024-06-02 22:54:14] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:54:14] [INFO ] Computing symmetric may enable matrix : 125 transitions.
[2024-06-02 22:54:14] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:54:14] [INFO ] Computing Do-Not-Accords matrix : 125 transitions.
[2024-06-02 22:54:14] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:54:14] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4675044833604221844
Running compilation step : cd /tmp/ltsmin4675044833604221844;'/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 241 ms.
Running link step : cd /tmp/ltsmin4675044833604221844;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin4675044833604221844;'/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/stateBased8534468671867060776.hoa' '--buchi-type=spotba'
LTSmin run took 488 ms.
FORMULA CO4-PT-15-LTLFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-15-LTLFireability-11 finished in 2497 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((p0 U (p1||G(p0)))))))'
Support contains 4 out of 426 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 426/426 places, 609/609 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 412 transition count 592
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 412 transition count 592
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 412 transition count 590
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 36 place count 406 transition count 584
Iterating global reduction 1 with 6 rules applied. Total rules applied 42 place count 406 transition count 584
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 44 place count 404 transition count 582
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 404 transition count 582
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 47 place count 404 transition count 581
Applied a total of 47 rules in 29 ms. Remains 404 /426 variables (removed 22) and now considering 581/609 (removed 28) transitions.
// Phase 1: matrix 581 rows 404 cols
[2024-06-02 22:54:15] [INFO ] Computed 6 invariants in 5 ms
[2024-06-02 22:54:15] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-02 22:54:15] [INFO ] Invariant cache hit.
[2024-06-02 22:54:16] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2024-06-02 22:54:16] [INFO ] Invariant cache hit.
[2024-06-02 22:54:16] [INFO ] Dead Transitions using invariants and state equation in 208 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 404/426 places, 581/609 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 575 ms. Remains : 404/426 places, 581/609 transitions.
Stuttering acceptance computed with spot in 156 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-15-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p1:(EQ s386 1), p0:(AND (EQ s341 1) (EQ s345 1) (EQ s391 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA CO4-PT-15-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-15-LTLFireability-12 finished in 754 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(F(p0)))))'
Support contains 1 out of 426 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 426/426 places, 609/609 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 410 transition count 590
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 410 transition count 590
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 410 transition count 588
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 41 place count 403 transition count 581
Iterating global reduction 1 with 7 rules applied. Total rules applied 48 place count 403 transition count 581
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 50 place count 401 transition count 579
Iterating global reduction 1 with 2 rules applied. Total rules applied 52 place count 401 transition count 579
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 53 place count 401 transition count 578
Applied a total of 53 rules in 26 ms. Remains 401 /426 variables (removed 25) and now considering 578/609 (removed 31) transitions.
// Phase 1: matrix 578 rows 401 cols
[2024-06-02 22:54:16] [INFO ] Computed 6 invariants in 4 ms
[2024-06-02 22:54:16] [INFO ] Implicit Places using invariants in 93 ms returned [345]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 94 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 400/426 places, 578/609 transitions.
Applied a total of 0 rules in 4 ms. Remains 400 /400 variables (removed 0) and now considering 578/578 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 124 ms. Remains : 400/426 places, 578/609 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-15-LTLFireability-13 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: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(EQ s113 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][false, false, false, false]]
Stuttering criterion allowed to conclude after 39 steps with 0 reset in 1 ms.
FORMULA CO4-PT-15-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-15-LTLFireability-13 finished in 282 ms.
All properties solved by simple procedures.
Total runtime 102226 ms.

BK_STOP 1717368857779

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CO4-PT-15"
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-15, 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-171734910200073"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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