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.r153-tall-171631151600338.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 DoubleExponent-PT-003, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r153-tall-171631151600338
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 12 03:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 200K Apr 12 03:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 03:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 112K Apr 12 03:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 50K May 18 16:42 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 DoubleExponent-PT-003-LTLFireability-00
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-01
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-02
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-03
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-04
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-05
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-06
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-07
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-08
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-09
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-10
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-11
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-12
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-13
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-14
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716422041848

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=DoubleExponent-PT-003
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-22 23:54:03] [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-05-22 23:54:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 23:54:03] [INFO ] Load time of PNML (sax parser for PT used): 38 ms
[2024-05-22 23:54:03] [INFO ] Transformed 163 places.
[2024-05-22 23:54:03] [INFO ] Transformed 148 transitions.
[2024-05-22 23:54:03] [INFO ] Parsed PT model containing 163 places and 148 transitions and 417 arcs in 100 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA DoubleExponent-PT-003-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 148/148 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 159 transition count 148
Applied a total of 4 rules in 21 ms. Remains 159 /163 variables (removed 4) and now considering 148/148 (removed 0) transitions.
// Phase 1: matrix 148 rows 159 cols
[2024-05-22 23:54:03] [INFO ] Computed 16 invariants in 17 ms
[2024-05-22 23:54:03] [INFO ] Implicit Places using invariants in 205 ms returned [26, 28]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 229 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 157/163 places, 148/148 transitions.
Applied a total of 0 rules in 7 ms. Remains 157 /157 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 257 ms. Remains : 157/163 places, 148/148 transitions.
Support contains 31 out of 157 places after structural reductions.
[2024-05-22 23:54:04] [INFO ] Flatten gal took : 33 ms
[2024-05-22 23:54:04] [INFO ] Flatten gal took : 13 ms
[2024-05-22 23:54:04] [INFO ] Input system was already deterministic with 148 transitions.
Incomplete random walk after 10000 steps, including 337 resets, run finished after 536 ms. (steps per millisecond=18 ) properties (out of 20) seen :3
Incomplete Best-First random walk after 1000 steps, including 32 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 27 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 37 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 27 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 26 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 28 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
// Phase 1: matrix 148 rows 157 cols
[2024-05-22 23:54:05] [INFO ] Computed 14 invariants in 4 ms
[2024-05-22 23:54:05] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 23:54:05] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 3 ms returned sat
[2024-05-22 23:54:05] [INFO ] After 209ms SMT Verify possible using state equation in real domain returned unsat :3 sat :11 real:3
[2024-05-22 23:54:05] [INFO ] Deduced a trap composed of 37 places in 138 ms of which 5 ms to minimize.
[2024-05-22 23:54:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 160 ms
[2024-05-22 23:54:05] [INFO ] After 588ms SMT Verify possible using trap constraints in real domain returned unsat :3 sat :0 real:14
[2024-05-22 23:54:05] [INFO ] After 759ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:14
[2024-05-22 23:54:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 23:54:06] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 3 ms returned sat
[2024-05-22 23:54:06] [INFO ] After 187ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :14
[2024-05-22 23:54:06] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 1 ms to minimize.
[2024-05-22 23:54:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2024-05-22 23:54:06] [INFO ] Deduced a trap composed of 43 places in 33 ms of which 1 ms to minimize.
[2024-05-22 23:54:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2024-05-22 23:54:06] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 3 ms to minimize.
[2024-05-22 23:54:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2024-05-22 23:54:06] [INFO ] After 580ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :14
Attempting to minimize the solution found.
Minimization took 136 ms.
[2024-05-22 23:54:06] [INFO ] After 845ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :14
Fused 17 Parikh solutions to 14 different solutions.
Parikh walk visited 0 properties in 360 ms.
Support contains 23 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 148/148 transitions.
Graph (complete) has 259 edges and 157 vertex of which 156 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
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 156 transition count 128
Reduce places removed 19 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 25 rules applied. Total rules applied 45 place count 137 transition count 122
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 51 place count 131 transition count 122
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 51 place count 131 transition count 117
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 61 place count 126 transition count 117
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 103 place count 105 transition count 96
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 111 place count 101 transition count 96
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 112 place count 101 transition count 95
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 113 place count 100 transition count 95
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 4 with 10 rules applied. Total rules applied 123 place count 100 transition count 85
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 133 place count 90 transition count 85
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 142 place count 90 transition count 85
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 143 place count 89 transition count 84
Applied a total of 143 rules in 57 ms. Remains 89 /157 variables (removed 68) and now considering 84/148 (removed 64) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 89/157 places, 84/148 transitions.
Incomplete random walk after 10000 steps, including 922 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 14) seen :6
Incomplete Best-First random walk after 10001 steps, including 694 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 689 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 688 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 680 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 691 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 679 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 671 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 695 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 84 rows 89 cols
[2024-05-22 23:54:08] [INFO ] Computed 14 invariants in 8 ms
[2024-05-22 23:54:08] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 23:54:08] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 4 ms returned sat
[2024-05-22 23:54:08] [INFO ] After 74ms SMT Verify possible using state equation in real domain returned unsat :0 sat :6 real:2
[2024-05-22 23:54:08] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-22 23:54:08] [INFO ] After 36ms SMT Verify possible using 5 Read/Feed constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-22 23:54:08] [INFO ] After 175ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-22 23:54:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 23:54:08] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 3 ms returned sat
[2024-05-22 23:54:08] [INFO ] After 63ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-22 23:54:08] [INFO ] After 53ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2024-05-22 23:54:08] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-22 23:54:08] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-05-22 23:54:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 84 ms
[2024-05-22 23:54:08] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-22 23:54:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2024-05-22 23:54:09] [INFO ] After 248ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 48 ms.
[2024-05-22 23:54:09] [INFO ] After 434ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 138 ms.
Support contains 14 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 84/84 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 89 transition count 83
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 2 place count 88 transition count 83
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
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 12 place count 83 transition count 78
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 14 place count 82 transition count 78
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 17 place count 82 transition count 75
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 20 place count 79 transition count 75
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 79 transition count 75
Applied a total of 21 rules in 15 ms. Remains 79 /89 variables (removed 10) and now considering 75/84 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 79/89 places, 75/84 transitions.
Incomplete random walk after 10000 steps, including 947 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 686 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 686 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 672 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 688 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 699 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 665 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 696 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 684 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 1389414 steps, run timeout after 3001 ms. (steps per millisecond=462 ) properties seen :{0=1, 1=1, 2=1, 3=1, 4=1, 6=1, 7=1}
Probabilistic random walk after 1389414 steps, saw 694736 distinct states, run finished after 3002 ms. (steps per millisecond=462 ) properties seen :7
Running SMT prover for 1 properties.
// Phase 1: matrix 75 rows 79 cols
[2024-05-22 23:54:13] [INFO ] Computed 14 invariants in 4 ms
[2024-05-22 23:54:13] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 23:54:13] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 3 ms returned sat
[2024-05-22 23:54:13] [INFO ] After 22ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-22 23:54:13] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-22 23:54:13] [INFO ] After 6ms SMT Verify possible using 8 Read/Feed constraints in real domain returned unsat :0 sat :1
[2024-05-22 23:54:13] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-22 23:54:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2024-05-22 23:54:13] [INFO ] After 56ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 23:54:13] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 23:54:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 23:54:13] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 2 ms returned sat
[2024-05-22 23:54:13] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 23:54:13] [INFO ] After 6ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 23:54:13] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-05-22 23:54:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2024-05-22 23:54:13] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-22 23:54:13] [INFO ] After 118ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 75/75 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 79 transition count 71
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 75 transition count 71
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 71 transition count 67
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 18 place count 70 transition count 67
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 70 transition count 65
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 22 place count 68 transition count 65
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 25 place count 68 transition count 65
Applied a total of 25 rules in 28 ms. Remains 68 /79 variables (removed 11) and now considering 65/75 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 68/79 places, 65/75 transitions.
Incomplete random walk after 10000 steps, including 1369 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 872 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1559483 steps, run timeout after 3001 ms. (steps per millisecond=519 ) properties seen :{}
Probabilistic random walk after 1559483 steps, saw 779799 distinct states, run finished after 3001 ms. (steps per millisecond=519 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 65 rows 68 cols
[2024-05-22 23:54:16] [INFO ] Computed 14 invariants in 6 ms
[2024-05-22 23:54:16] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 23:54:16] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 7 ms returned sat
[2024-05-22 23:54:16] [INFO ] After 27ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-22 23:54:16] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 23:54:16] [INFO ] After 20ms SMT Verify possible using 14 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 23:54:16] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 23:54:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 10 ms returned sat
[2024-05-22 23:54:16] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 2 ms returned sat
[2024-05-22 23:54:16] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 23:54:16] [INFO ] After 16ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 23:54:16] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-22 23:54:16] [INFO ] After 93ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 65/65 transitions.
Applied a total of 0 rules in 3 ms. Remains 68 /68 variables (removed 0) and now considering 65/65 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 68/68 places, 65/65 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 65/65 transitions.
Applied a total of 0 rules in 2 ms. Remains 68 /68 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2024-05-22 23:54:16] [INFO ] Invariant cache hit.
[2024-05-22 23:54:16] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-22 23:54:16] [INFO ] Invariant cache hit.
[2024-05-22 23:54:16] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 23:54:16] [INFO ] Implicit Places using invariants and state equation in 134 ms returned [36, 41, 59, 65]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 183 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 64/68 places, 65/65 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 64 transition count 63
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 62 transition count 63
Applied a total of 4 rules in 7 ms. Remains 62 /64 variables (removed 2) and now considering 63/65 (removed 2) transitions.
// Phase 1: matrix 63 rows 62 cols
[2024-05-22 23:54:16] [INFO ] Computed 10 invariants in 1 ms
[2024-05-22 23:54:17] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-22 23:54:17] [INFO ] Invariant cache hit.
[2024-05-22 23:54:17] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 23:54:17] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 62/68 places, 63/65 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 352 ms. Remains : 62/68 places, 63/65 transitions.
Incomplete random walk after 10000 steps, including 1547 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 981 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1450769 steps, run visited all 1 properties in 2513 ms. (steps per millisecond=577 )
Probabilistic random walk after 1450769 steps, saw 725431 distinct states, run finished after 2516 ms. (steps per millisecond=576 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 3 atomic propositions for a total of 11 simplifications.
FORMULA DoubleExponent-PT-003-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 259 edges and 157 vertex of which 155 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&F(G(p1)))))'
Support contains 3 out of 157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 157/157 places, 148/148 transitions.
Graph (complete) has 259 edges and 157 vertex of which 156 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 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 155 transition count 110
Reduce places removed 36 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 37 rules applied. Total rules applied 74 place count 119 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 75 place count 118 transition count 109
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 75 place count 118 transition count 104
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 85 place count 113 transition count 104
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 145 place count 83 transition count 74
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 153 place count 79 transition count 74
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 154 place count 78 transition count 73
Applied a total of 154 rules in 16 ms. Remains 78 /157 variables (removed 79) and now considering 73/148 (removed 75) transitions.
// Phase 1: matrix 73 rows 78 cols
[2024-05-22 23:54:19] [INFO ] Computed 14 invariants in 1 ms
[2024-05-22 23:54:20] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-22 23:54:20] [INFO ] Invariant cache hit.
[2024-05-22 23:54:20] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-22 23:54:20] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2024-05-22 23:54:20] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 23:54:20] [INFO ] Invariant cache hit.
[2024-05-22 23:54:20] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 78/157 places, 73/148 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 226 ms. Remains : 78/157 places, 73/148 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 184 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s59 1), p1:(OR (LT s34 1) (LT s46 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 2 ms.
FORMULA DoubleExponent-PT-003-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLFireability-00 finished in 474 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 148/148 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 156 transition count 147
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 156 transition count 147
Applied a total of 2 rules in 11 ms. Remains 156 /157 variables (removed 1) and now considering 147/148 (removed 1) transitions.
// Phase 1: matrix 147 rows 156 cols
[2024-05-22 23:54:20] [INFO ] Computed 14 invariants in 2 ms
[2024-05-22 23:54:20] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-22 23:54:20] [INFO ] Invariant cache hit.
[2024-05-22 23:54:20] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
[2024-05-22 23:54:20] [INFO ] Invariant cache hit.
[2024-05-22 23:54:20] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 156/157 places, 147/148 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 345 ms. Remains : 156/157 places, 147/148 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s54 1) (GEQ s108 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 2 ms.
FORMULA DoubleExponent-PT-003-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLFireability-01 finished in 439 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 157/157 places, 148/148 transitions.
Graph (complete) has 259 edges and 157 vertex of which 156 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 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 155 transition count 108
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 77 place count 117 transition count 108
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 77 place count 117 transition count 103
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 87 place count 112 transition count 103
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 147 place count 82 transition count 73
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 155 place count 78 transition count 73
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 156 place count 77 transition count 72
Applied a total of 156 rules in 17 ms. Remains 77 /157 variables (removed 80) and now considering 72/148 (removed 76) transitions.
// Phase 1: matrix 72 rows 77 cols
[2024-05-22 23:54:20] [INFO ] Computed 14 invariants in 1 ms
[2024-05-22 23:54:20] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-22 23:54:20] [INFO ] Invariant cache hit.
[2024-05-22 23:54:20] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-22 23:54:20] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2024-05-22 23:54:21] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 23:54:21] [INFO ] Invariant cache hit.
[2024-05-22 23:54:21] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 77/157 places, 72/148 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 228 ms. Remains : 77/157 places, 72/148 transitions.
Stuttering acceptance computed with spot in 59 ms :[p0, p0]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s58 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 13935 reset in 158 ms.
Product exploration explored 100000 steps with 13939 reset in 130 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 227 edges and 77 vertex of which 76 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT 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 66 ms :[p0, p0]
Incomplete random walk after 10000 steps, including 1418 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 820 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 116 steps, run visited all 1 properties in 3 ms. (steps per millisecond=38 )
Probabilistic random walk after 116 steps, saw 63 distinct states, run finished after 3 ms. (steps per millisecond=38 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 98 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 71 ms :[p0, p0]
Stuttering acceptance computed with spot in 82 ms :[p0, p0]
Support contains 1 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 72/72 transitions.
Applied a total of 0 rules in 7 ms. Remains 77 /77 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2024-05-22 23:54:21] [INFO ] Invariant cache hit.
[2024-05-22 23:54:21] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-22 23:54:21] [INFO ] Invariant cache hit.
[2024-05-22 23:54:21] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-22 23:54:22] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2024-05-22 23:54:22] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 23:54:22] [INFO ] Invariant cache hit.
[2024-05-22 23:54:22] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 220 ms. Remains : 77/77 places, 72/72 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 227 edges and 77 vertex of which 76 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 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 81 ms :[p0, p0]
Incomplete random walk after 10000 steps, including 1358 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 814 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 116 steps, run visited all 1 properties in 3 ms. (steps per millisecond=38 )
Probabilistic random walk after 116 steps, saw 63 distinct states, run finished after 4 ms. (steps per millisecond=29 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 122 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 :[p0, p0]
Stuttering acceptance computed with spot in 61 ms :[p0, p0]
Stuttering acceptance computed with spot in 63 ms :[p0, p0]
Product exploration explored 100000 steps with 13936 reset in 73 ms.
Product exploration explored 100000 steps with 13793 reset in 98 ms.
Built C files in :
/tmp/ltsmin12266949563744112284
[2024-05-22 23:54:22] [INFO ] Computing symmetric may disable matrix : 72 transitions.
[2024-05-22 23:54:22] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:54:22] [INFO ] Computing symmetric may enable matrix : 72 transitions.
[2024-05-22 23:54:22] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:54:22] [INFO ] Computing Do-Not-Accords matrix : 72 transitions.
[2024-05-22 23:54:22] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:54:22] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12266949563744112284
Running compilation step : cd /tmp/ltsmin12266949563744112284;'/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 263 ms.
Running link step : cd /tmp/ltsmin12266949563744112284;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin12266949563744112284;'/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/stateBased8454609868521893712.hoa' '--buchi-type=spotba'
LTSmin run took 3646 ms.
FORMULA DoubleExponent-PT-003-LTLFireability-02 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DoubleExponent-PT-003-LTLFireability-02 finished in 6083 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U p1)))'
Support contains 3 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 148/148 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 156 transition count 147
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 156 transition count 147
Applied a total of 2 rules in 12 ms. Remains 156 /157 variables (removed 1) and now considering 147/148 (removed 1) transitions.
// Phase 1: matrix 147 rows 156 cols
[2024-05-22 23:54:26] [INFO ] Computed 14 invariants in 4 ms
[2024-05-22 23:54:26] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-22 23:54:26] [INFO ] Invariant cache hit.
[2024-05-22 23:54:27] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2024-05-22 23:54:27] [INFO ] Invariant cache hit.
[2024-05-22 23:54:27] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 156/157 places, 147/148 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 330 ms. Remains : 156/157 places, 147/148 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s3 1) (GEQ s114 1)), p0:(GEQ s62 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-003-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLFireability-04 finished in 491 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F((G(p0)||G(!p0))) U p1))))'
Support contains 2 out of 157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 157/157 places, 148/148 transitions.
Graph (complete) has 259 edges and 157 vertex of which 156 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 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 155 transition count 108
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 77 place count 117 transition count 108
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 77 place count 117 transition count 103
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 87 place count 112 transition count 103
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 145 place count 83 transition count 74
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 153 place count 79 transition count 74
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 154 place count 78 transition count 73
Applied a total of 154 rules in 20 ms. Remains 78 /157 variables (removed 79) and now considering 73/148 (removed 75) transitions.
// Phase 1: matrix 73 rows 78 cols
[2024-05-22 23:54:27] [INFO ] Computed 14 invariants in 5 ms
[2024-05-22 23:54:27] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-22 23:54:27] [INFO ] Invariant cache hit.
[2024-05-22 23:54:27] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-22 23:54:27] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
[2024-05-22 23:54:27] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 23:54:27] [INFO ] Invariant cache hit.
[2024-05-22 23:54:27] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 78/157 places, 73/148 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 233 ms. Remains : 78/157 places, 73/148 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), false, (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 2} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={1, 2} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0, 1, 2} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s32 1), p0:(GEQ s60 1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 3354 steps with 323 reset in 14 ms.
FORMULA DoubleExponent-PT-003-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLFireability-07 finished in 376 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) U p1))'
Support contains 3 out of 157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 157/157 places, 148/148 transitions.
Graph (complete) has 259 edges and 157 vertex of which 156 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 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 155 transition count 108
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 77 place count 117 transition count 108
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 77 place count 117 transition count 104
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 85 place count 113 transition count 104
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 145 place count 83 transition count 74
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
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 151 place count 80 transition count 74
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 152 place count 80 transition count 74
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 153 place count 79 transition count 73
Applied a total of 153 rules in 22 ms. Remains 79 /157 variables (removed 78) and now considering 73/148 (removed 75) transitions.
// Phase 1: matrix 73 rows 79 cols
[2024-05-22 23:54:27] [INFO ] Computed 14 invariants in 2 ms
[2024-05-22 23:54:27] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-22 23:54:27] [INFO ] Invariant cache hit.
[2024-05-22 23:54:27] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-22 23:54:27] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2024-05-22 23:54:27] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 23:54:27] [INFO ] Invariant cache hit.
[2024-05-22 23:54:28] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 79/157 places, 73/148 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 231 ms. Remains : 79/157 places, 73/148 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), true, (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s47 1) (GEQ s52 1)), p0:(LT s41 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 24 steps with 1 reset in 0 ms.
FORMULA DoubleExponent-PT-003-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLFireability-09 finished in 335 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(p1)&&p0)))'
Support contains 3 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 148/148 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 156 transition count 147
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 156 transition count 147
Applied a total of 2 rules in 3 ms. Remains 156 /157 variables (removed 1) and now considering 147/148 (removed 1) transitions.
// Phase 1: matrix 147 rows 156 cols
[2024-05-22 23:54:28] [INFO ] Computed 14 invariants in 3 ms
[2024-05-22 23:54:28] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-22 23:54:28] [INFO ] Invariant cache hit.
[2024-05-22 23:54:28] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2024-05-22 23:54:28] [INFO ] Invariant cache hit.
[2024-05-22 23:54:28] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 156/157 places, 147/148 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 295 ms. Remains : 156/157 places, 147/148 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(GEQ s147 1), p0:(AND (GEQ s14 1) (GEQ s46 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-003-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLFireability-11 finished in 432 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&&G(p1)) U p2)&&X(X(G(!p2)))))'
Support contains 3 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 148/148 transitions.
Applied a total of 0 rules in 3 ms. Remains 157 /157 variables (removed 0) and now considering 148/148 (removed 0) transitions.
// Phase 1: matrix 148 rows 157 cols
[2024-05-22 23:54:28] [INFO ] Computed 14 invariants in 1 ms
[2024-05-22 23:54:28] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-22 23:54:28] [INFO ] Invariant cache hit.
[2024-05-22 23:54:28] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2024-05-22 23:54:28] [INFO ] Invariant cache hit.
[2024-05-22 23:54:28] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 286 ms. Remains : 157/157 places, 148/148 transitions.
Stuttering acceptance computed with spot in 213 ms :[p2, true, true, (OR (NOT p1) p2), p2, true]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 4}], [{ cond=p2, acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))), acceptance={} source=1 dest: 5}], [{ cond=(AND p2 p1), acceptance={} source=2 dest: 3}, { cond=(OR (NOT p2) (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}, { cond=(OR p2 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}, { cond=p2, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=1, aps=[p2:(LT s122 1), p0:(GEQ s4 1), p1:(GEQ s127 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-003-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLFireability-13 finished in 515 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 148/148 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 156 transition count 147
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 156 transition count 147
Applied a total of 2 rules in 6 ms. Remains 156 /157 variables (removed 1) and now considering 147/148 (removed 1) transitions.
// Phase 1: matrix 147 rows 156 cols
[2024-05-22 23:54:29] [INFO ] Computed 14 invariants in 2 ms
[2024-05-22 23:54:29] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-22 23:54:29] [INFO ] Invariant cache hit.
[2024-05-22 23:54:29] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2024-05-22 23:54:29] [INFO ] Invariant cache hit.
[2024-05-22 23:54:29] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 156/157 places, 147/148 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 309 ms. Remains : 156/157 places, 147/148 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(OR (LT s51 1) (LT s65 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 25000 reset in 156 ms.
Product exploration explored 100000 steps with 25000 reset in 156 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 258 edges and 156 vertex of which 154 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 75 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 327 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 283 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Probably explored full state space saw : 413268 states, properties seen :0
Probabilistic random walk after 826575 steps, saw 413268 distinct states, run finished after 2188 ms. (steps per millisecond=377 ) properties seen :0
Interrupted probabilistic random walk after 1116737 steps, run timeout after 3001 ms. (steps per millisecond=372 ) properties seen :{}
Exhaustive walk after 1116737 steps, saw 558443 distinct states, run finished after 3001 ms. (steps per millisecond=372 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 23:54:35] [INFO ] Invariant cache hit.
[2024-05-22 23:54:35] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 23:54:35] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 5 ms returned sat
[2024-05-22 23:54:35] [INFO ] After 52ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-22 23:54:35] [INFO ] After 69ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-22 23:54:35] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 147/147 transitions.
Graph (complete) has 258 edges and 156 vertex of which 155 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 155 transition count 109
Reduce places removed 37 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 38 rules applied. Total rules applied 76 place count 118 transition count 108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 77 place count 117 transition count 108
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 77 place count 117 transition count 102
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 89 place count 111 transition count 102
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 149 place count 81 transition count 72
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 157 place count 77 transition count 72
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 164 place count 77 transition count 65
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 171 place count 70 transition count 65
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 183 place count 70 transition count 65
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 184 place count 69 transition count 64
Applied a total of 184 rules in 19 ms. Remains 69 /156 variables (removed 87) and now considering 64/147 (removed 83) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 69/156 places, 64/147 transitions.
Incomplete random walk after 10000 steps, including 1291 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 878 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Probably explored full state space saw : 584830 states, properties seen :0
Probabilistic random walk after 1169680 steps, saw 584830 distinct states, run finished after 2543 ms. (steps per millisecond=459 ) properties seen :0
Interrupted probabilistic random walk after 1562984 steps, run timeout after 3001 ms. (steps per millisecond=520 ) properties seen :{}
Exhaustive walk after 1562984 steps, saw 781588 distinct states, run finished after 3001 ms. (steps per millisecond=520 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 64 rows 69 cols
[2024-05-22 23:54:41] [INFO ] Computed 14 invariants in 2 ms
[2024-05-22 23:54:41] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 23:54:41] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 3 ms returned sat
[2024-05-22 23:54:41] [INFO ] After 19ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-22 23:54:41] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-22 23:54:41] [INFO ] After 12ms SMT Verify possible using 10 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 23:54:41] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 23:54:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-22 23:54:41] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 2 ms returned sat
[2024-05-22 23:54:41] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 23:54:41] [INFO ] After 7ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 23:54:41] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-22 23:54:41] [INFO ] After 60ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 69 /69 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 69/69 places, 64/64 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 69 /69 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-22 23:54:41] [INFO ] Invariant cache hit.
[2024-05-22 23:54:41] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-22 23:54:41] [INFO ] Invariant cache hit.
[2024-05-22 23:54:41] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-22 23:54:41] [INFO ] Implicit Places using invariants and state equation in 123 ms returned [37, 42, 60, 66]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 187 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 65/69 places, 64/64 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 65 transition count 62
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 63 transition count 62
Applied a total of 4 rules in 4 ms. Remains 63 /65 variables (removed 2) and now considering 62/64 (removed 2) transitions.
// Phase 1: matrix 62 rows 63 cols
[2024-05-22 23:54:41] [INFO ] Computed 10 invariants in 0 ms
[2024-05-22 23:54:41] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-22 23:54:41] [INFO ] Invariant cache hit.
[2024-05-22 23:54:41] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-22 23:54:41] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 63/69 places, 62/64 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 341 ms. Remains : 63/69 places, 62/64 transitions.
Incomplete random walk after 10000 steps, including 1445 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 897 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1449432 steps, run visited all 1 properties in 2873 ms. (steps per millisecond=504 )
Probabilistic random walk after 1449432 steps, saw 724763 distinct states, run finished after 2873 ms. (steps per millisecond=504 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 105 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 147/147 transitions.
Applied a total of 0 rules in 3 ms. Remains 156 /156 variables (removed 0) and now considering 147/147 (removed 0) transitions.
// Phase 1: matrix 147 rows 156 cols
[2024-05-22 23:54:44] [INFO ] Computed 14 invariants in 2 ms
[2024-05-22 23:54:44] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-22 23:54:44] [INFO ] Invariant cache hit.
[2024-05-22 23:54:45] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2024-05-22 23:54:45] [INFO ] Invariant cache hit.
[2024-05-22 23:54:45] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 299 ms. Remains : 156/156 places, 147/147 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 258 edges and 156 vertex of which 154 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 68 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 326 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 277 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Probably explored full state space saw : 413268 states, properties seen :0
Probabilistic random walk after 826575 steps, saw 413268 distinct states, run finished after 2086 ms. (steps per millisecond=396 ) properties seen :0
Interrupted probabilistic random walk after 1266870 steps, run timeout after 3001 ms. (steps per millisecond=422 ) properties seen :{}
Exhaustive walk after 1266870 steps, saw 633464 distinct states, run finished after 3001 ms. (steps per millisecond=422 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 23:54:50] [INFO ] Invariant cache hit.
[2024-05-22 23:54:50] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 23:54:50] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 4 ms returned sat
[2024-05-22 23:54:50] [INFO ] After 61ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-22 23:54:50] [INFO ] After 75ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-22 23:54:50] [INFO ] After 131ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 147/147 transitions.
Graph (complete) has 258 edges and 156 vertex of which 155 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 155 transition count 109
Reduce places removed 37 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 38 rules applied. Total rules applied 76 place count 118 transition count 108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 77 place count 117 transition count 108
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 77 place count 117 transition count 102
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 89 place count 111 transition count 102
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 149 place count 81 transition count 72
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 157 place count 77 transition count 72
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 164 place count 77 transition count 65
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 171 place count 70 transition count 65
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 183 place count 70 transition count 65
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 184 place count 69 transition count 64
Applied a total of 184 rules in 16 ms. Remains 69 /156 variables (removed 87) and now considering 64/147 (removed 83) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 69/156 places, 64/147 transitions.
Incomplete random walk after 10000 steps, including 1274 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 828 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Probably explored full state space saw : 584830 states, properties seen :0
Probabilistic random walk after 1169680 steps, saw 584830 distinct states, run finished after 2547 ms. (steps per millisecond=459 ) properties seen :0
Interrupted probabilistic random walk after 1544041 steps, run timeout after 3001 ms. (steps per millisecond=514 ) properties seen :{}
Exhaustive walk after 1544041 steps, saw 772100 distinct states, run finished after 3001 ms. (steps per millisecond=514 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 64 rows 69 cols
[2024-05-22 23:54:56] [INFO ] Computed 14 invariants in 2 ms
[2024-05-22 23:54:56] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 23:54:56] [INFO ] [Real]Absence check using 2 positive and 12 generalized place invariants in 3 ms returned sat
[2024-05-22 23:54:56] [INFO ] After 20ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-22 23:54:56] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-22 23:54:56] [INFO ] After 7ms SMT Verify possible using 10 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 23:54:56] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 23:54:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-22 23:54:56] [INFO ] [Nat]Absence check using 2 positive and 12 generalized place invariants in 3 ms returned sat
[2024-05-22 23:54:56] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 23:54:56] [INFO ] After 6ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 23:54:56] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-22 23:54:56] [INFO ] After 74ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 69 /69 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 69/69 places, 64/64 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 69 /69 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-22 23:54:56] [INFO ] Invariant cache hit.
[2024-05-22 23:54:56] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-22 23:54:56] [INFO ] Invariant cache hit.
[2024-05-22 23:54:56] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-22 23:54:56] [INFO ] Implicit Places using invariants and state equation in 110 ms returned [37, 42, 60, 66]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 171 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 65/69 places, 64/64 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 65 transition count 62
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 63 transition count 62
Applied a total of 4 rules in 3 ms. Remains 63 /65 variables (removed 2) and now considering 62/64 (removed 2) transitions.
// Phase 1: matrix 62 rows 63 cols
[2024-05-22 23:54:56] [INFO ] Computed 10 invariants in 1 ms
[2024-05-22 23:54:56] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-22 23:54:56] [INFO ] Invariant cache hit.
[2024-05-22 23:54:56] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-22 23:54:56] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 63/69 places, 62/64 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 319 ms. Remains : 63/69 places, 62/64 transitions.
Incomplete random walk after 10000 steps, including 1433 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 915 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1449432 steps, run visited all 1 properties in 2853 ms. (steps per millisecond=508 )
Probabilistic random walk after 1449432 steps, saw 724763 distinct states, run finished after 2853 ms. (steps per millisecond=508 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 125 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 117 ms.
Product exploration explored 100000 steps with 25000 reset in 118 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 147/147 transitions.
Graph (complete) has 258 edges and 156 vertex of which 155 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
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 155 transition count 146
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 36 place count 155 transition count 151
Deduced a syphon composed of 43 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 44 place count 155 transition count 151
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 48 place count 151 transition count 147
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 52 place count 151 transition count 147
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 1 with 29 rules applied. Total rules applied 81 place count 151 transition count 152
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 82 place count 150 transition count 151
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 83 place count 150 transition count 151
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 89 place count 150 transition count 182
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 96 place count 143 transition count 168
Deduced a syphon composed of 66 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 103 place count 143 transition count 168
Deduced a syphon composed of 66 places in 0 ms
Applied a total of 103 rules in 27 ms. Remains 143 /156 variables (removed 13) and now considering 168/147 (removed -21) transitions.
[2024-05-22 23:55:00] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 168 rows 143 cols
[2024-05-22 23:55:00] [INFO ] Computed 14 invariants in 1 ms
[2024-05-22 23:55:00] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 143/156 places, 168/147 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 126 ms. Remains : 143/156 places, 168/147 transitions.
Built C files in :
/tmp/ltsmin16746482057720092336
[2024-05-22 23:55:00] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16746482057720092336
Running compilation step : cd /tmp/ltsmin16746482057720092336;'/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 226 ms.
Running link step : cd /tmp/ltsmin16746482057720092336;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin16746482057720092336;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14876785975924500461.hoa' '--buchi-type=spotba'
LTSmin run took 275 ms.
FORMULA DoubleExponent-PT-003-LTLFireability-14 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DoubleExponent-PT-003-LTLFireability-14 finished in 32225 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 5 out of 157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 157/157 places, 148/148 transitions.
Graph (complete) has 259 edges and 157 vertex of which 156 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 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 155 transition count 116
Reduce places removed 30 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 33 rules applied. Total rules applied 64 place count 125 transition count 113
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 67 place count 122 transition count 113
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 67 place count 122 transition count 108
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 77 place count 117 transition count 108
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 137 place count 87 transition count 78
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 145 place count 83 transition count 78
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 146 place count 82 transition count 77
Applied a total of 146 rules in 11 ms. Remains 82 /157 variables (removed 75) and now considering 77/148 (removed 71) transitions.
// Phase 1: matrix 77 rows 82 cols
[2024-05-22 23:55:01] [INFO ] Computed 14 invariants in 1 ms
[2024-05-22 23:55:01] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-22 23:55:01] [INFO ] Invariant cache hit.
[2024-05-22 23:55:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 23:55:01] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2024-05-22 23:55:01] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 23:55:01] [INFO ] Invariant cache hit.
[2024-05-22 23:55:01] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 82/157 places, 77/148 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 186 ms. Remains : 82/157 places, 77/148 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s33 1) (LT s74 1)), p1:(AND (OR (LT s29 1) (LT s55 1)) (LT s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 11436 reset in 83 ms.
Product exploration explored 100000 steps with 11474 reset in 124 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 229 edges and 82 vertex of which 81 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 81 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 1157 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 731 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 714 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Finished probabilistic random walk after 5718 steps, run visited all 2 properties in 25 ms. (steps per millisecond=228 )
Probabilistic random walk after 5718 steps, saw 2889 distinct states, run finished after 26 ms. (steps per millisecond=219 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 139 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 5 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 77/77 transitions.
Applied a total of 0 rules in 4 ms. Remains 82 /82 variables (removed 0) and now considering 77/77 (removed 0) transitions.
[2024-05-22 23:55:02] [INFO ] Invariant cache hit.
[2024-05-22 23:55:02] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-22 23:55:02] [INFO ] Invariant cache hit.
[2024-05-22 23:55:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 23:55:02] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2024-05-22 23:55:02] [INFO ] Redundant transitions in 12 ms returned []
[2024-05-22 23:55:02] [INFO ] Invariant cache hit.
[2024-05-22 23:55:02] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 222 ms. Remains : 82/82 places, 77/77 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 229 edges and 82 vertex of which 81 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 76 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 1148 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 732 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 718 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Finished probabilistic random walk after 5718 steps, run visited all 2 properties in 26 ms. (steps per millisecond=219 )
Probabilistic random walk after 5718 steps, saw 2889 distinct states, run finished after 27 ms. (steps per millisecond=211 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 172 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 11358 reset in 86 ms.
Product exploration explored 100000 steps with 11478 reset in 89 ms.
Built C files in :
/tmp/ltsmin17799597797459190257
[2024-05-22 23:55:04] [INFO ] Computing symmetric may disable matrix : 77 transitions.
[2024-05-22 23:55:04] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:55:04] [INFO ] Computing symmetric may enable matrix : 77 transitions.
[2024-05-22 23:55:04] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:55:04] [INFO ] Computing Do-Not-Accords matrix : 77 transitions.
[2024-05-22 23:55:04] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:55:04] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17799597797459190257
Running compilation step : cd /tmp/ltsmin17799597797459190257;'/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 180 ms.
Running link step : cd /tmp/ltsmin17799597797459190257;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin17799597797459190257;'/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/stateBased13251867315565954469.hoa' '--buchi-type=spotba'
LTSmin run took 5996 ms.
FORMULA DoubleExponent-PT-003-LTLFireability-15 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DoubleExponent-PT-003-LTLFireability-15 finished in 8952 ms.
All properties solved by simple procedures.
Total runtime 66953 ms.

BK_STOP 1716422111237

--------------------
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="DoubleExponent-PT-003"
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 DoubleExponent-PT-003, 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 r153-tall-171631151600338"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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