Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r393-oct2-167903716700163.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldIIPs-PT-100A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903716700163
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 9.3K Feb 25 16:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 25 16:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 25 15:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K Feb 25 15:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 25 16:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 25 16:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 25 16:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 868K Mar 5 18:23 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 ShieldIIPs-PT-100A-LTLCardinality-00
FORMULA_NAME ShieldIIPs-PT-100A-LTLCardinality-01
FORMULA_NAME ShieldIIPs-PT-100A-LTLCardinality-02
FORMULA_NAME ShieldIIPs-PT-100A-LTLCardinality-03
FORMULA_NAME ShieldIIPs-PT-100A-LTLCardinality-04
FORMULA_NAME ShieldIIPs-PT-100A-LTLCardinality-05
FORMULA_NAME ShieldIIPs-PT-100A-LTLCardinality-06
FORMULA_NAME ShieldIIPs-PT-100A-LTLCardinality-07
FORMULA_NAME ShieldIIPs-PT-100A-LTLCardinality-08
FORMULA_NAME ShieldIIPs-PT-100A-LTLCardinality-09
FORMULA_NAME ShieldIIPs-PT-100A-LTLCardinality-10
FORMULA_NAME ShieldIIPs-PT-100A-LTLCardinality-11
FORMULA_NAME ShieldIIPs-PT-100A-LTLCardinality-12
FORMULA_NAME ShieldIIPs-PT-100A-LTLCardinality-13
FORMULA_NAME ShieldIIPs-PT-100A-LTLCardinality-14
FORMULA_NAME ShieldIIPs-PT-100A-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679431645556

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=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-100A
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 20:47:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-21 20:47:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 20:47:28] [INFO ] Load time of PNML (sax parser for PT used): 178 ms
[2023-03-21 20:47:28] [INFO ] Transformed 2503 places.
[2023-03-21 20:47:28] [INFO ] Transformed 2403 transitions.
[2023-03-21 20:47:28] [INFO ] Found NUPN structural information;
[2023-03-21 20:47:28] [INFO ] Parsed PT model containing 2503 places and 2403 transitions and 10806 arcs in 394 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldIIPs-PT-100A-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100A-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100A-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100A-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100A-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100A-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-100A-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 408 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2023-03-21 20:47:29] [INFO ] Computed 901 place invariants in 37 ms
[2023-03-21 20:47:31] [INFO ] Implicit Places using invariants in 2034 ms returned []
[2023-03-21 20:47:31] [INFO ] Invariant cache hit.
[2023-03-21 20:47:34] [INFO ] Implicit Places using invariants and state equation in 2803 ms returned []
Implicit Place search using SMT with State Equation took 4911 ms to find 0 implicit places.
[2023-03-21 20:47:34] [INFO ] Invariant cache hit.
[2023-03-21 20:47:37] [INFO ] Dead Transitions using invariants and state equation in 2537 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7866 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Support contains 30 out of 2503 places after structural reductions.
[2023-03-21 20:47:37] [INFO ] Flatten gal took : 322 ms
[2023-03-21 20:47:37] [INFO ] Flatten gal took : 206 ms
[2023-03-21 20:47:38] [INFO ] Input system was already deterministic with 2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 479 ms. (steps per millisecond=20 ) properties (out of 15) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-21 20:47:39] [INFO ] Invariant cache hit.
[2023-03-21 20:47:40] [INFO ] After 1020ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-21 20:47:42] [INFO ] [Nat]Absence check using 901 positive place invariants in 485 ms returned sat
[2023-03-21 20:47:45] [INFO ] After 2517ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-21 20:47:45] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 6 ms to minimize.
[2023-03-21 20:47:45] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 1 ms to minimize.
[2023-03-21 20:47:46] [INFO ] Deduced a trap composed of 24 places in 202 ms of which 1 ms to minimize.
[2023-03-21 20:47:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 936 ms
[2023-03-21 20:47:46] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
[2023-03-21 20:47:46] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 3 ms to minimize.
[2023-03-21 20:47:47] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2023-03-21 20:47:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 789 ms
[2023-03-21 20:47:48] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 1 ms to minimize.
[2023-03-21 20:47:48] [INFO ] Deduced a trap composed of 11 places in 196 ms of which 1 ms to minimize.
[2023-03-21 20:47:49] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 0 ms to minimize.
[2023-03-21 20:47:49] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 0 ms to minimize.
[2023-03-21 20:47:49] [INFO ] Deduced a trap composed of 9 places in 183 ms of which 0 ms to minimize.
[2023-03-21 20:47:50] [INFO ] Deduced a trap composed of 8 places in 187 ms of which 1 ms to minimize.
[2023-03-21 20:47:50] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 0 ms to minimize.
[2023-03-21 20:47:50] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 1 ms to minimize.
[2023-03-21 20:47:50] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 0 ms to minimize.
[2023-03-21 20:47:50] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 0 ms to minimize.
[2023-03-21 20:47:51] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 0 ms to minimize.
[2023-03-21 20:47:51] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 1 ms to minimize.
[2023-03-21 20:47:51] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 1 ms to minimize.
[2023-03-21 20:47:51] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3450 ms
[2023-03-21 20:47:51] [INFO ] After 9106ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 1017 ms.
[2023-03-21 20:47:52] [INFO ] After 12062ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 1589 ms.
Support contains 15 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2403/2403 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 2503 transition count 2402
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 36 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Partial Free-agglomeration rule applied 685 times.
Drop transitions removed 685 transitions
Iterating global reduction 0 with 685 rules applied. Total rules applied 689 place count 2501 transition count 2401
Applied a total of 689 rules in 392 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 393 ms. Remains : 2501/2503 places, 2401/2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 470 ms. (steps per millisecond=21 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 69401 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{0=1, 1=1, 3=1}
Probabilistic random walk after 69401 steps, saw 68195 distinct states, run finished after 3002 ms. (steps per millisecond=23 ) properties seen :3
Running SMT prover for 4 properties.
// Phase 1: matrix 2401 rows 2501 cols
[2023-03-21 20:47:59] [INFO ] Computed 901 place invariants in 96 ms
[2023-03-21 20:48:00] [INFO ] [Real]Absence check using 896 positive place invariants in 328 ms returned sat
[2023-03-21 20:48:00] [INFO ] [Real]Absence check using 896 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-21 20:48:03] [INFO ] After 2177ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-21 20:48:03] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-21 20:48:03] [INFO ] After 141ms SMT Verify possible using 4 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 20:48:03] [INFO ] After 3596ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 20:48:04] [INFO ] [Nat]Absence check using 896 positive place invariants in 265 ms returned sat
[2023-03-21 20:48:04] [INFO ] [Nat]Absence check using 896 positive and 5 generalized place invariants in 12 ms returned sat
[2023-03-21 20:48:06] [INFO ] After 1769ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 20:48:06] [INFO ] After 626ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-21 20:48:07] [INFO ] Deduced a trap composed of 5 places in 245 ms of which 0 ms to minimize.
[2023-03-21 20:48:07] [INFO ] Deduced a trap composed of 18 places in 349 ms of which 13 ms to minimize.
[2023-03-21 20:48:07] [INFO ] Deduced a trap composed of 6 places in 221 ms of which 0 ms to minimize.
[2023-03-21 20:48:08] [INFO ] Deduced a trap composed of 19 places in 374 ms of which 0 ms to minimize.
[2023-03-21 20:48:08] [INFO ] Deduced a trap composed of 5 places in 248 ms of which 1 ms to minimize.
[2023-03-21 20:48:09] [INFO ] Deduced a trap composed of 5 places in 284 ms of which 1 ms to minimize.
[2023-03-21 20:48:09] [INFO ] Deduced a trap composed of 15 places in 368 ms of which 1 ms to minimize.
[2023-03-21 20:48:09] [INFO ] Deduced a trap composed of 9 places in 306 ms of which 0 ms to minimize.
[2023-03-21 20:48:10] [INFO ] Deduced a trap composed of 18 places in 258 ms of which 0 ms to minimize.
[2023-03-21 20:48:10] [INFO ] Deduced a trap composed of 8 places in 200 ms of which 0 ms to minimize.
[2023-03-21 20:48:10] [INFO ] Deduced a trap composed of 9 places in 299 ms of which 0 ms to minimize.
[2023-03-21 20:48:11] [INFO ] Deduced a trap composed of 9 places in 241 ms of which 1 ms to minimize.
[2023-03-21 20:48:11] [INFO ] Deduced a trap composed of 24 places in 211 ms of which 1 ms to minimize.
[2023-03-21 20:48:11] [INFO ] Deduced a trap composed of 23 places in 188 ms of which 1 ms to minimize.
[2023-03-21 20:48:12] [INFO ] Deduced a trap composed of 9 places in 394 ms of which 0 ms to minimize.
[2023-03-21 20:48:12] [INFO ] Deduced a trap composed of 18 places in 247 ms of which 0 ms to minimize.
[2023-03-21 20:48:13] [INFO ] Deduced a trap composed of 11 places in 368 ms of which 0 ms to minimize.
[2023-03-21 20:48:13] [INFO ] Deduced a trap composed of 17 places in 262 ms of which 1 ms to minimize.
[2023-03-21 20:48:13] [INFO ] Deduced a trap composed of 9 places in 222 ms of which 1 ms to minimize.
[2023-03-21 20:48:14] [INFO ] Deduced a trap composed of 15 places in 355 ms of which 14 ms to minimize.
[2023-03-21 20:48:14] [INFO ] Deduced a trap composed of 18 places in 178 ms of which 0 ms to minimize.
[2023-03-21 20:48:14] [INFO ] Deduced a trap composed of 9 places in 181 ms of which 1 ms to minimize.
[2023-03-21 20:48:15] [INFO ] Deduced a trap composed of 18 places in 242 ms of which 1 ms to minimize.
[2023-03-21 20:48:16] [INFO ] Deduced a trap composed of 5 places in 329 ms of which 1 ms to minimize.
[2023-03-21 20:48:16] [INFO ] Deduced a trap composed of 5 places in 172 ms of which 1 ms to minimize.
[2023-03-21 20:48:17] [INFO ] Deduced a trap composed of 5 places in 250 ms of which 0 ms to minimize.
[2023-03-21 20:48:17] [INFO ] Deduced a trap composed of 5 places in 341 ms of which 0 ms to minimize.
[2023-03-21 20:48:18] [INFO ] Deduced a trap composed of 5 places in 177 ms of which 1 ms to minimize.
[2023-03-21 20:48:18] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 0 ms to minimize.
[2023-03-21 20:48:18] [INFO ] Deduced a trap composed of 5 places in 191 ms of which 2 ms to minimize.
[2023-03-21 20:48:18] [INFO ] Deduced a trap composed of 5 places in 119 ms of which 3 ms to minimize.
[2023-03-21 20:48:19] [INFO ] Deduced a trap composed of 5 places in 182 ms of which 0 ms to minimize.
[2023-03-21 20:48:19] [INFO ] Deduced a trap composed of 5 places in 159 ms of which 1 ms to minimize.
[2023-03-21 20:48:19] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 0 ms to minimize.
[2023-03-21 20:48:19] [INFO ] Deduced a trap composed of 6 places in 207 ms of which 1 ms to minimize.
[2023-03-21 20:48:20] [INFO ] Deduced a trap composed of 5 places in 206 ms of which 12 ms to minimize.
[2023-03-21 20:48:20] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 1 ms to minimize.
[2023-03-21 20:48:20] [INFO ] Deduced a trap composed of 8 places in 171 ms of which 0 ms to minimize.
[2023-03-21 20:48:20] [INFO ] Deduced a trap composed of 9 places in 191 ms of which 1 ms to minimize.
[2023-03-21 20:48:21] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 0 ms to minimize.
[2023-03-21 20:48:21] [INFO ] Trap strengthening (SAT) tested/added 41/40 trap constraints in 14595 ms
[2023-03-21 20:48:22] [INFO ] Deduced a trap composed of 5 places in 234 ms of which 1 ms to minimize.
[2023-03-21 20:48:22] [INFO ] Deduced a trap composed of 5 places in 179 ms of which 0 ms to minimize.
[2023-03-21 20:48:23] [INFO ] Deduced a trap composed of 6 places in 119 ms of which 0 ms to minimize.
[2023-03-21 20:48:23] [INFO ] Deduced a trap composed of 5 places in 195 ms of which 15 ms to minimize.
[2023-03-21 20:48:23] [INFO ] Deduced a trap composed of 5 places in 182 ms of which 1 ms to minimize.
[2023-03-21 20:48:24] [INFO ] Deduced a trap composed of 5 places in 258 ms of which 7 ms to minimize.
[2023-03-21 20:48:24] [INFO ] Deduced a trap composed of 6 places in 223 ms of which 1 ms to minimize.
[2023-03-21 20:48:24] [INFO ] Deduced a trap composed of 5 places in 217 ms of which 16 ms to minimize.
[2023-03-21 20:48:25] [INFO ] Deduced a trap composed of 5 places in 149 ms of which 1 ms to minimize.
[2023-03-21 20:48:25] [INFO ] Deduced a trap composed of 5 places in 225 ms of which 0 ms to minimize.
[2023-03-21 20:48:25] [INFO ] Deduced a trap composed of 5 places in 185 ms of which 1 ms to minimize.
[2023-03-21 20:48:26] [INFO ] Deduced a trap composed of 5 places in 157 ms of which 0 ms to minimize.
[2023-03-21 20:48:26] [INFO ] Deduced a trap composed of 6 places in 208 ms of which 0 ms to minimize.
[2023-03-21 20:48:26] [INFO ] Deduced a trap composed of 5 places in 235 ms of which 4 ms to minimize.
[2023-03-21 20:48:27] [INFO ] Deduced a trap composed of 6 places in 244 ms of which 2 ms to minimize.
[2023-03-21 20:48:27] [INFO ] Deduced a trap composed of 5 places in 189 ms of which 1 ms to minimize.
[2023-03-21 20:48:27] [INFO ] Deduced a trap composed of 5 places in 189 ms of which 1 ms to minimize.
[2023-03-21 20:48:28] [INFO ] Deduced a trap composed of 8 places in 172 ms of which 0 ms to minimize.
[2023-03-21 20:48:28] [INFO ] Deduced a trap composed of 6 places in 263 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 20:48:28] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 20:48:28] [INFO ] After 25263ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 1769 ms.
Support contains 8 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 2501 transition count 2401
Applied a total of 7 rules in 232 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 245 ms. Remains : 2501/2501 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 329 ms. (steps per millisecond=30 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 259 ms. (steps per millisecond=38 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 287 ms. (steps per millisecond=34 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 59211 steps, run timeout after 3013 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 59211 steps, saw 58108 distinct states, run finished after 3014 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2401 rows 2501 cols
[2023-03-21 20:48:34] [INFO ] Computed 901 place invariants in 46 ms
[2023-03-21 20:48:35] [INFO ] [Real]Absence check using 900 positive place invariants in 463 ms returned sat
[2023-03-21 20:48:35] [INFO ] [Real]Absence check using 900 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-21 20:48:38] [INFO ] After 3464ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 20:48:39] [INFO ] [Nat]Absence check using 900 positive place invariants in 243 ms returned sat
[2023-03-21 20:48:39] [INFO ] [Nat]Absence check using 900 positive and 1 generalized place invariants in 10 ms returned sat
[2023-03-21 20:48:44] [INFO ] After 5019ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 20:48:44] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-21 20:48:51] [INFO ] After 6856ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-21 20:48:51] [INFO ] Deduced a trap composed of 5 places in 367 ms of which 1 ms to minimize.
[2023-03-21 20:48:52] [INFO ] Deduced a trap composed of 5 places in 220 ms of which 1 ms to minimize.
[2023-03-21 20:48:52] [INFO ] Deduced a trap composed of 5 places in 250 ms of which 1 ms to minimize.
[2023-03-21 20:48:52] [INFO ] Deduced a trap composed of 5 places in 241 ms of which 0 ms to minimize.
[2023-03-21 20:48:53] [INFO ] Deduced a trap composed of 6 places in 310 ms of which 1 ms to minimize.
[2023-03-21 20:48:53] [INFO ] Deduced a trap composed of 5 places in 216 ms of which 0 ms to minimize.
[2023-03-21 20:48:53] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 0 ms to minimize.
[2023-03-21 20:48:54] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 1 ms to minimize.
[2023-03-21 20:48:54] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 1 ms to minimize.
[2023-03-21 20:48:54] [INFO ] Deduced a trap composed of 5 places in 138 ms of which 0 ms to minimize.
[2023-03-21 20:48:54] [INFO ] Deduced a trap composed of 6 places in 178 ms of which 1 ms to minimize.
[2023-03-21 20:48:55] [INFO ] Deduced a trap composed of 5 places in 166 ms of which 1 ms to minimize.
[2023-03-21 20:48:55] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 0 ms to minimize.
[2023-03-21 20:48:55] [INFO ] Deduced a trap composed of 6 places in 121 ms of which 1 ms to minimize.
[2023-03-21 20:48:55] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 0 ms to minimize.
[2023-03-21 20:48:55] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 0 ms to minimize.
[2023-03-21 20:48:56] [INFO ] Deduced a trap composed of 18 places in 130 ms of which 0 ms to minimize.
[2023-03-21 20:48:56] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 4946 ms
[2023-03-21 20:48:59] [INFO ] Deduced a trap composed of 5 places in 202 ms of which 1 ms to minimize.
[2023-03-21 20:49:00] [INFO ] Deduced a trap composed of 5 places in 254 ms of which 1 ms to minimize.
[2023-03-21 20:49:00] [INFO ] Deduced a trap composed of 5 places in 206 ms of which 1 ms to minimize.
[2023-03-21 20:49:00] [INFO ] Deduced a trap composed of 5 places in 364 ms of which 0 ms to minimize.
[2023-03-21 20:49:01] [INFO ] Deduced a trap composed of 8 places in 187 ms of which 0 ms to minimize.
[2023-03-21 20:49:01] [INFO ] Deduced a trap composed of 5 places in 181 ms of which 1 ms to minimize.
[2023-03-21 20:49:01] [INFO ] Deduced a trap composed of 5 places in 195 ms of which 1 ms to minimize.
[2023-03-21 20:49:02] [INFO ] Deduced a trap composed of 8 places in 155 ms of which 0 ms to minimize.
[2023-03-21 20:49:02] [INFO ] Deduced a trap composed of 5 places in 148 ms of which 0 ms to minimize.
[2023-03-21 20:49:02] [INFO ] Deduced a trap composed of 5 places in 187 ms of which 0 ms to minimize.
[2023-03-21 20:49:03] [INFO ] Deduced a trap composed of 8 places in 150 ms of which 1 ms to minimize.
[2023-03-21 20:49:03] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 1 ms to minimize.
[2023-03-21 20:49:03] [INFO ] Deduced a trap composed of 5 places in 141 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 20:49:03] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 20:49:03] [INFO ] After 25136ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 1791 ms.
Support contains 8 out of 2501 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 106 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 2501/2501 places, 2401/2401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2501/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 117 ms. Remains 2501 /2501 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2023-03-21 20:49:05] [INFO ] Invariant cache hit.
[2023-03-21 20:49:07] [INFO ] Implicit Places using invariants in 1966 ms returned []
[2023-03-21 20:49:07] [INFO ] Invariant cache hit.
[2023-03-21 20:49:09] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-21 20:49:14] [INFO ] Implicit Places using invariants and state equation in 6947 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 8930 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 2500/2501 places, 2401/2401 transitions.
Applied a total of 0 rules in 158 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 9207 ms. Remains : 2500/2501 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 338 ms. (steps per millisecond=29 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 71750 steps, run timeout after 3002 ms. (steps per millisecond=23 ) properties seen :{2=1}
Probabilistic random walk after 71750 steps, saw 70512 distinct states, run finished after 3002 ms. (steps per millisecond=23 ) properties seen :1
Running SMT prover for 3 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2023-03-21 20:49:18] [INFO ] Computed 900 place invariants in 33 ms
[2023-03-21 20:49:19] [INFO ] [Real]Absence check using 899 positive place invariants in 329 ms returned sat
[2023-03-21 20:49:19] [INFO ] [Real]Absence check using 899 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-21 20:49:21] [INFO ] After 2873ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 20:49:22] [INFO ] [Nat]Absence check using 899 positive place invariants in 229 ms returned sat
[2023-03-21 20:49:22] [INFO ] [Nat]Absence check using 899 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-21 20:49:24] [INFO ] After 1856ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-21 20:49:24] [INFO ] Deduced a trap composed of 5 places in 399 ms of which 1 ms to minimize.
[2023-03-21 20:49:25] [INFO ] Deduced a trap composed of 5 places in 317 ms of which 1 ms to minimize.
[2023-03-21 20:49:25] [INFO ] Deduced a trap composed of 9 places in 261 ms of which 1 ms to minimize.
[2023-03-21 20:49:25] [INFO ] Deduced a trap composed of 9 places in 254 ms of which 1 ms to minimize.
[2023-03-21 20:49:26] [INFO ] Deduced a trap composed of 6 places in 313 ms of which 0 ms to minimize.
[2023-03-21 20:49:26] [INFO ] Deduced a trap composed of 12 places in 264 ms of which 0 ms to minimize.
[2023-03-21 20:49:27] [INFO ] Deduced a trap composed of 8 places in 386 ms of which 1 ms to minimize.
[2023-03-21 20:49:27] [INFO ] Deduced a trap composed of 5 places in 324 ms of which 1 ms to minimize.
[2023-03-21 20:49:28] [INFO ] Deduced a trap composed of 9 places in 335 ms of which 1 ms to minimize.
[2023-03-21 20:49:28] [INFO ] Deduced a trap composed of 15 places in 275 ms of which 0 ms to minimize.
[2023-03-21 20:49:28] [INFO ] Deduced a trap composed of 5 places in 323 ms of which 0 ms to minimize.
[2023-03-21 20:49:29] [INFO ] Deduced a trap composed of 9 places in 275 ms of which 1 ms to minimize.
[2023-03-21 20:49:29] [INFO ] Deduced a trap composed of 12 places in 422 ms of which 1 ms to minimize.
[2023-03-21 20:49:30] [INFO ] Deduced a trap composed of 12 places in 343 ms of which 23 ms to minimize.
[2023-03-21 20:49:30] [INFO ] Deduced a trap composed of 12 places in 265 ms of which 1 ms to minimize.
[2023-03-21 20:49:30] [INFO ] Deduced a trap composed of 15 places in 290 ms of which 1 ms to minimize.
[2023-03-21 20:49:31] [INFO ] Deduced a trap composed of 12 places in 254 ms of which 0 ms to minimize.
[2023-03-21 20:49:31] [INFO ] Deduced a trap composed of 12 places in 186 ms of which 1 ms to minimize.
[2023-03-21 20:49:31] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 0 ms to minimize.
[2023-03-21 20:49:32] [INFO ] Deduced a trap composed of 21 places in 188 ms of which 1 ms to minimize.
[2023-03-21 20:49:32] [INFO ] Deduced a trap composed of 9 places in 254 ms of which 0 ms to minimize.
[2023-03-21 20:49:32] [INFO ] Deduced a trap composed of 12 places in 156 ms of which 1 ms to minimize.
[2023-03-21 20:49:32] [INFO ] Deduced a trap composed of 12 places in 236 ms of which 0 ms to minimize.
[2023-03-21 20:49:33] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 0 ms to minimize.
[2023-03-21 20:49:33] [INFO ] Deduced a trap composed of 18 places in 165 ms of which 1 ms to minimize.
[2023-03-21 20:49:33] [INFO ] Deduced a trap composed of 15 places in 205 ms of which 0 ms to minimize.
[2023-03-21 20:49:34] [INFO ] Deduced a trap composed of 18 places in 188 ms of which 1 ms to minimize.
[2023-03-21 20:49:34] [INFO ] Deduced a trap composed of 18 places in 202 ms of which 0 ms to minimize.
[2023-03-21 20:49:34] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 0 ms to minimize.
[2023-03-21 20:49:34] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 0 ms to minimize.
[2023-03-21 20:49:34] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 10615 ms
[2023-03-21 20:49:35] [INFO ] Deduced a trap composed of 11 places in 171 ms of which 1 ms to minimize.
[2023-03-21 20:49:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 414 ms
[2023-03-21 20:49:35] [INFO ] After 13248ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 441 ms.
[2023-03-21 20:49:36] [INFO ] After 14667ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 857 ms.
Support contains 6 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 2500 transition count 2401
Applied a total of 3 rules in 178 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 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 2503 transition count 2402
Deduced a syphon composed of 1 places in 16 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 16 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Applied a total of 4 rules in 238 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2023-03-21 20:49:37] [INFO ] Computed 901 place invariants in 8 ms
[2023-03-21 20:49:39] [INFO ] Implicit Places using invariants in 1390 ms returned []
[2023-03-21 20:49:39] [INFO ] Invariant cache hit.
[2023-03-21 20:49:40] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-21 20:49:44] [INFO ] Implicit Places using invariants and state equation in 5539 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 6935 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2500/2503 places, 2401/2403 transitions.
Applied a total of 0 rules in 111 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7285 ms. Remains : 2500/2503 places, 2401/2403 transitions.
Stuttering acceptance computed with spot in 271 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s316 0) (EQ s1264 1) (AND (EQ s952 0) (EQ s2142 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 19 reset in 1749 ms.
Product exploration explored 100000 steps with 19 reset in 1951 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 150 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 93 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 83122 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 83122 steps, saw 77473 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2023-03-21 20:49:52] [INFO ] Computed 900 place invariants in 17 ms
[2023-03-21 20:49:53] [INFO ] After 650ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 20:49:53] [INFO ] [Nat]Absence check using 900 positive place invariants in 216 ms returned sat
[2023-03-21 20:49:55] [INFO ] After 1500ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 20:49:55] [INFO ] Deduced a trap composed of 18 places in 424 ms of which 23 ms to minimize.
[2023-03-21 20:49:56] [INFO ] Deduced a trap composed of 24 places in 412 ms of which 0 ms to minimize.
[2023-03-21 20:49:56] [INFO ] Deduced a trap composed of 9 places in 445 ms of which 1 ms to minimize.
[2023-03-21 20:49:57] [INFO ] Deduced a trap composed of 18 places in 332 ms of which 0 ms to minimize.
[2023-03-21 20:49:57] [INFO ] Deduced a trap composed of 18 places in 334 ms of which 1 ms to minimize.
[2023-03-21 20:49:58] [INFO ] Deduced a trap composed of 18 places in 370 ms of which 0 ms to minimize.
[2023-03-21 20:49:58] [INFO ] Deduced a trap composed of 30 places in 366 ms of which 0 ms to minimize.
[2023-03-21 20:49:59] [INFO ] Deduced a trap composed of 18 places in 389 ms of which 1 ms to minimize.
[2023-03-21 20:49:59] [INFO ] Deduced a trap composed of 18 places in 392 ms of which 0 ms to minimize.
[2023-03-21 20:50:00] [INFO ] Deduced a trap composed of 15 places in 325 ms of which 1 ms to minimize.
[2023-03-21 20:50:00] [INFO ] Deduced a trap composed of 24 places in 476 ms of which 1 ms to minimize.
[2023-03-21 20:50:01] [INFO ] Deduced a trap composed of 18 places in 356 ms of which 0 ms to minimize.
[2023-03-21 20:50:01] [INFO ] Deduced a trap composed of 24 places in 293 ms of which 1 ms to minimize.
[2023-03-21 20:50:01] [INFO ] Deduced a trap composed of 18 places in 320 ms of which 1 ms to minimize.
[2023-03-21 20:50:02] [INFO ] Deduced a trap composed of 30 places in 405 ms of which 2 ms to minimize.
[2023-03-21 20:50:02] [INFO ] Deduced a trap composed of 18 places in 340 ms of which 1 ms to minimize.
[2023-03-21 20:50:03] [INFO ] Deduced a trap composed of 23 places in 311 ms of which 1 ms to minimize.
[2023-03-21 20:50:03] [INFO ] Deduced a trap composed of 18 places in 331 ms of which 1 ms to minimize.
[2023-03-21 20:50:04] [INFO ] Deduced a trap composed of 18 places in 331 ms of which 1 ms to minimize.
[2023-03-21 20:50:04] [INFO ] Deduced a trap composed of 15 places in 303 ms of which 1 ms to minimize.
[2023-03-21 20:50:05] [INFO ] Deduced a trap composed of 26 places in 521 ms of which 1 ms to minimize.
[2023-03-21 20:50:05] [INFO ] Deduced a trap composed of 18 places in 354 ms of which 1 ms to minimize.
[2023-03-21 20:50:06] [INFO ] Deduced a trap composed of 18 places in 297 ms of which 1 ms to minimize.
[2023-03-21 20:50:06] [INFO ] Deduced a trap composed of 18 places in 308 ms of which 1 ms to minimize.
[2023-03-21 20:50:06] [INFO ] Deduced a trap composed of 18 places in 297 ms of which 1 ms to minimize.
[2023-03-21 20:50:07] [INFO ] Deduced a trap composed of 21 places in 306 ms of which 1 ms to minimize.
[2023-03-21 20:50:07] [INFO ] Deduced a trap composed of 18 places in 374 ms of which 1 ms to minimize.
[2023-03-21 20:50:08] [INFO ] Deduced a trap composed of 24 places in 274 ms of which 1 ms to minimize.
[2023-03-21 20:50:08] [INFO ] Deduced a trap composed of 30 places in 269 ms of which 0 ms to minimize.
[2023-03-21 20:50:08] [INFO ] Deduced a trap composed of 30 places in 280 ms of which 0 ms to minimize.
[2023-03-21 20:50:09] [INFO ] Deduced a trap composed of 36 places in 393 ms of which 1 ms to minimize.
[2023-03-21 20:50:09] [INFO ] Deduced a trap composed of 9 places in 360 ms of which 0 ms to minimize.
[2023-03-21 20:50:10] [INFO ] Deduced a trap composed of 26 places in 300 ms of which 1 ms to minimize.
[2023-03-21 20:50:10] [INFO ] Deduced a trap composed of 24 places in 273 ms of which 0 ms to minimize.
[2023-03-21 20:50:11] [INFO ] Deduced a trap composed of 24 places in 253 ms of which 0 ms to minimize.
[2023-03-21 20:50:11] [INFO ] Deduced a trap composed of 30 places in 269 ms of which 1 ms to minimize.
[2023-03-21 20:50:11] [INFO ] Deduced a trap composed of 30 places in 222 ms of which 0 ms to minimize.
[2023-03-21 20:50:12] [INFO ] Deduced a trap composed of 30 places in 292 ms of which 0 ms to minimize.
[2023-03-21 20:50:12] [INFO ] Trap strengthening (SAT) tested/added 39/38 trap constraints in 16957 ms
[2023-03-21 20:50:12] [INFO ] After 18587ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 133 ms.
[2023-03-21 20:50:12] [INFO ] After 19476ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 66 ms.
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Partial Free-agglomeration rule applied 695 times.
Drop transitions removed 695 transitions
Iterating global reduction 0 with 695 rules applied. Total rules applied 695 place count 2500 transition count 2401
Applied a total of 695 rules in 193 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 205 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 1) seen :0
Finished probabilistic random walk after 45912 steps, run visited all 1 properties in 982 ms. (steps per millisecond=46 )
Probabilistic random walk after 45912 steps, saw 44945 distinct states, run finished after 984 ms. (steps per millisecond=46 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 224 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 117 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 117 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2023-03-21 20:50:14] [INFO ] Invariant cache hit.
[2023-03-21 20:50:16] [INFO ] Implicit Places using invariants in 1819 ms returned []
[2023-03-21 20:50:16] [INFO ] Invariant cache hit.
[2023-03-21 20:50:21] [INFO ] Implicit Places using invariants and state equation in 5327 ms returned []
Implicit Place search using SMT with State Equation took 7181 ms to find 0 implicit places.
[2023-03-21 20:50:23] [INFO ] Redundant transitions in 1066 ms returned [2395]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2400 rows 2500 cols
[2023-03-21 20:50:23] [INFO ] Computed 900 place invariants in 6 ms
[2023-03-21 20:50:24] [INFO ] Dead Transitions using invariants and state equation in 1596 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2500/2500 places, 2400/2401 transitions.
Applied a total of 0 rules in 78 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 10062 ms. Remains : 2500/2500 places, 2400/2401 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 135 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 100 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 110141 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 110141 steps, saw 103244 distinct states, run finished after 3001 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-21 20:50:28] [INFO ] Invariant cache hit.
[2023-03-21 20:50:28] [INFO ] After 453ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 20:50:29] [INFO ] [Nat]Absence check using 900 positive place invariants in 212 ms returned sat
[2023-03-21 20:50:30] [INFO ] After 1489ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 20:50:31] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2023-03-21 20:50:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 363 ms
[2023-03-21 20:50:31] [INFO ] After 1952ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 180 ms.
[2023-03-21 20:50:31] [INFO ] After 2779ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 85 ms.
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2400/2400 transitions.
Partial Free-agglomeration rule applied 695 times.
Drop transitions removed 695 transitions
Iterating global reduction 0 with 695 rules applied. Total rules applied 695 place count 2500 transition count 2400
Applied a total of 695 rules in 159 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 2500/2500 places, 2400/2400 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 1) seen :0
Finished probabilistic random walk after 45912 steps, run visited all 1 properties in 870 ms. (steps per millisecond=52 )
Probabilistic random walk after 45912 steps, saw 44945 distinct states, run finished after 874 ms. (steps per millisecond=52 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 279 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 129 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 19 reset in 1663 ms.
Product exploration explored 100000 steps with 19 reset in 1927 ms.
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2400/2400 transitions.
Applied a total of 0 rules in 96 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2023-03-21 20:50:37] [INFO ] Invariant cache hit.
[2023-03-21 20:50:39] [INFO ] Implicit Places using invariants in 2207 ms returned []
[2023-03-21 20:50:39] [INFO ] Invariant cache hit.
[2023-03-21 20:50:44] [INFO ] Implicit Places using invariants and state equation in 4590 ms returned []
Implicit Place search using SMT with State Equation took 6817 ms to find 0 implicit places.
[2023-03-21 20:50:44] [INFO ] Redundant transitions in 370 ms returned []
[2023-03-21 20:50:44] [INFO ] Invariant cache hit.
[2023-03-21 20:50:46] [INFO ] Dead Transitions using invariants and state equation in 2410 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9715 ms. Remains : 2500/2500 places, 2400/2400 transitions.
Treatment of property ShieldIIPs-PT-100A-LTLCardinality-00 finished in 70016 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||G(p1)))))'
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 72 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2023-03-21 20:50:47] [INFO ] Computed 901 place invariants in 14 ms
[2023-03-21 20:50:49] [INFO ] Implicit Places using invariants in 2045 ms returned []
[2023-03-21 20:50:49] [INFO ] Invariant cache hit.
[2023-03-21 20:50:54] [INFO ] Implicit Places using invariants and state equation in 4978 ms returned []
Implicit Place search using SMT with State Equation took 7028 ms to find 0 implicit places.
[2023-03-21 20:50:54] [INFO ] Invariant cache hit.
[2023-03-21 20:50:57] [INFO ] Dead Transitions using invariants and state equation in 2688 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9790 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Stuttering acceptance computed with spot in 363 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(AND (NEQ s179 0) (NEQ s2039 1)), p0:(AND (NEQ s180 0) (NEQ s436 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 6073 ms.
Product exploration explored 100000 steps with 33333 reset in 6340 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p0) (NOT p1)))))
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-100A-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-100A-LTLCardinality-03 finished in 22754 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 95 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
[2023-03-21 20:51:10] [INFO ] Invariant cache hit.
[2023-03-21 20:51:11] [INFO ] Implicit Places using invariants in 1300 ms returned []
[2023-03-21 20:51:11] [INFO ] Invariant cache hit.
[2023-03-21 20:51:16] [INFO ] Implicit Places using invariants and state equation in 4675 ms returned []
Implicit Place search using SMT with State Equation took 6003 ms to find 0 implicit places.
[2023-03-21 20:51:16] [INFO ] Invariant cache hit.
[2023-03-21 20:51:18] [INFO ] Dead Transitions using invariants and state equation in 2687 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8786 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s459 0) (EQ s1512 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]]
Product exploration explored 100000 steps with 50000 reset in 8279 ms.
Product exploration explored 100000 steps with 50000 reset in 8330 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 167 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-100A-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-100A-LTLCardinality-04 finished in 25720 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((F(G(p0)) U p1))))))'
Support contains 3 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 142 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
[2023-03-21 20:51:36] [INFO ] Invariant cache hit.
[2023-03-21 20:51:37] [INFO ] Implicit Places using invariants in 1445 ms returned []
[2023-03-21 20:51:37] [INFO ] Invariant cache hit.
[2023-03-21 20:51:42] [INFO ] Implicit Places using invariants and state equation in 4744 ms returned []
Implicit Place search using SMT with State Equation took 6203 ms to find 0 implicit places.
[2023-03-21 20:51:42] [INFO ] Invariant cache hit.
[2023-03-21 20:51:44] [INFO ] Dead Transitions using invariants and state equation in 2390 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8738 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Stuttering acceptance computed with spot in 399 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(OR (EQ s800 0) (EQ s227 1)), p0:(NEQ s14 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 19 reset in 2062 ms.
Product exploration explored 100000 steps with 19 reset in 2341 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 181 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 384 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 267 ms. (steps per millisecond=37 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 81984 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 81984 steps, saw 76439 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-21 20:51:53] [INFO ] Invariant cache hit.
[2023-03-21 20:51:54] [INFO ] [Real]Absence check using 901 positive place invariants in 192 ms returned sat
[2023-03-21 20:51:55] [INFO ] After 2315ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 20:51:56] [INFO ] [Nat]Absence check using 901 positive place invariants in 205 ms returned sat
[2023-03-21 20:51:59] [INFO ] After 2619ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 20:51:59] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2023-03-21 20:51:59] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 0 ms to minimize.
[2023-03-21 20:52:00] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 1 ms to minimize.
[2023-03-21 20:52:00] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 0 ms to minimize.
[2023-03-21 20:52:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1057 ms
[2023-03-21 20:52:00] [INFO ] After 4061ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 289 ms.
[2023-03-21 20:52:01] [INFO ] After 5114ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 397 ms.
Support contains 3 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2403/2403 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 2503 transition count 2402
Deduced a syphon composed of 1 places in 14 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 14 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Partial Free-agglomeration rule applied 695 times.
Drop transitions removed 695 transitions
Iterating global reduction 0 with 695 rules applied. Total rules applied 699 place count 2501 transition count 2401
Applied a total of 699 rules in 325 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 325 ms. Remains : 2501/2503 places, 2401/2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 2) seen :0
Finished probabilistic random walk after 89126 steps, run visited all 2 properties in 2186 ms. (steps per millisecond=40 )
Probabilistic random walk after 89126 steps, saw 87708 distinct states, run finished after 2188 ms. (steps per millisecond=40 ) properties seen :2
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 214 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 412 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 366 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Support contains 3 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 165 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
[2023-03-21 20:52:05] [INFO ] Invariant cache hit.
[2023-03-21 20:52:07] [INFO ] Implicit Places using invariants in 2001 ms returned []
[2023-03-21 20:52:07] [INFO ] Invariant cache hit.
[2023-03-21 20:52:09] [INFO ] Implicit Places using invariants and state equation in 2191 ms returned []
Implicit Place search using SMT with State Equation took 4202 ms to find 0 implicit places.
[2023-03-21 20:52:09] [INFO ] Invariant cache hit.
[2023-03-21 20:52:12] [INFO ] Dead Transitions using invariants and state equation in 2344 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6713 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 133 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 367 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 343 ms. (steps per millisecond=29 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 233 ms. (steps per millisecond=42 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 82020 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 82020 steps, saw 76472 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-21 20:52:16] [INFO ] Invariant cache hit.
[2023-03-21 20:52:17] [INFO ] [Real]Absence check using 901 positive place invariants in 255 ms returned sat
[2023-03-21 20:52:18] [INFO ] After 2285ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 20:52:19] [INFO ] [Nat]Absence check using 901 positive place invariants in 266 ms returned sat
[2023-03-21 20:52:22] [INFO ] After 2575ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 20:52:22] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 0 ms to minimize.
[2023-03-21 20:52:22] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 0 ms to minimize.
[2023-03-21 20:52:22] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2023-03-21 20:52:23] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2023-03-21 20:52:23] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 858 ms
[2023-03-21 20:52:23] [INFO ] After 3722ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 236 ms.
[2023-03-21 20:52:23] [INFO ] After 4867ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 333 ms.
Support contains 3 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2403/2403 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 2503 transition count 2402
Deduced a syphon composed of 1 places in 15 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 14 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Partial Free-agglomeration rule applied 695 times.
Drop transitions removed 695 transitions
Iterating global reduction 0 with 695 rules applied. Total rules applied 699 place count 2501 transition count 2401
Applied a total of 699 rules in 279 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 279 ms. Remains : 2501/2503 places, 2401/2403 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 306 ms. (steps per millisecond=32 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 2) seen :0
Finished probabilistic random walk after 89126 steps, run visited all 2 properties in 2258 ms. (steps per millisecond=39 )
Probabilistic random walk after 89126 steps, saw 87708 distinct states, run finished after 2260 ms. (steps per millisecond=39 ) properties seen :2
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 216 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 342 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 419 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 393 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 19 reset in 1764 ms.
Product exploration explored 100000 steps with 19 reset in 1954 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 330 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Support contains 3 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 15 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2503 transition count 2403
Deduced a syphon composed of 2 places in 19 ms
Applied a total of 2 rules in 402 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
[2023-03-21 20:52:34] [INFO ] Redundant transitions in 753 ms returned [2395]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2402 rows 2503 cols
[2023-03-21 20:52:34] [INFO ] Computed 901 place invariants in 6 ms
[2023-03-21 20:52:35] [INFO ] Dead Transitions using invariants and state equation in 1471 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2503/2503 places, 2402/2403 transitions.
Deduced a syphon composed of 2 places in 11 ms
Applied a total of 0 rules in 113 ms. Remains 2503 /2503 variables (removed 0) and now considering 2402/2402 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2772 ms. Remains : 2503/2503 places, 2402/2403 transitions.
Support contains 3 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 72 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2023-03-21 20:52:35] [INFO ] Computed 901 place invariants in 5 ms
[2023-03-21 20:52:37] [INFO ] Implicit Places using invariants in 2026 ms returned []
[2023-03-21 20:52:37] [INFO ] Invariant cache hit.
[2023-03-21 20:52:42] [INFO ] Implicit Places using invariants and state equation in 5015 ms returned []
Implicit Place search using SMT with State Equation took 7043 ms to find 0 implicit places.
[2023-03-21 20:52:42] [INFO ] Invariant cache hit.
[2023-03-21 20:52:45] [INFO ] Dead Transitions using invariants and state equation in 2497 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9642 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Treatment of property ShieldIIPs-PT-100A-LTLCardinality-05 finished in 69623 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G(p0)||(p0&&G(!p1)))))'
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 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 2503 transition count 2402
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 15 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Applied a total of 4 rules in 201 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2023-03-21 20:52:45] [INFO ] Computed 901 place invariants in 6 ms
[2023-03-21 20:52:47] [INFO ] Implicit Places using invariants in 1536 ms returned []
[2023-03-21 20:52:47] [INFO ] Invariant cache hit.
[2023-03-21 20:52:48] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-21 20:52:50] [INFO ] Implicit Places using invariants and state equation in 3322 ms returned []
Implicit Place search using SMT with State Equation took 4868 ms to find 0 implicit places.
[2023-03-21 20:52:50] [INFO ] Redundant transitions in 359 ms returned [2395]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2400 rows 2501 cols
[2023-03-21 20:52:50] [INFO ] Computed 901 place invariants in 6 ms
[2023-03-21 20:52:52] [INFO ] Dead Transitions using invariants and state equation in 2066 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2501/2503 places, 2400/2403 transitions.
Applied a total of 0 rules in 94 ms. Remains 2501 /2501 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7595 ms. Remains : 2501/2503 places, 2400/2403 transitions.
Stuttering acceptance computed with spot in 213 ms :[true, (NOT p0), (AND (NOT p0) p1), p1]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (EQ s1552 0) (EQ s33 1)), p1:(OR (EQ s1194 0) (EQ s1268 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-100A-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100A-LTLCardinality-09 finished in 7851 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G((X(p1)||p0)))))))'
Support contains 3 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 75 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2503 cols
[2023-03-21 20:52:53] [INFO ] Computed 901 place invariants in 7 ms
[2023-03-21 20:52:55] [INFO ] Implicit Places using invariants in 2057 ms returned []
[2023-03-21 20:52:55] [INFO ] Invariant cache hit.
[2023-03-21 20:52:58] [INFO ] Implicit Places using invariants and state equation in 2809 ms returned []
Implicit Place search using SMT with State Equation took 4867 ms to find 0 implicit places.
[2023-03-21 20:52:58] [INFO ] Invariant cache hit.
[2023-03-21 20:53:00] [INFO ] Dead Transitions using invariants and state equation in 2262 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7205 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Stuttering acceptance computed with spot in 370 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}]], initial=6, aps=[p1:(EQ s2341 1), p0:(OR (EQ s2341 1) (EQ s1164 0) (EQ s1998 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2659 steps with 0 reset in 42 ms.
FORMULA ShieldIIPs-PT-100A-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100A-LTLCardinality-10 finished in 7667 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U p1)))'
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Applied a total of 0 rules in 72 ms. Remains 2503 /2503 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
[2023-03-21 20:53:01] [INFO ] Invariant cache hit.
[2023-03-21 20:53:03] [INFO ] Implicit Places using invariants in 2679 ms returned []
[2023-03-21 20:53:03] [INFO ] Invariant cache hit.
[2023-03-21 20:53:07] [INFO ] Implicit Places using invariants and state equation in 3783 ms returned []
Implicit Place search using SMT with State Equation took 6465 ms to find 0 implicit places.
[2023-03-21 20:53:07] [INFO ] Invariant cache hit.
[2023-03-21 20:53:09] [INFO ] Dead Transitions using invariants and state equation in 2110 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8650 ms. Remains : 2503/2503 places, 2403/2403 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLCardinality-11 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: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s2121 0) (EQ s89 1)), p0:(OR (EQ s749 0) (EQ s580 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 8074 ms.
Product exploration explored 100000 steps with 50000 reset in 8189 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 6 factoid took 248 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-100A-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-100A-LTLCardinality-11 finished in 25345 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 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 2503 transition count 2402
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Applied a total of 4 rules in 258 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2023-03-21 20:53:26] [INFO ] Computed 901 place invariants in 5 ms
[2023-03-21 20:53:28] [INFO ] Implicit Places using invariants in 2178 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2181 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 2500/2503 places, 2401/2403 transitions.
Applied a total of 0 rules in 93 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2541 ms. Remains : 2500/2503 places, 2401/2403 transitions.
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s2148 0) (EQ s1108 1)), p0:(OR (EQ s2104 0) (EQ s2230 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 29667 steps with 15 reset in 507 ms.
FORMULA ShieldIIPs-PT-100A-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-100A-LTLCardinality-14 finished in 3180 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 transitions.
Reduce places removed 1 places and 1 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 2502 transition count 2401
Deduced a syphon composed of 1 places in 26 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 2500 transition count 2401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 13 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 2499 transition count 2400
Applied a total of 5 rules in 312 ms. Remains 2499 /2503 variables (removed 4) and now considering 2400/2403 (removed 3) transitions.
// Phase 1: matrix 2400 rows 2499 cols
[2023-03-21 20:53:29] [INFO ] Computed 900 place invariants in 4 ms
[2023-03-21 20:53:32] [INFO ] Implicit Places using invariants in 2178 ms returned []
[2023-03-21 20:53:32] [INFO ] Invariant cache hit.
[2023-03-21 20:53:36] [INFO ] Implicit Places using invariants and state equation in 4814 ms returned []
Implicit Place search using SMT with State Equation took 6998 ms to find 0 implicit places.
[2023-03-21 20:53:37] [INFO ] Redundant transitions in 668 ms returned [2394]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2399 rows 2499 cols
[2023-03-21 20:53:37] [INFO ] Computed 900 place invariants in 4 ms
[2023-03-21 20:53:39] [INFO ] Dead Transitions using invariants and state equation in 1448 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2499/2503 places, 2399/2403 transitions.
Applied a total of 0 rules in 134 ms. Remains 2499 /2499 variables (removed 0) and now considering 2399/2399 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9601 ms. Remains : 2499/2503 places, 2399/2403 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-100A-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s681 0) (EQ s1830 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 19 reset in 1869 ms.
Product exploration explored 100000 steps with 19 reset in 2056 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 235 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 112193 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 112193 steps, saw 105111 distinct states, run finished after 3001 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-21 20:53:46] [INFO ] Invariant cache hit.
[2023-03-21 20:53:47] [INFO ] [Real]Absence check using 900 positive place invariants in 206 ms returned sat
[2023-03-21 20:53:49] [INFO ] After 2252ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 20:53:49] [INFO ] [Nat]Absence check using 900 positive place invariants in 179 ms returned sat
[2023-03-21 20:53:51] [INFO ] After 1460ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 20:53:51] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 1 ms to minimize.
[2023-03-21 20:53:51] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2023-03-21 20:53:51] [INFO ] Deduced a trap composed of 17 places in 170 ms of which 1 ms to minimize.
[2023-03-21 20:53:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 703 ms
[2023-03-21 20:53:51] [INFO ] After 2234ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 110 ms.
[2023-03-21 20:53:52] [INFO ] After 2950ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 82 ms.
Support contains 2 out of 2499 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2399/2399 transitions.
Partial Free-agglomeration rule applied 598 times.
Drop transitions removed 598 transitions
Iterating global reduction 0 with 598 rules applied. Total rules applied 598 place count 2499 transition count 2399
Applied a total of 598 rules in 164 ms. Remains 2499 /2499 variables (removed 0) and now considering 2399/2399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164 ms. Remains : 2499/2499 places, 2399/2399 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 1) seen :0
Finished probabilistic random walk after 66163 steps, run visited all 1 properties in 1210 ms. (steps per millisecond=54 )
Probabilistic random walk after 66163 steps, saw 65031 distinct states, run finished after 1212 ms. (steps per millisecond=54 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 213 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0)]
Support contains 2 out of 2499 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2499/2499 places, 2399/2399 transitions.
Applied a total of 0 rules in 95 ms. Remains 2499 /2499 variables (removed 0) and now considering 2399/2399 (removed 0) transitions.
[2023-03-21 20:53:54] [INFO ] Invariant cache hit.
[2023-03-21 20:53:55] [INFO ] Implicit Places using invariants in 1616 ms returned []
[2023-03-21 20:53:55] [INFO ] Invariant cache hit.
[2023-03-21 20:53:59] [INFO ] Implicit Places using invariants and state equation in 3740 ms returned []
Implicit Place search using SMT with State Equation took 5370 ms to find 0 implicit places.
[2023-03-21 20:54:00] [INFO ] Redundant transitions in 468 ms returned []
[2023-03-21 20:54:00] [INFO ] Invariant cache hit.
[2023-03-21 20:54:02] [INFO ] Dead Transitions using invariants and state equation in 2003 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7981 ms. Remains : 2499/2499 places, 2399/2399 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 145 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 110430 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 110430 steps, saw 103493 distinct states, run finished after 3001 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-21 20:54:05] [INFO ] Invariant cache hit.
[2023-03-21 20:54:06] [INFO ] [Real]Absence check using 900 positive place invariants in 164 ms returned sat
[2023-03-21 20:54:07] [INFO ] After 2086ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 20:54:08] [INFO ] [Nat]Absence check using 900 positive place invariants in 217 ms returned sat
[2023-03-21 20:54:09] [INFO ] After 1392ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 20:54:10] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 1 ms to minimize.
[2023-03-21 20:54:10] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 0 ms to minimize.
[2023-03-21 20:54:10] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 1 ms to minimize.
[2023-03-21 20:54:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 666 ms
[2023-03-21 20:54:10] [INFO ] After 2133ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 135 ms.
[2023-03-21 20:54:10] [INFO ] After 2891ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 84 ms.
Support contains 2 out of 2499 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2499/2499 places, 2399/2399 transitions.
Partial Free-agglomeration rule applied 598 times.
Drop transitions removed 598 transitions
Iterating global reduction 0 with 598 rules applied. Total rules applied 598 place count 2499 transition count 2399
Applied a total of 598 rules in 180 ms. Remains 2499 /2499 variables (removed 0) and now considering 2399/2399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 180 ms. Remains : 2499/2499 places, 2399/2399 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 255 ms. (steps per millisecond=39 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 1) seen :0
Finished probabilistic random walk after 66163 steps, run visited all 1 properties in 1341 ms. (steps per millisecond=49 )
Probabilistic random walk after 66163 steps, saw 65031 distinct states, run finished after 1343 ms. (steps per millisecond=49 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 269 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration explored 100000 steps with 19 reset in 1769 ms.
Product exploration explored 100000 steps with 19 reset in 1899 ms.
Support contains 2 out of 2499 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2499/2499 places, 2399/2399 transitions.
Applied a total of 0 rules in 72 ms. Remains 2499 /2499 variables (removed 0) and now considering 2399/2399 (removed 0) transitions.
[2023-03-21 20:54:16] [INFO ] Invariant cache hit.
[2023-03-21 20:54:18] [INFO ] Implicit Places using invariants in 1444 ms returned []
[2023-03-21 20:54:18] [INFO ] Invariant cache hit.
[2023-03-21 20:54:22] [INFO ] Implicit Places using invariants and state equation in 4292 ms returned []
Implicit Place search using SMT with State Equation took 5768 ms to find 0 implicit places.
[2023-03-21 20:54:23] [INFO ] Redundant transitions in 491 ms returned []
[2023-03-21 20:54:23] [INFO ] Invariant cache hit.
[2023-03-21 20:54:24] [INFO ] Dead Transitions using invariants and state equation in 1718 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8079 ms. Remains : 2499/2499 places, 2399/2399 transitions.
Treatment of property ShieldIIPs-PT-100A-LTLCardinality-15 finished in 55482 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G((F(G(p0)) U p1))))))'
Found a Lengthening insensitive property : ShieldIIPs-PT-100A-LTLCardinality-05
Stuttering acceptance computed with spot in 510 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Support contains 3 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2503/2503 places, 2403/2403 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 2503 transition count 2402
Deduced a syphon composed of 1 places in 14 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2502 transition count 2402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2501 transition count 2401
Applied a total of 4 rules in 195 ms. Remains 2501 /2503 variables (removed 2) and now considering 2401/2403 (removed 2) transitions.
// Phase 1: matrix 2401 rows 2501 cols
[2023-03-21 20:54:25] [INFO ] Computed 901 place invariants in 5 ms
[2023-03-21 20:54:27] [INFO ] Implicit Places using invariants in 1850 ms returned [2487]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1866 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 2500/2503 places, 2401/2403 transitions.
Applied a total of 0 rules in 101 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2170 ms. Remains : 2500/2503 places, 2401/2403 transitions.
Running random walk in product with property : ShieldIIPs-PT-100A-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(OR (EQ s800 0) (EQ s227 1)), p0:(NEQ s14 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 19 reset in 1528 ms.
Product exploration explored 100000 steps with 19 reset in 1897 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 127 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 340 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 389 ms. (steps per millisecond=25 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 71359 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 71359 steps, saw 66301 distinct states, run finished after 3001 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2401 rows 2500 cols
[2023-03-21 20:54:35] [INFO ] Computed 900 place invariants in 5 ms
[2023-03-21 20:54:36] [INFO ] [Real]Absence check using 900 positive place invariants in 255 ms returned sat
[2023-03-21 20:54:38] [INFO ] After 2551ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 20:54:38] [INFO ] [Nat]Absence check using 900 positive place invariants in 287 ms returned sat
[2023-03-21 20:54:40] [INFO ] After 1947ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 20:54:41] [INFO ] Deduced a trap composed of 18 places in 145 ms of which 0 ms to minimize.
[2023-03-21 20:54:41] [INFO ] Deduced a trap composed of 18 places in 144 ms of which 1 ms to minimize.
[2023-03-21 20:54:41] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 1 ms to minimize.
[2023-03-21 20:54:41] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2023-03-21 20:54:42] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 0 ms to minimize.
[2023-03-21 20:54:42] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 0 ms to minimize.
[2023-03-21 20:54:42] [INFO ] Deduced a trap composed of 18 places in 124 ms of which 0 ms to minimize.
[2023-03-21 20:54:42] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1579 ms
[2023-03-21 20:54:42] [INFO ] After 3818ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 291 ms.
[2023-03-21 20:54:43] [INFO ] After 4993ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 358 ms.
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Partial Free-agglomeration rule applied 695 times.
Drop transitions removed 695 transitions
Iterating global reduction 0 with 695 rules applied. Total rules applied 695 place count 2500 transition count 2401
Applied a total of 695 rules in 162 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 162 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 2) seen :0
Finished probabilistic random walk after 89126 steps, run visited all 2 properties in 2105 ms. (steps per millisecond=42 )
Probabilistic random walk after 89126 steps, saw 87707 distinct states, run finished after 2107 ms. (steps per millisecond=42 ) properties seen :2
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 188 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 397 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 284 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 94 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2023-03-21 20:54:47] [INFO ] Invariant cache hit.
[2023-03-21 20:54:48] [INFO ] Implicit Places using invariants in 1384 ms returned []
[2023-03-21 20:54:48] [INFO ] Invariant cache hit.
[2023-03-21 20:54:53] [INFO ] Implicit Places using invariants and state equation in 4668 ms returned []
Implicit Place search using SMT with State Equation took 6054 ms to find 0 implicit places.
[2023-03-21 20:54:53] [INFO ] Invariant cache hit.
[2023-03-21 20:54:55] [INFO ] Dead Transitions using invariants and state equation in 1890 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8038 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 154 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 316 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 82233 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :{}
Probabilistic random walk after 82233 steps, saw 76613 distinct states, run finished after 3001 ms. (steps per millisecond=27 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-21 20:54:59] [INFO ] Invariant cache hit.
[2023-03-21 20:54:59] [INFO ] [Real]Absence check using 900 positive place invariants in 285 ms returned sat
[2023-03-21 20:55:01] [INFO ] After 2448ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 20:55:02] [INFO ] [Nat]Absence check using 900 positive place invariants in 324 ms returned sat
[2023-03-21 20:55:04] [INFO ] After 1575ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 20:55:04] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 1 ms to minimize.
[2023-03-21 20:55:04] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2023-03-21 20:55:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 475 ms
[2023-03-21 20:55:04] [INFO ] After 2297ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 226 ms.
[2023-03-21 20:55:05] [INFO ] After 3439ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 490 ms.
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Partial Free-agglomeration rule applied 695 times.
Drop transitions removed 695 transitions
Iterating global reduction 0 with 695 rules applied. Total rules applied 695 place count 2500 transition count 2401
Applied a total of 695 rules in 201 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 202 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 313 ms. (steps per millisecond=31 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Finished probabilistic random walk after 89126 steps, run visited all 2 properties in 2065 ms. (steps per millisecond=43 )
Probabilistic random walk after 89126 steps, saw 87707 distinct states, run finished after 2067 ms. (steps per millisecond=43 ) properties seen :2
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 164 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 400 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 465 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 279 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 19 reset in 1490 ms.
Product exploration explored 100000 steps with 19 reset in 1829 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 333 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 75 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
[2023-03-21 20:55:14] [INFO ] Redundant transitions in 542 ms returned [2395]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 2400 rows 2500 cols
[2023-03-21 20:55:14] [INFO ] Computed 900 place invariants in 6 ms
[2023-03-21 20:55:15] [INFO ] Dead Transitions using invariants and state equation in 1747 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2500/2500 places, 2400/2401 transitions.
Applied a total of 0 rules in 80 ms. Remains 2500 /2500 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2462 ms. Remains : 2500/2500 places, 2400/2401 transitions.
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2401/2401 transitions.
Applied a total of 0 rules in 62 ms. Remains 2500 /2500 variables (removed 0) and now considering 2401/2401 (removed 0) transitions.
// Phase 1: matrix 2401 rows 2500 cols
[2023-03-21 20:55:16] [INFO ] Computed 900 place invariants in 5 ms
[2023-03-21 20:55:18] [INFO ] Implicit Places using invariants in 2258 ms returned []
[2023-03-21 20:55:18] [INFO ] Invariant cache hit.
[2023-03-21 20:55:23] [INFO ] Implicit Places using invariants and state equation in 5257 ms returned []
Implicit Place search using SMT with State Equation took 7533 ms to find 0 implicit places.
[2023-03-21 20:55:23] [INFO ] Invariant cache hit.
[2023-03-21 20:55:25] [INFO ] Dead Transitions using invariants and state equation in 2201 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9814 ms. Remains : 2500/2500 places, 2401/2401 transitions.
Treatment of property ShieldIIPs-PT-100A-LTLCardinality-05 finished in 60756 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2023-03-21 20:55:26] [INFO ] Flatten gal took : 200 ms
[2023-03-21 20:55:26] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-21 20:55:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2503 places, 2403 transitions and 10806 arcs took 30 ms.
Total runtime 477849 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2255/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2255/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2255/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldIIPs-PT-100A-LTLCardinality-00
Could not compute solution for formula : ShieldIIPs-PT-100A-LTLCardinality-05
Could not compute solution for formula : ShieldIIPs-PT-100A-LTLCardinality-15

BK_STOP 1679432130246

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

+ 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name ShieldIIPs-PT-100A-LTLCardinality-00
ltl formula formula --ltl=/tmp/2255/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 2503 places, 2403 transitions and 10806 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.590 real 0.220 user 0.260 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2255/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2255/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2255/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2255/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name ShieldIIPs-PT-100A-LTLCardinality-05
ltl formula formula --ltl=/tmp/2255/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 2503 places, 2403 transitions and 10806 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.370 real 0.160 user 0.140 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2255/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2255/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2255/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2255/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name ShieldIIPs-PT-100A-LTLCardinality-15
ltl formula formula --ltl=/tmp/2255/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 2503 places, 2403 transitions and 10806 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.360 real 0.170 user 0.120 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2255/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2255/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2255/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2255/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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="ShieldIIPs-PT-100A"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is ShieldIIPs-PT-100A, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r393-oct2-167903716700163"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-100A.tgz
mv ShieldIIPs-PT-100A execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;