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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 6.6K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.1K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K 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 160K 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-11-LTLFireability-00
FORMULA_NAME MedleyA-PT-11-LTLFireability-01
FORMULA_NAME MedleyA-PT-11-LTLFireability-02
FORMULA_NAME MedleyA-PT-11-LTLFireability-03
FORMULA_NAME MedleyA-PT-11-LTLFireability-04
FORMULA_NAME MedleyA-PT-11-LTLFireability-05
FORMULA_NAME MedleyA-PT-11-LTLFireability-06
FORMULA_NAME MedleyA-PT-11-LTLFireability-07
FORMULA_NAME MedleyA-PT-11-LTLFireability-08
FORMULA_NAME MedleyA-PT-11-LTLFireability-09
FORMULA_NAME MedleyA-PT-11-LTLFireability-10
FORMULA_NAME MedleyA-PT-11-LTLFireability-11
FORMULA_NAME MedleyA-PT-11-LTLFireability-12
FORMULA_NAME MedleyA-PT-11-LTLFireability-13
FORMULA_NAME MedleyA-PT-11-LTLFireability-14
FORMULA_NAME MedleyA-PT-11-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717362339552

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-11
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-06-02 21:05:42] [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 21:05:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:05:42] [INFO ] Load time of PNML (sax parser for PT used): 137 ms
[2024-06-02 21:05:42] [INFO ] Transformed 150 places.
[2024-06-02 21:05:42] [INFO ] Transformed 478 transitions.
[2024-06-02 21:05:42] [INFO ] Found NUPN structural information;
[2024-06-02 21:05:42] [INFO ] Parsed PT model containing 150 places and 478 transitions and 2705 arcs in 289 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 9 transitions
Reduce redundant transitions removed 9 transitions.
FORMULA MedleyA-PT-11-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-11-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-11-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-11-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 469/469 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 117 transition count 421
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 117 transition count 421
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 72 place count 111 transition count 389
Iterating global reduction 0 with 6 rules applied. Total rules applied 78 place count 111 transition count 389
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 110 transition count 385
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 110 transition count 385
Applied a total of 80 rules in 52 ms. Remains 110 /150 variables (removed 40) and now considering 385/469 (removed 84) transitions.
[2024-06-02 21:05:43] [INFO ] Flow matrix only has 313 transitions (discarded 72 similar events)
// Phase 1: matrix 313 rows 110 cols
[2024-06-02 21:05:43] [INFO ] Computed 23 invariants in 15 ms
[2024-06-02 21:05:43] [INFO ] Implicit Places using invariants in 288 ms returned []
[2024-06-02 21:05:43] [INFO ] Flow matrix only has 313 transitions (discarded 72 similar events)
[2024-06-02 21:05:43] [INFO ] Invariant cache hit.
[2024-06-02 21:05:43] [INFO ] State equation strengthened by 158 read => feed constraints.
[2024-06-02 21:05:43] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 632 ms to find 0 implicit places.
[2024-06-02 21:05:43] [INFO ] Flow matrix only has 313 transitions (discarded 72 similar events)
[2024-06-02 21:05:43] [INFO ] Invariant cache hit.
[2024-06-02 21:05:44] [INFO ] Dead Transitions using invariants and state equation in 346 ms found 108 transitions.
Found 108 dead transitions using SMT.
Drop transitions removed 108 transitions
Dead transitions reduction (with SMT) removed 108 transitions
Starting structural reductions in LTL mode, iteration 1 : 110/150 places, 277/469 transitions.
Applied a total of 0 rules in 10 ms. Remains 110 /110 variables (removed 0) and now considering 277/277 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1046 ms. Remains : 110/150 places, 277/469 transitions.
Support contains 46 out of 110 places after structural reductions.
[2024-06-02 21:05:44] [INFO ] Flatten gal took : 80 ms
[2024-06-02 21:05:44] [INFO ] Flatten gal took : 42 ms
[2024-06-02 21:05:44] [INFO ] Input system was already deterministic with 277 transitions.
Support contains 43 out of 110 places (down from 46) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 770 resets, run finished after 827 ms. (steps per millisecond=12 ) properties (out of 27) seen :8
Incomplete Best-First random walk after 1001 steps, including 15 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 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 14 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 9 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 14 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 11 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 13 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 14 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 12 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 11 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 12 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 12 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 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 16 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 12 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 10 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 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 12 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 12 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
// Phase 1: matrix 277 rows 110 cols
[2024-06-02 21:05:45] [INFO ] Computed 23 invariants in 12 ms
[2024-06-02 21:05:45] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-06-02 21:05:45] [INFO ] [Real]Absence check using 9 positive and 14 generalized place invariants in 22 ms returned sat
[2024-06-02 21:05:45] [INFO ] After 196ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:17
[2024-06-02 21:05:46] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2024-06-02 21:05:46] [INFO ] [Nat]Absence check using 9 positive and 14 generalized place invariants in 6 ms returned sat
[2024-06-02 21:05:46] [INFO ] After 301ms SMT Verify possible using state equation in natural domain returned unsat :8 sat :11
[2024-06-02 21:05:46] [INFO ] State equation strengthened by 122 read => feed constraints.
[2024-06-02 21:05:46] [INFO ] After 249ms SMT Verify possible using 122 Read/Feed constraints in natural domain returned unsat :8 sat :11
[2024-06-02 21:05:47] [INFO ] After 641ms SMT Verify possible using trap constraints in natural domain returned unsat :8 sat :11
Attempting to minimize the solution found.
Minimization took 311 ms.
[2024-06-02 21:05:47] [INFO ] After 1464ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :11
Fused 19 Parikh solutions to 11 different solutions.
Parikh walk visited 1 properties in 52 ms.
Support contains 21 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 277/277 transitions.
Graph (complete) has 545 edges and 110 vertex of which 109 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
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 107 transition count 276
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 9 place count 101 transition count 259
Iterating global reduction 1 with 6 rules applied. Total rules applied 15 place count 101 transition count 259
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 100 transition count 254
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 100 transition count 254
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 99 transition count 250
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 99 transition count 250
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 21 place count 98 transition count 249
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 23 place count 97 transition count 255
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 33 place count 97 transition count 245
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 35 place count 96 transition count 244
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 1 with 10 rules applied. Total rules applied 45 place count 96 transition count 333
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 71 place count 86 transition count 317
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 86 transition count 316
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 81 place count 86 transition count 316
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 83 place count 84 transition count 313
Iterating global reduction 2 with 2 rules applied. Total rules applied 85 place count 84 transition count 313
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 87 place count 84 transition count 311
Applied a total of 87 rules in 145 ms. Remains 84 /110 variables (removed 26) and now considering 311/277 (removed -34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 146 ms. Remains : 84/110 places, 311/277 transitions.
Incomplete random walk after 10000 steps, including 928 resets, run finished after 346 ms. (steps per millisecond=28 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10000 steps, including 176 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 159 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 178 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 138 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 178 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 161 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 174 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 311 rows 84 cols
[2024-06-02 21:05:48] [INFO ] Computed 21 invariants in 3 ms
[2024-06-02 21:05:48] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-06-02 21:05:48] [INFO ] [Real]Absence check using 13 positive and 8 generalized place invariants in 4 ms returned sat
[2024-06-02 21:05:48] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-06-02 21:05:48] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-06-02 21:05:48] [INFO ] [Nat]Absence check using 13 positive and 8 generalized place invariants in 3 ms returned sat
[2024-06-02 21:05:48] [INFO ] After 226ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-06-02 21:05:48] [INFO ] State equation strengthened by 155 read => feed constraints.
[2024-06-02 21:05:49] [INFO ] After 178ms SMT Verify possible using 155 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2024-06-02 21:05:49] [INFO ] After 364ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 124 ms.
[2024-06-02 21:05:49] [INFO ] After 820ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 2 properties in 80 ms.
Support contains 13 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 311/311 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 83 transition count 310
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 83 transition count 310
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 83 transition count 308
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 81 transition count 308
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 81 transition count 330
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 10 place count 79 transition count 330
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 79 transition count 330
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 78 transition count 319
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 78 transition count 319
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 77 transition count 315
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 77 transition count 315
Applied a total of 15 rules in 54 ms. Remains 77 /84 variables (removed 7) and now considering 315/311 (removed -4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 77/84 places, 315/311 transitions.
Incomplete random walk after 10000 steps, including 1033 resets, run finished after 247 ms. (steps per millisecond=40 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 207 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 160 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 213 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 189 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 204 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 589111 steps, run timeout after 3001 ms. (steps per millisecond=196 ) properties seen :{3=1, 4=1}
Probabilistic random walk after 589111 steps, saw 117600 distinct states, run finished after 3002 ms. (steps per millisecond=196 ) properties seen :2
Running SMT prover for 3 properties.
// Phase 1: matrix 315 rows 77 cols
[2024-06-02 21:05:52] [INFO ] Computed 21 invariants in 9 ms
[2024-06-02 21:05:53] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-02 21:05:53] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-06-02 21:05:53] [INFO ] [Nat]Absence check using 13 positive and 8 generalized place invariants in 3 ms returned sat
[2024-06-02 21:05:53] [INFO ] After 167ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-02 21:05:53] [INFO ] State equation strengthened by 161 read => feed constraints.
[2024-06-02 21:05:53] [INFO ] After 107ms SMT Verify possible using 161 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-06-02 21:05:53] [INFO ] After 233ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 110 ms.
[2024-06-02 21:05:53] [INFO ] After 586ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 7 ms.
Support contains 10 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 315/315 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 76 transition count 299
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 76 transition count 299
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 0 with 2 rules applied. Total rules applied 4 place count 75 transition count 298
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 75 transition count 297
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 74 transition count 297
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 73 transition count 285
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 73 transition count 285
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 73 transition count 341
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 12 place count 71 transition count 341
Applied a total of 12 rules in 45 ms. Remains 71 /77 variables (removed 6) and now considering 341/315 (removed -26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 71/77 places, 341/315 transitions.
Incomplete random walk after 10000 steps, including 1228 resets, run finished after 338 ms. (steps per millisecond=29 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 254 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 133 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 268 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-06-02 21:05:54] [INFO ] Flow matrix only has 329 transitions (discarded 12 similar events)
// Phase 1: matrix 329 rows 71 cols
[2024-06-02 21:05:54] [INFO ] Computed 21 invariants in 5 ms
[2024-06-02 21:05:54] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 21:05:54] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-06-02 21:05:54] [INFO ] [Nat]Absence check using 13 positive and 8 generalized place invariants in 2 ms returned sat
[2024-06-02 21:05:54] [INFO ] After 131ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-02 21:05:54] [INFO ] State equation strengthened by 179 read => feed constraints.
[2024-06-02 21:05:54] [INFO ] After 112ms SMT Verify possible using 179 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-06-02 21:05:54] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 0 ms to minimize.
[2024-06-02 21:05:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2024-06-02 21:05:54] [INFO ] After 237ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 48 ms.
[2024-06-02 21:05:54] [INFO ] After 471ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 21 ms.
Support contains 6 out of 71 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 341/341 transitions.
Applied a total of 0 rules in 12 ms. Remains 71 /71 variables (removed 0) and now considering 341/341 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 71/71 places, 341/341 transitions.
Incomplete random walk after 10000 steps, including 1218 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 241 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 253 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Finished probabilistic random walk after 182009 steps, run visited all 2 properties in 745 ms. (steps per millisecond=244 )
Probabilistic random walk after 182009 steps, saw 41506 distinct states, run finished after 751 ms. (steps per millisecond=242 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
FORMULA MedleyA-PT-11-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA MedleyA-PT-11-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 7 atomic propositions for a total of 10 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-11-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 17 stabilizing places and 111 stable transitions
Graph (complete) has 719 edges and 110 vertex of which 109 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
FORMULA MedleyA-PT-11-LTLFireability-12 FALSE 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' '!(X(X(X(X(G(p0))))))'
Support contains 3 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 277/277 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 107 transition count 277
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 13 place count 97 transition count 245
Iterating global reduction 1 with 10 rules applied. Total rules applied 23 place count 97 transition count 245
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 26 place count 94 transition count 228
Iterating global reduction 1 with 3 rules applied. Total rules applied 29 place count 94 transition count 228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 93 transition count 224
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 93 transition count 224
Applied a total of 31 rules in 9 ms. Remains 93 /110 variables (removed 17) and now considering 224/277 (removed 53) transitions.
// Phase 1: matrix 224 rows 93 cols
[2024-06-02 21:05:56] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 21:05:56] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-02 21:05:56] [INFO ] Invariant cache hit.
[2024-06-02 21:05:56] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-06-02 21:05:56] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
[2024-06-02 21:05:56] [INFO ] Invariant cache hit.
[2024-06-02 21:05:56] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 93/110 places, 224/277 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 508 ms. Remains : 93/110 places, 224/277 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 441 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-11-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(AND (EQ s27 1) (EQ s31 1) (EQ s49 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 2 ms.
FORMULA MedleyA-PT-11-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-11-LTLFireability-00 finished in 1045 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((X(p0) U (false U p1))))&&F(p0)))'
Support contains 5 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 277/277 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 107 transition count 277
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 13 place count 97 transition count 244
Iterating global reduction 1 with 10 rules applied. Total rules applied 23 place count 97 transition count 244
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 27 place count 93 transition count 223
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 93 transition count 223
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 92 transition count 219
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 92 transition count 219
Applied a total of 33 rules in 9 ms. Remains 92 /110 variables (removed 18) and now considering 219/277 (removed 58) transitions.
// Phase 1: matrix 219 rows 92 cols
[2024-06-02 21:05:57] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 21:05:57] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-02 21:05:57] [INFO ] Invariant cache hit.
[2024-06-02 21:05:57] [INFO ] State equation strengthened by 106 read => feed constraints.
[2024-06-02 21:05:57] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2024-06-02 21:05:57] [INFO ] Invariant cache hit.
[2024-06-02 21:05:57] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 92/110 places, 219/277 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 488 ms. Remains : 92/110 places, 219/277 transitions.
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : MedleyA-PT-11-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s73 1), p1:(AND (EQ s27 1) (EQ s42 1) (EQ s52 1) (EQ s75 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 11 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-11-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-11-LTLFireability-02 finished in 705 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(p1))))'
Support contains 2 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 277/277 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 107 transition count 277
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 14 place count 96 transition count 240
Iterating global reduction 1 with 11 rules applied. Total rules applied 25 place count 96 transition count 240
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 92 transition count 219
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 92 transition count 219
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 91 transition count 215
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 91 transition count 215
Applied a total of 35 rules in 6 ms. Remains 91 /110 variables (removed 19) and now considering 215/277 (removed 62) transitions.
// Phase 1: matrix 215 rows 91 cols
[2024-06-02 21:05:57] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 21:05:57] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-02 21:05:57] [INFO ] Invariant cache hit.
[2024-06-02 21:05:58] [INFO ] State equation strengthened by 105 read => feed constraints.
[2024-06-02 21:05:58] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
[2024-06-02 21:05:58] [INFO ] Invariant cache hit.
[2024-06-02 21:05:58] [INFO ] Dead Transitions using invariants and state equation in 170 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 91/110 places, 215/277 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 499 ms. Remains : 91/110 places, 215/277 transitions.
Stuttering acceptance computed with spot in 89 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : MedleyA-PT-11-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s36 1), p1:(EQ s64 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-11-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-11-LTLFireability-05 finished in 604 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))&&F(p1)))))'
Support contains 3 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 277/277 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 107 transition count 277
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 13 place count 97 transition count 245
Iterating global reduction 1 with 10 rules applied. Total rules applied 23 place count 97 transition count 245
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 26 place count 94 transition count 228
Iterating global reduction 1 with 3 rules applied. Total rules applied 29 place count 94 transition count 228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 93 transition count 224
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 93 transition count 224
Applied a total of 31 rules in 6 ms. Remains 93 /110 variables (removed 17) and now considering 224/277 (removed 53) transitions.
// Phase 1: matrix 224 rows 93 cols
[2024-06-02 21:05:58] [INFO ] Computed 20 invariants in 1 ms
[2024-06-02 21:05:58] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-06-02 21:05:58] [INFO ] Invariant cache hit.
[2024-06-02 21:05:58] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-06-02 21:05:58] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
[2024-06-02 21:05:58] [INFO ] Invariant cache hit.
[2024-06-02 21:05:58] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 93/110 places, 224/277 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 508 ms. Remains : 93/110 places, 224/277 transitions.
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-11-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s27 1) (EQ s31 1) (EQ s49 1)), p0:(OR (EQ s27 0) (EQ s31 0) (EQ s49 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-11-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-11-LTLFireability-06 finished in 756 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 110 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 110/110 places, 277/277 transitions.
Graph (complete) has 719 edges and 110 vertex of which 109 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
Ensure Unique test removed 3 places
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 12 place count 95 transition count 239
Iterating global reduction 0 with 11 rules applied. Total rules applied 23 place count 95 transition count 239
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 27 place count 91 transition count 218
Iterating global reduction 0 with 4 rules applied. Total rules applied 31 place count 91 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 32 place count 90 transition count 214
Iterating global reduction 0 with 1 rules applied. Total rules applied 33 place count 90 transition count 214
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 35 place count 89 transition count 213
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 45 place count 84 transition count 242
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 0 with 20 rules applied. Total rules applied 65 place count 84 transition count 222
Applied a total of 65 rules in 50 ms. Remains 84 /110 variables (removed 26) and now considering 222/277 (removed 55) transitions.
// Phase 1: matrix 222 rows 84 cols
[2024-06-02 21:05:59] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 21:05:59] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-06-02 21:05:59] [INFO ] Invariant cache hit.
[2024-06-02 21:05:59] [INFO ] State equation strengthened by 113 read => feed constraints.
[2024-06-02 21:05:59] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
[2024-06-02 21:05:59] [INFO ] Redundant transitions in 12 ms returned []
[2024-06-02 21:05:59] [INFO ] Invariant cache hit.
[2024-06-02 21:05:59] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/110 places, 222/277 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 686 ms. Remains : 84/110 places, 222/277 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-11-LTLFireability-07 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 s2 1) (EQ s23 1) (EQ s26 1) (EQ s31 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 9 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-11-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-11-LTLFireability-07 finished in 742 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(!p0)) U G(p1)))'
Support contains 6 out of 110 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 110/110 places, 277/277 transitions.
Graph (complete) has 719 edges and 110 vertex of which 109 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
Ensure Unique test removed 3 places
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 11 place count 96 transition count 245
Iterating global reduction 0 with 10 rules applied. Total rules applied 21 place count 96 transition count 245
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 25 place count 92 transition count 224
Iterating global reduction 0 with 4 rules applied. Total rules applied 29 place count 92 transition count 224
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 30 place count 91 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 31 place count 91 transition count 220
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 0 with 2 rules applied. Total rules applied 33 place count 90 transition count 219
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 41 place count 86 transition count 246
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 57 place count 86 transition count 230
Applied a total of 57 rules in 30 ms. Remains 86 /110 variables (removed 24) and now considering 230/277 (removed 47) transitions.
// Phase 1: matrix 230 rows 86 cols
[2024-06-02 21:06:00] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 21:06:00] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-02 21:06:00] [INFO ] Invariant cache hit.
[2024-06-02 21:06:00] [INFO ] State equation strengthened by 115 read => feed constraints.
[2024-06-02 21:06:00] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2024-06-02 21:06:00] [INFO ] Redundant transitions in 14 ms returned []
[2024-06-02 21:06:00] [INFO ] Invariant cache hit.
[2024-06-02 21:06:00] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 86/110 places, 230/277 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 535 ms. Remains : 86/110 places, 230/277 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), p0]
Running random walk in product with property : MedleyA-PT-11-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s25 1) (EQ s48 1) (EQ s73 1) (EQ s76 1)), p0:(AND (EQ s25 1) (EQ s27 1) (EQ s47 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 45 steps with 14 reset in 2 ms.
FORMULA MedleyA-PT-11-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-11-LTLFireability-10 finished in 646 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0) U X(p1))||F(p2))))'
Support contains 6 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 277/277 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 107 transition count 277
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 11 place count 99 transition count 251
Iterating global reduction 1 with 8 rules applied. Total rules applied 19 place count 99 transition count 251
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 23 place count 95 transition count 230
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 95 transition count 230
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 94 transition count 226
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 94 transition count 226
Applied a total of 29 rules in 4 ms. Remains 94 /110 variables (removed 16) and now considering 226/277 (removed 51) transitions.
// Phase 1: matrix 226 rows 94 cols
[2024-06-02 21:06:00] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 21:06:00] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-02 21:06:00] [INFO ] Invariant cache hit.
[2024-06-02 21:06:00] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-06-02 21:06:00] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
[2024-06-02 21:06:00] [INFO ] Invariant cache hit.
[2024-06-02 21:06:01] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 94/110 places, 226/277 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 532 ms. Remains : 94/110 places, 226/277 transitions.
Stuttering acceptance computed with spot in 244 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : MedleyA-PT-11-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s28 1) (EQ s49 1)), p0:(AND (EQ s2 1) (EQ s8 1) (EQ s26 1)), p1:(EQ s76 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 22 steps with 1 reset in 0 ms.
FORMULA MedleyA-PT-11-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-11-LTLFireability-13 finished in 799 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(G(p1)))))'
Support contains 6 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 277/277 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 107 transition count 277
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 14 place count 96 transition count 240
Iterating global reduction 1 with 11 rules applied. Total rules applied 25 place count 96 transition count 240
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 92 transition count 219
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 92 transition count 219
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 91 transition count 215
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 91 transition count 215
Applied a total of 35 rules in 9 ms. Remains 91 /110 variables (removed 19) and now considering 215/277 (removed 62) transitions.
// Phase 1: matrix 215 rows 91 cols
[2024-06-02 21:06:01] [INFO ] Computed 20 invariants in 10 ms
[2024-06-02 21:06:01] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-02 21:06:01] [INFO ] Invariant cache hit.
[2024-06-02 21:06:01] [INFO ] State equation strengthened by 105 read => feed constraints.
[2024-06-02 21:06:01] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
[2024-06-02 21:06:01] [INFO ] Invariant cache hit.
[2024-06-02 21:06:01] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 91/110 places, 215/277 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 455 ms. Remains : 91/110 places, 215/277 transitions.
Stuttering acceptance computed with spot in 262 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-11-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}, { cond=p0, acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={} source=5 dest: 1}], [{ cond=(NOT p0), acceptance={} source=6 dest: 1}, { cond=p0, acceptance={} source=6 dest: 2}]], initial=4, aps=[p1:(OR (EQ s40 0) (EQ s43 0)), p0:(OR (EQ s52 0) (EQ s74 0) (EQ s76 0) (EQ s89 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 7843 reset in 481 ms.
Entered a terminal (fully accepting) state of product in 8495 steps with 673 reset in 41 ms.
FORMULA MedleyA-PT-11-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-11-LTLFireability-14 finished in 1257 ms.
All properties solved by simple procedures.
Total runtime 20248 ms.

BK_STOP 1717362363932

--------------------
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-11"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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