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.r597-smll-171734926500108.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 MedleyA-PT-22, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r597-smll-171734926500108
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 7.5K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K 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.0K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 13K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 238K 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 MedleyA-PT-22-LTLFireability-00
FORMULA_NAME MedleyA-PT-22-LTLFireability-01
FORMULA_NAME MedleyA-PT-22-LTLFireability-02
FORMULA_NAME MedleyA-PT-22-LTLFireability-03
FORMULA_NAME MedleyA-PT-22-LTLFireability-04
FORMULA_NAME MedleyA-PT-22-LTLFireability-05
FORMULA_NAME MedleyA-PT-22-LTLFireability-06
FORMULA_NAME MedleyA-PT-22-LTLFireability-07
FORMULA_NAME MedleyA-PT-22-LTLFireability-08
FORMULA_NAME MedleyA-PT-22-LTLFireability-09
FORMULA_NAME MedleyA-PT-22-LTLFireability-10
FORMULA_NAME MedleyA-PT-22-LTLFireability-11
FORMULA_NAME MedleyA-PT-22-LTLFireability-12
FORMULA_NAME MedleyA-PT-22-LTLFireability-13
FORMULA_NAME MedleyA-PT-22-LTLFireability-14
FORMULA_NAME MedleyA-PT-22-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717367553585

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=MedleyA-PT-22
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-06-02 22:32:36] [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:32:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:32:36] [INFO ] Load time of PNML (sax parser for PT used): 153 ms
[2024-06-02 22:32:36] [INFO ] Transformed 307 places.
[2024-06-02 22:32:36] [INFO ] Transformed 740 transitions.
[2024-06-02 22:32:36] [INFO ] Found NUPN structural information;
[2024-06-02 22:32:36] [INFO ] Parsed PT model containing 307 places and 740 transitions and 3829 arcs in 274 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA MedleyA-PT-22-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-22-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-22-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-22-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 307 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 307/307 places, 740/740 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 303 transition count 740
Discarding 93 places :
Symmetric choice reduction at 1 with 93 rule applications. Total rules 97 place count 210 transition count 632
Iterating global reduction 1 with 93 rules applied. Total rules applied 190 place count 210 transition count 632
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 198 place count 210 transition count 624
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 220 place count 188 transition count 573
Iterating global reduction 2 with 22 rules applied. Total rules applied 242 place count 188 transition count 573
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 250 place count 180 transition count 554
Iterating global reduction 2 with 8 rules applied. Total rules applied 258 place count 180 transition count 554
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 262 place count 176 transition count 542
Iterating global reduction 2 with 4 rules applied. Total rules applied 266 place count 176 transition count 542
Applied a total of 266 rules in 105 ms. Remains 176 /307 variables (removed 131) and now considering 542/740 (removed 198) transitions.
// Phase 1: matrix 542 rows 176 cols
[2024-06-02 22:32:37] [INFO ] Computed 22 invariants in 23 ms
[2024-06-02 22:32:37] [INFO ] Implicit Places using invariants in 469 ms returned []
[2024-06-02 22:32:37] [INFO ] Invariant cache hit.
[2024-06-02 22:32:38] [INFO ] Implicit Places using invariants and state equation in 549 ms returned []
Implicit Place search using SMT with State Equation took 1065 ms to find 0 implicit places.
[2024-06-02 22:32:38] [INFO ] Invariant cache hit.
[2024-06-02 22:32:38] [INFO ] Dead Transitions using invariants and state equation in 432 ms found 144 transitions.
Found 144 dead transitions using SMT.
Drop transitions removed 144 transitions
Dead transitions reduction (with SMT) removed 144 transitions
Starting structural reductions in LTL mode, iteration 1 : 176/307 places, 398/740 transitions.
Applied a total of 0 rules in 4 ms. Remains 176 /176 variables (removed 0) and now considering 398/398 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1609 ms. Remains : 176/307 places, 398/740 transitions.
Support contains 41 out of 176 places after structural reductions.
[2024-06-02 22:32:38] [INFO ] Flatten gal took : 103 ms
[2024-06-02 22:32:38] [INFO ] Flatten gal took : 59 ms
[2024-06-02 22:32:39] [INFO ] Input system was already deterministic with 398 transitions.
Incomplete random walk after 10000 steps, including 293 resets, run finished after 930 ms. (steps per millisecond=10 ) properties (out of 25) seen :6
Incomplete Best-First random walk after 1001 steps, including 5 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 5 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 7 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 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 5 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 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 6 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
// Phase 1: matrix 398 rows 176 cols
[2024-06-02 22:32:40] [INFO ] Computed 22 invariants in 5 ms
[2024-06-02 22:32:40] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-06-02 22:32:40] [INFO ] [Real]Absence check using 6 positive and 16 generalized place invariants in 9 ms returned sat
[2024-06-02 22:32:40] [INFO ] After 554ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:17
[2024-06-02 22:32:41] [INFO ] [Nat]Absence check using 6 positive place invariants in 8 ms returned sat
[2024-06-02 22:32:41] [INFO ] [Nat]Absence check using 6 positive and 16 generalized place invariants in 8 ms returned sat
[2024-06-02 22:32:41] [INFO ] After 612ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :12
[2024-06-02 22:32:42] [INFO ] After 1293ms SMT Verify possible using trap constraints in natural domain returned unsat :7 sat :12
Attempting to minimize the solution found.
Minimization took 481 ms.
[2024-06-02 22:32:42] [INFO ] After 2028ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :12
Fused 19 Parikh solutions to 12 different solutions.
Parikh walk visited 2 properties in 117 ms.
Support contains 19 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 398/398 transitions.
Graph (complete) has 750 edges and 176 vertex of which 175 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 175 transition count 376
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 42 place count 155 transition count 376
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 42 place count 155 transition count 370
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 54 place count 149 transition count 370
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 59 place count 144 transition count 363
Iterating global reduction 2 with 5 rules applied. Total rules applied 64 place count 144 transition count 363
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 65 place count 144 transition count 362
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 66 place count 143 transition count 358
Iterating global reduction 3 with 1 rules applied. Total rules applied 67 place count 143 transition count 358
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 68 place count 142 transition count 355
Iterating global reduction 3 with 1 rules applied. Total rules applied 69 place count 142 transition count 355
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 43 rules applied. Total rules applied 112 place count 119 transition count 335
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 115 place count 116 transition count 332
Iterating global reduction 3 with 3 rules applied. Total rules applied 118 place count 116 transition count 332
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 128 place count 111 transition count 377
Drop transitions removed 59 transitions
Redundant transition composition rules discarded 59 transitions
Iterating global reduction 3 with 59 rules applied. Total rules applied 187 place count 111 transition count 318
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 189 place count 110 transition count 329
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 193 place count 110 transition count 325
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 197 place count 106 transition count 325
Free-agglomeration rule (complex) applied 11 times with reduction of 4 identical transitions.
Iterating global reduction 4 with 11 rules applied. Total rules applied 208 place count 106 transition count 357
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 223 place count 95 transition count 353
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 237 place count 95 transition count 353
Applied a total of 237 rules in 159 ms. Remains 95 /176 variables (removed 81) and now considering 353/398 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 95/176 places, 353/398 transitions.
Incomplete random walk after 10000 steps, including 715 resets, run finished after 372 ms. (steps per millisecond=26 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 134 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 138 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 139 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 130 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 126 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 353 rows 95 cols
[2024-06-02 22:32:44] [INFO ] Computed 20 invariants in 3 ms
[2024-06-02 22:32:44] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-06-02 22:32:44] [INFO ] [Real]Absence check using 15 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 22:32:44] [INFO ] After 321ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:7
[2024-06-02 22:32:44] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 22:32:44] [INFO ] After 29ms SMT Verify possible using 60 Read/Feed constraints in real domain returned unsat :0 sat :0 real:8
[2024-06-02 22:32:44] [INFO ] After 460ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-06-02 22:32:44] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-06-02 22:32:44] [INFO ] [Nat]Absence check using 15 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-02 22:32:44] [INFO ] After 334ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-06-02 22:32:45] [INFO ] After 232ms SMT Verify possible using 60 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2024-06-02 22:32:45] [INFO ] After 514ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 211 ms.
[2024-06-02 22:32:45] [INFO ] After 1167ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 7 properties in 59 ms.
Support contains 5 out of 95 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 95/95 places, 353/353 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 0 with 3 rules applied. Total rules applied 3 place count 95 transition count 350
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 92 transition count 350
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 92 transition count 349
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 91 transition count 349
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 90 transition count 345
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 90 transition count 345
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 2 with 6 rules applied. Total rules applied 16 place count 87 transition count 342
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 85 transition count 357
Free-agglomeration rule applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 25 place count 85 transition count 352
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 32 place count 80 transition count 350
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 36 place count 80 transition count 497
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 40 place count 76 transition count 497
Applied a total of 40 rules in 67 ms. Remains 76 /95 variables (removed 19) and now considering 497/353 (removed -144) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 76/95 places, 497/353 transitions.
Incomplete random walk after 10000 steps, including 902 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 116 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 768293 steps, run timeout after 3001 ms. (steps per millisecond=256 ) properties seen :{}
Probabilistic random walk after 768293 steps, saw 167252 distinct states, run finished after 3002 ms. (steps per millisecond=255 ) properties seen :0
Running SMT prover for 1 properties.
[2024-06-02 22:32:48] [INFO ] Flow matrix only has 493 transitions (discarded 4 similar events)
// Phase 1: matrix 493 rows 76 cols
[2024-06-02 22:32:48] [INFO ] Computed 20 invariants in 5 ms
[2024-06-02 22:32:49] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-06-02 22:32:49] [INFO ] [Real]Absence check using 15 positive and 5 generalized place invariants in 3 ms returned sat
[2024-06-02 22:32:49] [INFO ] After 252ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:32:49] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2024-06-02 22:32:49] [INFO ] [Nat]Absence check using 15 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-02 22:32:49] [INFO ] After 204ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 22:32:49] [INFO ] State equation strengthened by 137 read => feed constraints.
[2024-06-02 22:32:49] [INFO ] After 104ms SMT Verify possible using 137 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 22:32:49] [INFO ] After 157ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2024-06-02 22:32:49] [INFO ] After 460ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 497/497 transitions.
Applied a total of 0 rules in 17 ms. Remains 76 /76 variables (removed 0) and now considering 497/497 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 76/76 places, 497/497 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 497/497 transitions.
Applied a total of 0 rules in 18 ms. Remains 76 /76 variables (removed 0) and now considering 497/497 (removed 0) transitions.
[2024-06-02 22:32:49] [INFO ] Flow matrix only has 493 transitions (discarded 4 similar events)
[2024-06-02 22:32:49] [INFO ] Invariant cache hit.
[2024-06-02 22:32:49] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-06-02 22:32:49] [INFO ] Flow matrix only has 493 transitions (discarded 4 similar events)
[2024-06-02 22:32:49] [INFO ] Invariant cache hit.
[2024-06-02 22:32:50] [INFO ] State equation strengthened by 137 read => feed constraints.
[2024-06-02 22:32:50] [INFO ] Implicit Places using invariants and state equation in 401 ms returned []
Implicit Place search using SMT with State Equation took 528 ms to find 0 implicit places.
[2024-06-02 22:32:50] [INFO ] Redundant transitions in 53 ms returned []
[2024-06-02 22:32:50] [INFO ] Flow matrix only has 493 transitions (discarded 4 similar events)
[2024-06-02 22:32:50] [INFO ] Invariant cache hit.
[2024-06-02 22:32:50] [INFO ] Dead Transitions using invariants and state equation in 296 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 905 ms. Remains : 76/76 places, 497/497 transitions.
Graph (complete) has 516 edges and 76 vertex of which 68 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 98 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 102 transitions.
Iterating post reduction 0 with 102 rules applied. Total rules applied 103 place count 68 transition count 395
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 105 place count 66 transition count 355
Iterating global reduction 1 with 2 rules applied. Total rules applied 107 place count 66 transition count 355
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 109 place count 65 transition count 354
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 111 place count 64 transition count 360
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 119 place count 64 transition count 352
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 1 with 12 rules applied. Total rules applied 131 place count 64 transition count 352
Applied a total of 131 rules in 42 ms. Remains 64 /76 variables (removed 12) and now considering 352/497 (removed 145) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 352 rows 64 cols
[2024-06-02 22:32:50] [INFO ] Computed 15 invariants in 3 ms
[2024-06-02 22:32:50] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-02 22:32:50] [INFO ] [Real]Absence check using 10 positive and 5 generalized place invariants in 6 ms returned sat
[2024-06-02 22:32:50] [INFO ] After 170ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:32:50] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 22:32:50] [INFO ] [Nat]Absence check using 10 positive and 5 generalized place invariants in 2 ms returned sat
[2024-06-02 22:32:51] [INFO ] After 128ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 22:32:51] [INFO ] After 168ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2024-06-02 22:32:51] [INFO ] After 239ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Successfully simplified 7 atomic propositions for a total of 12 simplifications.
FORMULA MedleyA-PT-22-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 17 stabilizing places and 18 stable transitions
Graph (complete) has 750 edges and 176 vertex of which 175 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.13 ms
FORMULA MedleyA-PT-22-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 398/398 transitions.
Graph (complete) has 750 edges and 176 vertex of which 175 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 174 transition count 369
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 55 place count 147 transition count 369
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 55 place count 147 transition count 363
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 67 place count 141 transition count 363
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 74 place count 134 transition count 345
Iterating global reduction 2 with 7 rules applied. Total rules applied 81 place count 134 transition count 345
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 81 place count 134 transition count 344
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 83 place count 133 transition count 344
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 85 place count 131 transition count 338
Iterating global reduction 2 with 2 rules applied. Total rules applied 87 place count 131 transition count 338
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 89 place count 129 transition count 332
Iterating global reduction 2 with 2 rules applied. Total rules applied 91 place count 129 transition count 332
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 138 place count 104 transition count 310
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 139 place count 104 transition count 309
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 143 place count 100 transition count 303
Iterating global reduction 3 with 4 rules applied. Total rules applied 147 place count 100 transition count 303
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 161 place count 93 transition count 347
Drop transitions removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 3 with 38 rules applied. Total rules applied 199 place count 93 transition count 309
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 201 place count 92 transition count 319
Applied a total of 201 rules in 87 ms. Remains 92 /176 variables (removed 84) and now considering 319/398 (removed 79) transitions.
// Phase 1: matrix 319 rows 92 cols
[2024-06-02 22:32:51] [INFO ] Computed 19 invariants in 2 ms
[2024-06-02 22:32:51] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-02 22:32:51] [INFO ] Invariant cache hit.
[2024-06-02 22:32:51] [INFO ] State equation strengthened by 173 read => feed constraints.
[2024-06-02 22:32:51] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
[2024-06-02 22:32:51] [INFO ] Redundant transitions in 6 ms returned []
[2024-06-02 22:32:51] [INFO ] Invariant cache hit.
[2024-06-02 22:32:52] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 92/176 places, 319/398 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 699 ms. Remains : 92/176 places, 319/398 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 212 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-22-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s49 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 3 ms.
FORMULA MedleyA-PT-22-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-22-LTLFireability-01 finished in 995 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 398/398 transitions.
Graph (complete) has 750 edges and 176 vertex of which 175 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 174 transition count 369
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 55 place count 147 transition count 369
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 55 place count 147 transition count 364
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 65 place count 142 transition count 364
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 72 place count 135 transition count 345
Iterating global reduction 2 with 7 rules applied. Total rules applied 79 place count 135 transition count 345
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 79 place count 135 transition count 344
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 81 place count 134 transition count 344
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 84 place count 131 transition count 334
Iterating global reduction 2 with 3 rules applied. Total rules applied 87 place count 131 transition count 334
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 90 place count 128 transition count 325
Iterating global reduction 2 with 3 rules applied. Total rules applied 93 place count 128 transition count 325
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 140 place count 103 transition count 303
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 141 place count 103 transition count 302
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 145 place count 99 transition count 296
Iterating global reduction 3 with 4 rules applied. Total rules applied 149 place count 99 transition count 296
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 161 place count 93 transition count 325
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 3 with 20 rules applied. Total rules applied 181 place count 93 transition count 305
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 183 place count 92 transition count 315
Applied a total of 183 rules in 84 ms. Remains 92 /176 variables (removed 84) and now considering 315/398 (removed 83) transitions.
// Phase 1: matrix 315 rows 92 cols
[2024-06-02 22:32:52] [INFO ] Computed 19 invariants in 3 ms
[2024-06-02 22:32:52] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-06-02 22:32:52] [INFO ] Invariant cache hit.
[2024-06-02 22:32:52] [INFO ] State equation strengthened by 171 read => feed constraints.
[2024-06-02 22:32:52] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
[2024-06-02 22:32:52] [INFO ] Redundant transitions in 4 ms returned []
[2024-06-02 22:32:52] [INFO ] Invariant cache hit.
[2024-06-02 22:32:53] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 92/176 places, 315/398 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 718 ms. Remains : 92/176 places, 315/398 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-22-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s53 1) (NEQ s55 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 12432 reset in 628 ms.
Product exploration explored 100000 steps with 12337 reset in 575 ms.
Computed a total of 13 stabilizing places and 167 stable transitions
Computed a total of 13 stabilizing places and 167 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 1185 steps, including 147 resets, run visited all 1 properties in 7 ms. (steps per millisecond=169 )
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 105 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Support contains 2 out of 92 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 92/92 places, 315/315 transitions.
Applied a total of 0 rules in 10 ms. Remains 92 /92 variables (removed 0) and now considering 315/315 (removed 0) transitions.
[2024-06-02 22:32:54] [INFO ] Invariant cache hit.
[2024-06-02 22:32:54] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-02 22:32:54] [INFO ] Invariant cache hit.
[2024-06-02 22:32:54] [INFO ] State equation strengthened by 171 read => feed constraints.
[2024-06-02 22:32:55] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
[2024-06-02 22:32:55] [INFO ] Redundant transitions in 3 ms returned []
[2024-06-02 22:32:55] [INFO ] Invariant cache hit.
[2024-06-02 22:32:55] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 628 ms. Remains : 92/92 places, 315/315 transitions.
Computed a total of 13 stabilizing places and 167 stable transitions
Computed a total of 13 stabilizing places and 167 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Finished random walk after 147 steps, including 16 resets, run visited all 1 properties in 3 ms. (steps per millisecond=49 )
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 121 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration explored 100000 steps with 12360 reset in 435 ms.
Product exploration explored 100000 steps with 12356 reset in 436 ms.
Built C files in :
/tmp/ltsmin12237306477456489589
[2024-06-02 22:32:56] [INFO ] Computing symmetric may disable matrix : 315 transitions.
[2024-06-02 22:32:56] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:32:56] [INFO ] Computing symmetric may enable matrix : 315 transitions.
[2024-06-02 22:32:56] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:32:56] [INFO ] Computing Do-Not-Accords matrix : 315 transitions.
[2024-06-02 22:32:56] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:32:56] [INFO ] Built C files in 87ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12237306477456489589
Running compilation step : cd /tmp/ltsmin12237306477456489589;'/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 1427 ms.
Running link step : cd /tmp/ltsmin12237306477456489589;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 60 ms.
Running LTSmin : cd /tmp/ltsmin12237306477456489589;'/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/stateBased13524134987109551561.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 92 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 92/92 places, 315/315 transitions.
Applied a total of 0 rules in 9 ms. Remains 92 /92 variables (removed 0) and now considering 315/315 (removed 0) transitions.
[2024-06-02 22:33:11] [INFO ] Invariant cache hit.
[2024-06-02 22:33:11] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-02 22:33:11] [INFO ] Invariant cache hit.
[2024-06-02 22:33:11] [INFO ] State equation strengthened by 171 read => feed constraints.
[2024-06-02 22:33:12] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
[2024-06-02 22:33:12] [INFO ] Redundant transitions in 3 ms returned []
[2024-06-02 22:33:12] [INFO ] Invariant cache hit.
[2024-06-02 22:33:12] [INFO ] Dead Transitions using invariants and state equation in 236 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 663 ms. Remains : 92/92 places, 315/315 transitions.
Built C files in :
/tmp/ltsmin16781805432748633076
[2024-06-02 22:33:12] [INFO ] Computing symmetric may disable matrix : 315 transitions.
[2024-06-02 22:33:12] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:33:12] [INFO ] Computing symmetric may enable matrix : 315 transitions.
[2024-06-02 22:33:12] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:33:12] [INFO ] Computing Do-Not-Accords matrix : 315 transitions.
[2024-06-02 22:33:12] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:33:12] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16781805432748633076
Running compilation step : cd /tmp/ltsmin16781805432748633076;'/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 1152 ms.
Running link step : cd /tmp/ltsmin16781805432748633076;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin16781805432748633076;'/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/stateBased6930034371483441640.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-06-02 22:33:27] [INFO ] Flatten gal took : 40 ms
[2024-06-02 22:33:27] [INFO ] Flatten gal took : 41 ms
[2024-06-02 22:33:27] [INFO ] Time to serialize gal into /tmp/LTL13490110823566229216.gal : 9 ms
[2024-06-02 22:33:27] [INFO ] Time to serialize properties into /tmp/LTL82301052783715970.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/LTL13490110823566229216.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2072519553091878671.hoa' '-atoms' '/tmp/LTL82301052783715970.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...316
Loading property file /tmp/LTL82301052783715970.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2072519553091878671.hoa
Reverse transition relation is NOT exact ! Due to transitions t18, t22, t25, t26, t30, t34, t35, t73, t76, t77, t83, t122, t125, t126, t132, t123.t128, t12...1195
Computing Next relation with stutter on 8258 deadlock states
Detected timeout of ITS tools.
[2024-06-02 22:33:42] [INFO ] Flatten gal took : 33 ms
[2024-06-02 22:33:42] [INFO ] Flatten gal took : 32 ms
[2024-06-02 22:33:42] [INFO ] Time to serialize gal into /tmp/LTL12521320162109147973.gal : 6 ms
[2024-06-02 22:33:42] [INFO ] Time to serialize properties into /tmp/LTL1245429896755593232.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/LTL12521320162109147973.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1245429896755593232.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("((p189!=1)||(p216!=1))"))))
Formula 0 simplified : GF!"((p189!=1)||(p216!=1))"
Reverse transition relation is NOT exact ! Due to transitions t18, t22, t25, t26, t30, t34, t35, t73, t76, t77, t83, t122, t125, t126, t132, t123.t128, t12...1195
Computing Next relation with stutter on 8258 deadlock states
Detected timeout of ITS tools.
[2024-06-02 22:33:57] [INFO ] Flatten gal took : 35 ms
[2024-06-02 22:33:57] [INFO ] Applying decomposition
[2024-06-02 22:33:57] [INFO ] Flatten gal took : 27 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/graph13072332348127647193.txt' '-o' '/tmp/graph13072332348127647193.bin' '-w' '/tmp/graph13072332348127647193.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13072332348127647193.bin' '-l' '-1' '-v' '-w' '/tmp/graph13072332348127647193.weights' '-q' '0' '-e' '0.001'
[2024-06-02 22:33:57] [INFO ] Decomposing Gal with order
[2024-06-02 22:33:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 22:33:58] [INFO ] Removed a total of 553 redundant transitions.
[2024-06-02 22:33:58] [INFO ] Flatten gal took : 93 ms
[2024-06-02 22:33:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 16 ms.
[2024-06-02 22:33:58] [INFO ] Time to serialize gal into /tmp/LTL12407429645841424275.gal : 5 ms
[2024-06-02 22:33:58] [INFO ] Time to serialize properties into /tmp/LTL3546541541206028317.ltl : 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/LTL12407429645841424275.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3546541541206028317.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("((i8.u10.p189!=1)||(i8.u10.p216!=1))"))))
Formula 0 simplified : GF!"((i8.u10.p189!=1)||(i8.u10.p216!=1))"
Reverse transition relation is NOT exact ! Due to transitions t1_t2_t4_t5_t6_t7_t8, t230_t2_t3, t230_t2_t4_t5_t6_t7_t8, t13_t53_t105_t106_t107_t111_t54_t55...895
Computing Next relation with stutter on 8258 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
550 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,5.52287,160060,1,0,269536,16103,1907,863377,1271,104245,236391
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA MedleyA-PT-22-LTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property MedleyA-PT-22-LTLFireability-02 finished in 72333 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 398/398 transitions.
Graph (complete) has 750 edges and 176 vertex of which 175 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 174 transition count 370
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 53 place count 148 transition count 370
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 53 place count 148 transition count 365
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 63 place count 143 transition count 365
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 70 place count 136 transition count 350
Iterating global reduction 2 with 7 rules applied. Total rules applied 77 place count 136 transition count 350
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 77 place count 136 transition count 349
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 79 place count 135 transition count 349
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 81 place count 133 transition count 341
Iterating global reduction 2 with 2 rules applied. Total rules applied 83 place count 133 transition count 341
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 85 place count 131 transition count 335
Iterating global reduction 2 with 2 rules applied. Total rules applied 87 place count 131 transition count 335
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 134 place count 106 transition count 313
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 135 place count 106 transition count 312
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 139 place count 102 transition count 306
Iterating global reduction 3 with 4 rules applied. Total rules applied 143 place count 102 transition count 306
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 157 place count 95 transition count 350
Drop transitions removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 3 with 38 rules applied. Total rules applied 195 place count 95 transition count 312
Applied a total of 195 rules in 64 ms. Remains 95 /176 variables (removed 81) and now considering 312/398 (removed 86) transitions.
// Phase 1: matrix 312 rows 95 cols
[2024-06-02 22:34:04] [INFO ] Computed 19 invariants in 2 ms
[2024-06-02 22:34:04] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-02 22:34:04] [INFO ] Invariant cache hit.
[2024-06-02 22:34:04] [INFO ] State equation strengthened by 142 read => feed constraints.
[2024-06-02 22:34:05] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
[2024-06-02 22:34:05] [INFO ] Redundant transitions in 2 ms returned []
[2024-06-02 22:34:05] [INFO ] Invariant cache hit.
[2024-06-02 22:34:05] [INFO ] Dead Transitions using invariants and state equation in 241 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 95/176 places, 312/398 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 698 ms. Remains : 95/176 places, 312/398 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-22-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s3 1) (EQ s7 1) (EQ s27 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-22-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-22-LTLFireability-03 finished in 758 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 8 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 398/398 transitions.
Graph (complete) has 750 edges and 176 vertex of which 175 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 174 transition count 371
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 51 place count 149 transition count 371
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 51 place count 149 transition count 366
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 61 place count 144 transition count 366
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 70 place count 135 transition count 345
Iterating global reduction 2 with 9 rules applied. Total rules applied 79 place count 135 transition count 345
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 80 place count 135 transition count 344
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 84 place count 131 transition count 331
Iterating global reduction 3 with 4 rules applied. Total rules applied 88 place count 131 transition count 331
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 91 place count 128 transition count 322
Iterating global reduction 3 with 3 rules applied. Total rules applied 94 place count 128 transition count 322
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 130 place count 109 transition count 305
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 132 place count 107 transition count 303
Iterating global reduction 3 with 2 rules applied. Total rules applied 134 place count 107 transition count 303
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 146 place count 101 transition count 332
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 3 with 20 rules applied. Total rules applied 166 place count 101 transition count 312
Applied a total of 166 rules in 45 ms. Remains 101 /176 variables (removed 75) and now considering 312/398 (removed 86) transitions.
// Phase 1: matrix 312 rows 101 cols
[2024-06-02 22:34:05] [INFO ] Computed 20 invariants in 3 ms
[2024-06-02 22:34:05] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-02 22:34:05] [INFO ] Invariant cache hit.
[2024-06-02 22:34:05] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-02 22:34:05] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
[2024-06-02 22:34:05] [INFO ] Redundant transitions in 3 ms returned []
[2024-06-02 22:34:05] [INFO ] Invariant cache hit.
[2024-06-02 22:34:05] [INFO ] Dead Transitions using invariants and state equation in 209 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 101/176 places, 312/398 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 566 ms. Remains : 101/176 places, 312/398 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-22-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s31 0) (EQ s56 0) (EQ s60 0) (EQ s69 0) (AND (EQ s29 1) (EQ s33 1) (EQ s86 1) (EQ s91 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 9113 reset in 349 ms.
Product exploration explored 100000 steps with 9077 reset in 360 ms.
Computed a total of 5 stabilizing places and 60 stable transitions
Computed a total of 5 stabilizing places and 60 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 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)]
Incomplete random walk after 10000 steps, including 897 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 127 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1204652 steps, run timeout after 3001 ms. (steps per millisecond=401 ) properties seen :{}
Probabilistic random walk after 1204652 steps, saw 238592 distinct states, run finished after 3001 ms. (steps per millisecond=401 ) properties seen :0
Running SMT prover for 1 properties.
[2024-06-02 22:34:10] [INFO ] Invariant cache hit.
[2024-06-02 22:34:10] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:34:10] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 22:34:10] [INFO ] [Nat]Absence check using 10 positive and 10 generalized place invariants in 4 ms returned sat
[2024-06-02 22:34:10] [INFO ] After 126ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 22:34:10] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-02 22:34:10] [INFO ] After 47ms SMT Verify possible using 75 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 22:34:10] [INFO ] After 89ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2024-06-02 22:34:10] [INFO ] After 298ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 8 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 312/312 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 101 transition count 311
Free-agglomeration rule applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 7 place count 101 transition count 305
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 95 transition count 305
Free-agglomeration rule (complex) applied 20 times with reduction of 8 identical transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 33 place count 95 transition count 492
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 66 place count 75 transition count 479
Applied a total of 66 rules in 27 ms. Remains 75 /101 variables (removed 26) and now considering 479/312 (removed -167) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 75/101 places, 479/312 transitions.
Incomplete random walk after 10000 steps, including 1171 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 207 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Finished probabilistic random walk after 591856 steps, run visited all 1 properties in 1914 ms. (steps per millisecond=309 )
Probabilistic random walk after 591856 steps, saw 116376 distinct states, run finished after 1915 ms. (steps per millisecond=309 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 118 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 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Support contains 8 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 312/312 transitions.
Applied a total of 0 rules in 7 ms. Remains 101 /101 variables (removed 0) and now considering 312/312 (removed 0) transitions.
[2024-06-02 22:34:12] [INFO ] Invariant cache hit.
[2024-06-02 22:34:12] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-02 22:34:12] [INFO ] Invariant cache hit.
[2024-06-02 22:34:12] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-02 22:34:13] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
[2024-06-02 22:34:13] [INFO ] Redundant transitions in 2 ms returned []
[2024-06-02 22:34:13] [INFO ] Invariant cache hit.
[2024-06-02 22:34:13] [INFO ] Dead Transitions using invariants and state equation in 240 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 555 ms. Remains : 101/101 places, 312/312 transitions.
Computed a total of 5 stabilizing places and 60 stable transitions
Computed a total of 5 stabilizing places and 60 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 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)]
Incomplete random walk after 10000 steps, including 914 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 119 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1197039 steps, run timeout after 3001 ms. (steps per millisecond=398 ) properties seen :{}
Probabilistic random walk after 1197039 steps, saw 237330 distinct states, run finished after 3001 ms. (steps per millisecond=398 ) properties seen :0
Running SMT prover for 1 properties.
[2024-06-02 22:34:16] [INFO ] Invariant cache hit.
[2024-06-02 22:34:16] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 22:34:16] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-02 22:34:16] [INFO ] [Nat]Absence check using 10 positive and 10 generalized place invariants in 5 ms returned sat
[2024-06-02 22:34:16] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 22:34:16] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-02 22:34:16] [INFO ] After 45ms SMT Verify possible using 75 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 22:34:16] [INFO ] After 92ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2024-06-02 22:34:16] [INFO ] After 319ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 8 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 312/312 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 101 transition count 311
Free-agglomeration rule applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 7 place count 101 transition count 305
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 95 transition count 305
Free-agglomeration rule (complex) applied 20 times with reduction of 8 identical transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 33 place count 95 transition count 492
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 66 place count 75 transition count 479
Applied a total of 66 rules in 25 ms. Remains 75 /101 variables (removed 26) and now considering 479/312 (removed -167) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 75/101 places, 479/312 transitions.
Incomplete random walk after 10000 steps, including 1167 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 219 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Finished probabilistic random walk after 591856 steps, run visited all 1 properties in 1921 ms. (steps per millisecond=308 )
Probabilistic random walk after 591856 steps, saw 116376 distinct states, run finished after 1921 ms. (steps per millisecond=308 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 113 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 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 9065 reset in 342 ms.
Product exploration explored 100000 steps with 9080 reset in 361 ms.
Built C files in :
/tmp/ltsmin9658122590353799079
[2024-06-02 22:34:19] [INFO ] Computing symmetric may disable matrix : 312 transitions.
[2024-06-02 22:34:19] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:34:19] [INFO ] Computing symmetric may enable matrix : 312 transitions.
[2024-06-02 22:34:20] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:34:20] [INFO ] Computing Do-Not-Accords matrix : 312 transitions.
[2024-06-02 22:34:20] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:34:20] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9658122590353799079
Running compilation step : cd /tmp/ltsmin9658122590353799079;'/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 1222 ms.
Running link step : cd /tmp/ltsmin9658122590353799079;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin9658122590353799079;'/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/stateBased3204738242104885637.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 312/312 transitions.
Applied a total of 0 rules in 7 ms. Remains 101 /101 variables (removed 0) and now considering 312/312 (removed 0) transitions.
[2024-06-02 22:34:35] [INFO ] Invariant cache hit.
[2024-06-02 22:34:35] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-02 22:34:35] [INFO ] Invariant cache hit.
[2024-06-02 22:34:35] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-06-02 22:34:35] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2024-06-02 22:34:35] [INFO ] Redundant transitions in 3 ms returned []
[2024-06-02 22:34:35] [INFO ] Invariant cache hit.
[2024-06-02 22:34:35] [INFO ] Dead Transitions using invariants and state equation in 231 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 563 ms. Remains : 101/101 places, 312/312 transitions.
Built C files in :
/tmp/ltsmin12331094141929073062
[2024-06-02 22:34:35] [INFO ] Computing symmetric may disable matrix : 312 transitions.
[2024-06-02 22:34:35] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:34:35] [INFO ] Computing symmetric may enable matrix : 312 transitions.
[2024-06-02 22:34:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:34:35] [INFO ] Computing Do-Not-Accords matrix : 312 transitions.
[2024-06-02 22:34:35] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:34:35] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12331094141929073062
Running compilation step : cd /tmp/ltsmin12331094141929073062;'/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 1169 ms.
Running link step : cd /tmp/ltsmin12331094141929073062;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin12331094141929073062;'/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/stateBased609953277023301238.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-06-02 22:34:50] [INFO ] Flatten gal took : 25 ms
[2024-06-02 22:34:50] [INFO ] Flatten gal took : 24 ms
[2024-06-02 22:34:50] [INFO ] Time to serialize gal into /tmp/LTL10787511486855562979.gal : 4 ms
[2024-06-02 22:34:50] [INFO ] Time to serialize properties into /tmp/LTL11595438271729093635.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/LTL10787511486855562979.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16854503440767419460.hoa' '-atoms' '/tmp/LTL11595438271729093635.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...320
Loading property file /tmp/LTL11595438271729093635.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16854503440767419460.hoa
Reverse transition relation is NOT exact ! Due to transitions t12, t18, t22, t25, t26, t30, t34, t35, t58, t59, t61, t73, t76, t77, t81, t83, t87, t88, t10...1100
Computing Next relation with stutter on 12044 deadlock states
Detected timeout of ITS tools.
[2024-06-02 22:35:05] [INFO ] Flatten gal took : 24 ms
[2024-06-02 22:35:05] [INFO ] Flatten gal took : 22 ms
[2024-06-02 22:35:05] [INFO ] Time to serialize gal into /tmp/LTL15004065476368208649.gal : 4 ms
[2024-06-02 22:35:05] [INFO ] Time to serialize properties into /tmp/LTL10131135555344522844.ltl : 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/LTL15004065476368208649.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10131135555344522844.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...277
Read 1 LTL properties
Checking formula 0 : !((G(F("((((p120==0)||(p181==0))||((p210==0)||(p231==0)))||(((p111==1)&&(p125==1))&&((p274==1)&&(p296==1))))"))))
Formula 0 simplified : FG!"((((p120==0)||(p181==0))||((p210==0)||(p231==0)))||(((p111==1)&&(p125==1))&&((p274==1)&&(p296==1))))"
Reverse transition relation is NOT exact ! Due to transitions t12, t18, t22, t25, t26, t30, t34, t35, t58, t59, t61, t73, t76, t77, t81, t83, t87, t88, t10...1100
Computing Next relation with stutter on 12044 deadlock states
Detected timeout of ITS tools.
[2024-06-02 22:35:20] [INFO ] Flatten gal took : 20 ms
[2024-06-02 22:35:20] [INFO ] Applying decomposition
[2024-06-02 22:35:20] [INFO ] Flatten gal took : 20 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/graph14253151714904705801.txt' '-o' '/tmp/graph14253151714904705801.bin' '-w' '/tmp/graph14253151714904705801.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14253151714904705801.bin' '-l' '-1' '-v' '-w' '/tmp/graph14253151714904705801.weights' '-q' '0' '-e' '0.001'
[2024-06-02 22:35:21] [INFO ] Decomposing Gal with order
[2024-06-02 22:35:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 22:35:21] [INFO ] Removed a total of 737 redundant transitions.
[2024-06-02 22:35:21] [INFO ] Flatten gal took : 42 ms
[2024-06-02 22:35:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 9 ms.
[2024-06-02 22:35:21] [INFO ] Time to serialize gal into /tmp/LTL10687306220141492696.gal : 4 ms
[2024-06-02 22:35:21] [INFO ] Time to serialize properties into /tmp/LTL3451448916088779229.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/LTL10687306220141492696.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3451448916088779229.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 : !((G(F("((((i1.u5.p120==0)||(i1.u13.p181==0))||((i3.i0.u14.p210==0)||(i3.i1.u17.p231==0)))||(((i2.u6.p111==1)&&(i2.u7.p125==1))&&((i4....193
Formula 0 simplified : FG!"((((i1.u5.p120==0)||(i1.u13.p181==0))||((i3.i0.u14.p210==0)||(i3.i1.u17.p231==0)))||(((i2.u6.p111==1)&&(i2.u7.p125==1))&&((i4.u2...187
Reverse transition relation is NOT exact ! Due to transitions t176, t192, t194, t198, t222, t224, t228, t152_t187, t13_t53_t105_t106_t107_t111_t54_t55_t56_...973
Computing Next relation with stutter on 12044 deadlock states
10 unique states visited
0 strongly connected components in search stack
18 transitions explored
10 items max in DFS search stack
454 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,4.57321,93372,1,0,132646,4714,2463,467473,858,20069,156278
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA MedleyA-PT-22-LTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property MedleyA-PT-22-LTLFireability-04 finished in 80698 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 398/398 transitions.
Graph (complete) has 750 edges and 176 vertex of which 175 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 174 transition count 370
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 53 place count 148 transition count 370
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 53 place count 148 transition count 363
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 67 place count 141 transition count 363
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 75 place count 133 transition count 343
Iterating global reduction 2 with 8 rules applied. Total rules applied 83 place count 133 transition count 343
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 86 place count 130 transition count 333
Iterating global reduction 2 with 3 rules applied. Total rules applied 89 place count 130 transition count 333
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 92 place count 127 transition count 324
Iterating global reduction 2 with 3 rules applied. Total rules applied 95 place count 127 transition count 324
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 43 rules applied. Total rules applied 138 place count 104 transition count 304
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 139 place count 104 transition count 303
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 143 place count 100 transition count 297
Iterating global reduction 3 with 4 rules applied. Total rules applied 147 place count 100 transition count 297
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 159 place count 94 transition count 326
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 3 with 20 rules applied. Total rules applied 179 place count 94 transition count 306
Applied a total of 179 rules in 36 ms. Remains 94 /176 variables (removed 82) and now considering 306/398 (removed 92) transitions.
// Phase 1: matrix 306 rows 94 cols
[2024-06-02 22:35:26] [INFO ] Computed 19 invariants in 2 ms
[2024-06-02 22:35:26] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-02 22:35:26] [INFO ] Invariant cache hit.
[2024-06-02 22:35:26] [INFO ] State equation strengthened by 126 read => feed constraints.
[2024-06-02 22:35:26] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
[2024-06-02 22:35:26] [INFO ] Redundant transitions in 2 ms returned []
[2024-06-02 22:35:26] [INFO ] Invariant cache hit.
[2024-06-02 22:35:26] [INFO ] Dead Transitions using invariants and state equation in 238 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 94/176 places, 306/398 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 644 ms. Remains : 94/176 places, 306/398 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-22-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s53 1) (EQ s77 1) (EQ s80 1) (EQ s86 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-22-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-22-LTLFireability-06 finished in 708 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 398/398 transitions.
Graph (complete) has 750 edges and 176 vertex of which 175 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 174 transition count 369
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 55 place count 147 transition count 369
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 55 place count 147 transition count 363
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 67 place count 141 transition count 363
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 74 place count 134 transition count 345
Iterating global reduction 2 with 7 rules applied. Total rules applied 81 place count 134 transition count 345
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 81 place count 134 transition count 344
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 83 place count 133 transition count 344
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 85 place count 131 transition count 338
Iterating global reduction 2 with 2 rules applied. Total rules applied 87 place count 131 transition count 338
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 89 place count 129 transition count 332
Iterating global reduction 2 with 2 rules applied. Total rules applied 91 place count 129 transition count 332
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 138 place count 104 transition count 310
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 139 place count 104 transition count 309
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 143 place count 100 transition count 303
Iterating global reduction 3 with 4 rules applied. Total rules applied 147 place count 100 transition count 303
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 161 place count 93 transition count 347
Drop transitions removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 3 with 38 rules applied. Total rules applied 199 place count 93 transition count 309
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 201 place count 92 transition count 319
Applied a total of 201 rules in 47 ms. Remains 92 /176 variables (removed 84) and now considering 319/398 (removed 79) transitions.
// Phase 1: matrix 319 rows 92 cols
[2024-06-02 22:35:26] [INFO ] Computed 19 invariants in 2 ms
[2024-06-02 22:35:26] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-02 22:35:26] [INFO ] Invariant cache hit.
[2024-06-02 22:35:27] [INFO ] State equation strengthened by 173 read => feed constraints.
[2024-06-02 22:35:27] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
[2024-06-02 22:35:27] [INFO ] Redundant transitions in 2 ms returned []
[2024-06-02 22:35:27] [INFO ] Invariant cache hit.
[2024-06-02 22:35:27] [INFO ] Dead Transitions using invariants and state equation in 224 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 92/176 places, 319/398 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 696 ms. Remains : 92/176 places, 319/398 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-22-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s24 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-22-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-22-LTLFireability-08 finished in 753 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||(G(F(p1)) U G(p2)))))'
Support contains 3 out of 176 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 398/398 transitions.
Graph (complete) has 750 edges and 176 vertex of which 175 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 174 transition count 372
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 150 transition count 371
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 51 place count 149 transition count 371
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 51 place count 149 transition count 364
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 65 place count 142 transition count 364
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 72 place count 135 transition count 346
Iterating global reduction 3 with 7 rules applied. Total rules applied 79 place count 135 transition count 346
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 79 place count 135 transition count 345
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 81 place count 134 transition count 345
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 84 place count 131 transition count 335
Iterating global reduction 3 with 3 rules applied. Total rules applied 87 place count 131 transition count 335
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 90 place count 128 transition count 326
Iterating global reduction 3 with 3 rules applied. Total rules applied 93 place count 128 transition count 326
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 45 rules applied. Total rules applied 138 place count 104 transition count 305
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 141 place count 101 transition count 302
Iterating global reduction 3 with 3 rules applied. Total rules applied 144 place count 101 transition count 302
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 158 place count 94 transition count 341
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 3 with 24 rules applied. Total rules applied 182 place count 94 transition count 317
Applied a total of 182 rules in 41 ms. Remains 94 /176 variables (removed 82) and now considering 317/398 (removed 81) transitions.
// Phase 1: matrix 317 rows 94 cols
[2024-06-02 22:35:27] [INFO ] Computed 19 invariants in 2 ms
[2024-06-02 22:35:27] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-02 22:35:27] [INFO ] Invariant cache hit.
[2024-06-02 22:35:27] [INFO ] State equation strengthened by 171 read => feed constraints.
[2024-06-02 22:35:28] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
[2024-06-02 22:35:28] [INFO ] Redundant transitions in 3 ms returned []
[2024-06-02 22:35:28] [INFO ] Invariant cache hit.
[2024-06-02 22:35:28] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 94/176 places, 317/398 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 666 ms. Remains : 94/176 places, 317/398 transitions.
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p2) (NOT p0))]
Running random walk in product with property : MedleyA-PT-22-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p2:(EQ s20 1), p0:(AND (EQ s9 1) (EQ s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-22-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-22-LTLFireability-09 finished in 744 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(((p1&&X(!p2))||G(!p2))))))'
Support contains 6 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 398/398 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 169 transition count 384
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 169 transition count 384
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 169 transition count 383
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 166 transition count 373
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 166 transition count 373
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 163 transition count 364
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 163 transition count 364
Applied a total of 27 rules in 10 ms. Remains 163 /176 variables (removed 13) and now considering 364/398 (removed 34) transitions.
// Phase 1: matrix 364 rows 163 cols
[2024-06-02 22:35:28] [INFO ] Computed 22 invariants in 3 ms
[2024-06-02 22:35:28] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-06-02 22:35:28] [INFO ] Invariant cache hit.
[2024-06-02 22:35:28] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
[2024-06-02 22:35:28] [INFO ] Invariant cache hit.
[2024-06-02 22:35:29] [INFO ] Dead Transitions using invariants and state equation in 296 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 163/176 places, 364/398 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 686 ms. Remains : 163/176 places, 364/398 transitions.
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p0) p2), (NOT p0), p2, p2]
Running random walk in product with property : MedleyA-PT-22-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p2 p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 3}, { cond=(AND p2 p1), acceptance={0} source=2 dest: 3}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p2 p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s71 1) (EQ s74 1)), p2:(AND (EQ s54 1) (EQ s67 1) (EQ s90 1)), p1:(EQ s89 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 36 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-22-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-22-LTLFireability-11 finished in 925 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' '!((p0 U X(G(p1))))'
Support contains 8 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 398/398 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 168 transition count 381
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 168 transition count 381
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 168 transition count 380
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 165 transition count 370
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 165 transition count 370
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 26 place count 162 transition count 361
Iterating global reduction 1 with 3 rules applied. Total rules applied 29 place count 162 transition count 361
Applied a total of 29 rules in 14 ms. Remains 162 /176 variables (removed 14) and now considering 361/398 (removed 37) transitions.
// Phase 1: matrix 361 rows 162 cols
[2024-06-02 22:35:29] [INFO ] Computed 22 invariants in 6 ms
[2024-06-02 22:35:29] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-02 22:35:29] [INFO ] Invariant cache hit.
[2024-06-02 22:35:29] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
[2024-06-02 22:35:29] [INFO ] Invariant cache hit.
[2024-06-02 22:35:29] [INFO ] Dead Transitions using invariants and state equation in 297 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 162/176 places, 361/398 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 670 ms. Remains : 162/176 places, 361/398 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : MedleyA-PT-22-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(AND (EQ s10 1) (EQ s35 1) (EQ s100 1) (EQ s135 1) (EQ s63 1)), p0:(AND (EQ s54 1) (EQ s60 1) (EQ s89 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-22-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-22-LTLFireability-13 finished in 787 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||F(p1)))))'
Support contains 5 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 398/398 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 168 transition count 378
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 168 transition count 378
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 168 transition count 377
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 21 place count 164 transition count 364
Iterating global reduction 1 with 4 rules applied. Total rules applied 25 place count 164 transition count 364
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 28 place count 161 transition count 355
Iterating global reduction 1 with 3 rules applied. Total rules applied 31 place count 161 transition count 355
Applied a total of 31 rules in 9 ms. Remains 161 /176 variables (removed 15) and now considering 355/398 (removed 43) transitions.
// Phase 1: matrix 355 rows 161 cols
[2024-06-02 22:35:30] [INFO ] Computed 22 invariants in 2 ms
[2024-06-02 22:35:30] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-06-02 22:35:30] [INFO ] Invariant cache hit.
[2024-06-02 22:35:30] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
[2024-06-02 22:35:30] [INFO ] Invariant cache hit.
[2024-06-02 22:35:30] [INFO ] Dead Transitions using invariants and state equation in 288 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 161/176 places, 355/398 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 709 ms. Remains : 161/176 places, 355/398 transitions.
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MedleyA-PT-22-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(OR (EQ s54 0) (EQ s89 0) (EQ s137 0) (EQ s157 0)), p0:(EQ s98 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]]
Product exploration explored 100000 steps with 33333 reset in 293 ms.
Product exploration explored 100000 steps with 33333 reset in 287 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Graph (complete) has 683 edges and 161 vertex of which 160 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 16 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-22-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-22-LTLFireability-15 finished in 1569 ms.
All properties solved by simple procedures.
Total runtime 175361 ms.

BK_STOP 1717367732760

--------------------
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="MedleyA-PT-22"
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 MedleyA-PT-22, 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 r597-smll-171734926500108"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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