About the Execution of ITS-Tools for ShieldIIPt-PT-030B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 850.063 | 103599.00 | 153148.00 | 416.40 | FFFFFFFFFFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r222-tall-165286025000300.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldIIPt-PT-030B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025000300
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 768K
-rw-r--r-- 1 mcc users 7.6K Apr 29 18:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 29 18:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 29 18:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 29 18:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 08:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 512K May 10 09:34 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 ShieldIIPt-PT-030B-LTLFireability-00
FORMULA_NAME ShieldIIPt-PT-030B-LTLFireability-01
FORMULA_NAME ShieldIIPt-PT-030B-LTLFireability-02
FORMULA_NAME ShieldIIPt-PT-030B-LTLFireability-03
FORMULA_NAME ShieldIIPt-PT-030B-LTLFireability-04
FORMULA_NAME ShieldIIPt-PT-030B-LTLFireability-05
FORMULA_NAME ShieldIIPt-PT-030B-LTLFireability-06
FORMULA_NAME ShieldIIPt-PT-030B-LTLFireability-07
FORMULA_NAME ShieldIIPt-PT-030B-LTLFireability-08
FORMULA_NAME ShieldIIPt-PT-030B-LTLFireability-09
FORMULA_NAME ShieldIIPt-PT-030B-LTLFireability-10
FORMULA_NAME ShieldIIPt-PT-030B-LTLFireability-11
FORMULA_NAME ShieldIIPt-PT-030B-LTLFireability-12
FORMULA_NAME ShieldIIPt-PT-030B-LTLFireability-13
FORMULA_NAME ShieldIIPt-PT-030B-LTLFireability-14
FORMULA_NAME ShieldIIPt-PT-030B-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652960340673
Running Version 202205111006
[2022-05-19 11:39:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-19 11:39:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 11:39:02] [INFO ] Load time of PNML (sax parser for PT used): 161 ms
[2022-05-19 11:39:02] [INFO ] Transformed 2103 places.
[2022-05-19 11:39:02] [INFO ] Transformed 1953 transitions.
[2022-05-19 11:39:02] [INFO ] Found NUPN structural information;
[2022-05-19 11:39:02] [INFO ] Parsed PT model containing 2103 places and 1953 transitions in 320 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldIIPt-PT-030B-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030B-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030B-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 2103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2103/2103 places, 1953/1953 transitions.
Discarding 324 places :
Symmetric choice reduction at 0 with 324 rule applications. Total rules 324 place count 1779 transition count 1629
Iterating global reduction 0 with 324 rules applied. Total rules applied 648 place count 1779 transition count 1629
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 649 place count 1778 transition count 1628
Iterating global reduction 0 with 1 rules applied. Total rules applied 650 place count 1778 transition count 1628
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 651 place count 1777 transition count 1627
Iterating global reduction 0 with 1 rules applied. Total rules applied 652 place count 1777 transition count 1627
Applied a total of 652 rules in 889 ms. Remains 1777 /2103 variables (removed 326) and now considering 1627/1953 (removed 326) transitions.
// Phase 1: matrix 1627 rows 1777 cols
[2022-05-19 11:39:03] [INFO ] Computed 271 place invariants in 34 ms
[2022-05-19 11:39:04] [INFO ] Implicit Places using invariants in 1209 ms returned []
// Phase 1: matrix 1627 rows 1777 cols
[2022-05-19 11:39:04] [INFO ] Computed 271 place invariants in 26 ms
[2022-05-19 11:39:06] [INFO ] Implicit Places using invariants and state equation in 1591 ms returned []
Implicit Place search using SMT with State Equation took 2832 ms to find 0 implicit places.
// Phase 1: matrix 1627 rows 1777 cols
[2022-05-19 11:39:06] [INFO ] Computed 271 place invariants in 15 ms
[2022-05-19 11:39:06] [INFO ] Dead Transitions using invariants and state equation in 836 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1777/2103 places, 1627/1953 transitions.
Finished structural reductions, in 1 iterations. Remains : 1777/2103 places, 1627/1953 transitions.
Support contains 41 out of 1777 places after structural reductions.
[2022-05-19 11:39:07] [INFO ] Flatten gal took : 132 ms
[2022-05-19 11:39:07] [INFO ] Flatten gal took : 76 ms
[2022-05-19 11:39:07] [INFO ] Input system was already deterministic with 1627 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 604 ms. (steps per millisecond=16 ) properties (out of 36) seen :20
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 1627 rows 1777 cols
[2022-05-19 11:39:08] [INFO ] Computed 271 place invariants in 6 ms
[2022-05-19 11:39:09] [INFO ] [Real]Absence check using 271 positive place invariants in 82 ms returned sat
[2022-05-19 11:39:09] [INFO ] After 841ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2022-05-19 11:39:09] [INFO ] [Nat]Absence check using 271 positive place invariants in 84 ms returned sat
[2022-05-19 11:39:12] [INFO ] After 1660ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2022-05-19 11:39:12] [INFO ] Deduced a trap composed of 20 places in 370 ms of which 10 ms to minimize.
[2022-05-19 11:39:12] [INFO ] Deduced a trap composed of 28 places in 347 ms of which 2 ms to minimize.
[2022-05-19 11:39:13] [INFO ] Deduced a trap composed of 21 places in 362 ms of which 1 ms to minimize.
[2022-05-19 11:39:13] [INFO ] Deduced a trap composed of 12 places in 365 ms of which 1 ms to minimize.
[2022-05-19 11:39:14] [INFO ] Deduced a trap composed of 21 places in 308 ms of which 2 ms to minimize.
[2022-05-19 11:39:14] [INFO ] Deduced a trap composed of 21 places in 292 ms of which 1 ms to minimize.
[2022-05-19 11:39:14] [INFO ] Deduced a trap composed of 22 places in 410 ms of which 3 ms to minimize.
[2022-05-19 11:39:15] [INFO ] Deduced a trap composed of 22 places in 449 ms of which 2 ms to minimize.
[2022-05-19 11:39:16] [INFO ] Deduced a trap composed of 25 places in 591 ms of which 2 ms to minimize.
[2022-05-19 11:39:16] [INFO ] Deduced a trap composed of 23 places in 257 ms of which 1 ms to minimize.
[2022-05-19 11:39:16] [INFO ] Deduced a trap composed of 24 places in 279 ms of which 1 ms to minimize.
[2022-05-19 11:39:17] [INFO ] Deduced a trap composed of 26 places in 536 ms of which 3 ms to minimize.
[2022-05-19 11:39:17] [INFO ] Deduced a trap composed of 19 places in 241 ms of which 1 ms to minimize.
[2022-05-19 11:39:18] [INFO ] Deduced a trap composed of 18 places in 241 ms of which 1 ms to minimize.
[2022-05-19 11:39:18] [INFO ] Deduced a trap composed of 20 places in 243 ms of which 1 ms to minimize.
[2022-05-19 11:39:18] [INFO ] Deduced a trap composed of 27 places in 243 ms of which 0 ms to minimize.
[2022-05-19 11:39:18] [INFO ] Deduced a trap composed of 22 places in 258 ms of which 0 ms to minimize.
[2022-05-19 11:39:19] [INFO ] Deduced a trap composed of 27 places in 227 ms of which 1 ms to minimize.
[2022-05-19 11:39:19] [INFO ] Deduced a trap composed of 18 places in 215 ms of which 0 ms to minimize.
[2022-05-19 11:39:19] [INFO ] Deduced a trap composed of 26 places in 208 ms of which 0 ms to minimize.
[2022-05-19 11:39:20] [INFO ] Deduced a trap composed of 25 places in 206 ms of which 0 ms to minimize.
[2022-05-19 11:39:20] [INFO ] Deduced a trap composed of 32 places in 246 ms of which 0 ms to minimize.
[2022-05-19 11:39:20] [INFO ] Deduced a trap composed of 30 places in 205 ms of which 0 ms to minimize.
[2022-05-19 11:39:20] [INFO ] Deduced a trap composed of 25 places in 205 ms of which 0 ms to minimize.
[2022-05-19 11:39:21] [INFO ] Deduced a trap composed of 26 places in 192 ms of which 0 ms to minimize.
[2022-05-19 11:39:21] [INFO ] Deduced a trap composed of 33 places in 188 ms of which 1 ms to minimize.
[2022-05-19 11:39:21] [INFO ] Deduced a trap composed of 23 places in 185 ms of which 1 ms to minimize.
[2022-05-19 11:39:21] [INFO ] Deduced a trap composed of 31 places in 187 ms of which 1 ms to minimize.
[2022-05-19 11:39:22] [INFO ] Deduced a trap composed of 36 places in 185 ms of which 1 ms to minimize.
[2022-05-19 11:39:22] [INFO ] Deduced a trap composed of 35 places in 180 ms of which 1 ms to minimize.
[2022-05-19 11:39:22] [INFO ] Deduced a trap composed of 40 places in 185 ms of which 1 ms to minimize.
[2022-05-19 11:39:22] [INFO ] Deduced a trap composed of 47 places in 177 ms of which 1 ms to minimize.
[2022-05-19 11:39:23] [INFO ] Deduced a trap composed of 34 places in 191 ms of which 0 ms to minimize.
[2022-05-19 11:39:23] [INFO ] Deduced a trap composed of 40 places in 181 ms of which 4 ms to minimize.
[2022-05-19 11:39:23] [INFO ] Deduced a trap composed of 34 places in 173 ms of which 1 ms to minimize.
[2022-05-19 11:39:23] [INFO ] Deduced a trap composed of 43 places in 162 ms of which 0 ms to minimize.
[2022-05-19 11:39:23] [INFO ] Deduced a trap composed of 21 places in 173 ms of which 0 ms to minimize.
[2022-05-19 11:39:24] [INFO ] Deduced a trap composed of 41 places in 161 ms of which 1 ms to minimize.
[2022-05-19 11:39:24] [INFO ] Deduced a trap composed of 41 places in 156 ms of which 1 ms to minimize.
[2022-05-19 11:39:24] [INFO ] Deduced a trap composed of 44 places in 151 ms of which 1 ms to minimize.
[2022-05-19 11:39:24] [INFO ] Deduced a trap composed of 38 places in 158 ms of which 0 ms to minimize.
[2022-05-19 11:39:25] [INFO ] Deduced a trap composed of 46 places in 159 ms of which 0 ms to minimize.
[2022-05-19 11:39:25] [INFO ] Deduced a trap composed of 43 places in 142 ms of which 1 ms to minimize.
[2022-05-19 11:39:25] [INFO ] Deduced a trap composed of 39 places in 132 ms of which 0 ms to minimize.
[2022-05-19 11:39:25] [INFO ] Deduced a trap composed of 38 places in 129 ms of which 0 ms to minimize.
[2022-05-19 11:39:25] [INFO ] Deduced a trap composed of 42 places in 125 ms of which 0 ms to minimize.
[2022-05-19 11:39:26] [INFO ] Deduced a trap composed of 41 places in 129 ms of which 1 ms to minimize.
[2022-05-19 11:39:26] [INFO ] Deduced a trap composed of 43 places in 118 ms of which 0 ms to minimize.
[2022-05-19 11:39:26] [INFO ] Trap strengthening (SAT) tested/added 49/48 trap constraints in 14184 ms
[2022-05-19 11:39:26] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 0 ms to minimize.
[2022-05-19 11:39:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 220 ms
[2022-05-19 11:39:26] [INFO ] Deduced a trap composed of 45 places in 103 ms of which 1 ms to minimize.
[2022-05-19 11:39:27] [INFO ] Deduced a trap composed of 47 places in 103 ms of which 1 ms to minimize.
[2022-05-19 11:39:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 390 ms
[2022-05-19 11:39:28] [INFO ] After 17943ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 981 ms.
[2022-05-19 11:39:29] [INFO ] After 20156ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Fused 16 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 1233 ms.
Support contains 19 out of 1777 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1777/1777 places, 1627/1627 transitions.
Drop transitions removed 347 transitions
Trivial Post-agglo rules discarded 347 transitions
Performed 347 trivial Post agglomeration. Transition count delta: 347
Iterating post reduction 0 with 347 rules applied. Total rules applied 347 place count 1777 transition count 1280
Reduce places removed 347 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 352 rules applied. Total rules applied 699 place count 1430 transition count 1275
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 704 place count 1425 transition count 1275
Performed 232 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 232 Pre rules applied. Total rules applied 704 place count 1425 transition count 1043
Deduced a syphon composed of 232 places in 1 ms
Reduce places removed 232 places and 0 transitions.
Iterating global reduction 3 with 464 rules applied. Total rules applied 1168 place count 1193 transition count 1043
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 1173 place count 1188 transition count 1038
Iterating global reduction 3 with 5 rules applied. Total rules applied 1178 place count 1188 transition count 1038
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 1178 place count 1188 transition count 1033
Deduced a syphon composed of 5 places in 4 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 1188 place count 1183 transition count 1033
Performed 502 Post agglomeration using F-continuation condition.Transition count delta: 502
Deduced a syphon composed of 502 places in 2 ms
Reduce places removed 502 places and 0 transitions.
Iterating global reduction 3 with 1004 rules applied. Total rules applied 2192 place count 681 transition count 531
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2193 place count 681 transition count 530
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2195 place count 680 transition count 529
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: -51
Deduced a syphon composed of 83 places in 1 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 4 with 166 rules applied. Total rules applied 2361 place count 597 transition count 580
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2362 place count 597 transition count 579
Partial Free-agglomeration rule applied 32 times.
Drop transitions removed 32 transitions
Iterating global reduction 5 with 32 rules applied. Total rules applied 2394 place count 597 transition count 579
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2395 place count 596 transition count 578
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2397 place count 594 transition count 578
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 2397 place count 594 transition count 577
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2399 place count 593 transition count 577
Applied a total of 2399 rules in 439 ms. Remains 593 /1777 variables (removed 1184) and now considering 577/1627 (removed 1050) transitions.
Finished structural reductions, in 1 iterations. Remains : 593/1777 places, 577/1627 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 530 ms. (steps per millisecond=18 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 105703 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 105703 steps, saw 67669 distinct states, run finished after 3002 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 577 rows 593 cols
[2022-05-19 11:39:34] [INFO ] Computed 269 place invariants in 1 ms
[2022-05-19 11:39:34] [INFO ] [Real]Absence check using 269 positive place invariants in 39 ms returned sat
[2022-05-19 11:39:35] [INFO ] After 546ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2022-05-19 11:39:35] [INFO ] [Nat]Absence check using 269 positive place invariants in 33 ms returned sat
[2022-05-19 11:39:36] [INFO ] After 529ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2022-05-19 11:39:36] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-19 11:39:36] [INFO ] After 357ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2022-05-19 11:39:37] [INFO ] After 938ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 372 ms.
[2022-05-19 11:39:37] [INFO ] After 2220ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Fused 15 Parikh solutions to 14 different solutions.
Parikh walk visited 0 properties in 248 ms.
Support contains 16 out of 593 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 593/593 places, 577/577 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 593 transition count 575
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 591 transition count 575
Applied a total of 4 rules in 54 ms. Remains 591 /593 variables (removed 2) and now considering 575/577 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 591/593 places, 575/577 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 552 ms. (steps per millisecond=18 ) properties (out of 15) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 149 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 128 ms. (steps per millisecond=78 ) properties (out of 7) 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 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 575 rows 591 cols
[2022-05-19 11:39:39] [INFO ] Computed 269 place invariants in 1 ms
[2022-05-19 11:39:39] [INFO ] After 212ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-19 11:39:39] [INFO ] [Nat]Absence check using 269 positive place invariants in 30 ms returned sat
[2022-05-19 11:39:39] [INFO ] After 317ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-05-19 11:39:39] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-19 11:39:40] [INFO ] After 155ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2022-05-19 11:39:40] [INFO ] After 413ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 167 ms.
[2022-05-19 11:39:40] [INFO ] After 1142ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 108 ms.
Support contains 9 out of 591 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 591/591 places, 575/575 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 591 transition count 573
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 589 transition count 573
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4 place count 589 transition count 569
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 12 place count 585 transition count 569
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 584 transition count 568
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 20 place count 581 transition count 570
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 581 transition count 568
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 24 place count 579 transition count 568
Applied a total of 24 rules in 74 ms. Remains 579 /591 variables (removed 12) and now considering 568/575 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 579/591 places, 568/575 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 288 ms. (steps per millisecond=34 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 124233 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 124233 steps, saw 79513 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 568 rows 579 cols
[2022-05-19 11:39:44] [INFO ] Computed 269 place invariants in 5 ms
[2022-05-19 11:39:44] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-19 11:39:44] [INFO ] [Nat]Absence check using 269 positive place invariants in 35 ms returned sat
[2022-05-19 11:39:45] [INFO ] After 360ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-05-19 11:39:45] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-19 11:39:45] [INFO ] After 166ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2022-05-19 11:39:45] [INFO ] After 441ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 175 ms.
[2022-05-19 11:39:45] [INFO ] After 1209ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 183 ms.
Support contains 9 out of 579 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 579/579 places, 568/568 transitions.
Applied a total of 0 rules in 16 ms. Remains 579 /579 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 579/579 places, 568/568 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 579/579 places, 568/568 transitions.
Applied a total of 0 rules in 11 ms. Remains 579 /579 variables (removed 0) and now considering 568/568 (removed 0) transitions.
// Phase 1: matrix 568 rows 579 cols
[2022-05-19 11:39:46] [INFO ] Computed 269 place invariants in 2 ms
[2022-05-19 11:39:46] [INFO ] Implicit Places using invariants in 301 ms returned [568]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 307 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 578/579 places, 568/568 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 577 transition count 567
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 577 transition count 567
Applied a total of 2 rules in 19 ms. Remains 577 /578 variables (removed 1) and now considering 567/568 (removed 1) transitions.
// Phase 1: matrix 567 rows 577 cols
[2022-05-19 11:39:46] [INFO ] Computed 268 place invariants in 3 ms
[2022-05-19 11:39:46] [INFO ] Implicit Places using invariants in 294 ms returned []
// Phase 1: matrix 567 rows 577 cols
[2022-05-19 11:39:46] [INFO ] Computed 268 place invariants in 1 ms
[2022-05-19 11:39:46] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-19 11:39:47] [INFO ] Implicit Places using invariants and state equation in 570 ms returned []
Implicit Place search using SMT with State Equation took 865 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 577/579 places, 567/568 transitions.
Finished structural reductions, in 2 iterations. Remains : 577/579 places, 567/568 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 305 ms. (steps per millisecond=32 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 137966 steps, run timeout after 3004 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 137966 steps, saw 88949 distinct states, run finished after 3004 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 567 rows 577 cols
[2022-05-19 11:39:50] [INFO ] Computed 268 place invariants in 2 ms
[2022-05-19 11:39:51] [INFO ] After 141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-19 11:39:51] [INFO ] [Nat]Absence check using 268 positive place invariants in 35 ms returned sat
[2022-05-19 11:39:51] [INFO ] After 333ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-05-19 11:39:51] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-19 11:39:51] [INFO ] After 166ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2022-05-19 11:39:52] [INFO ] After 435ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 175 ms.
[2022-05-19 11:39:52] [INFO ] After 1169ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 124 ms.
Support contains 9 out of 577 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 577/577 places, 567/567 transitions.
Applied a total of 0 rules in 23 ms. Remains 577 /577 variables (removed 0) and now considering 567/567 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 577/577 places, 567/567 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 577/577 places, 567/567 transitions.
Applied a total of 0 rules in 10 ms. Remains 577 /577 variables (removed 0) and now considering 567/567 (removed 0) transitions.
// Phase 1: matrix 567 rows 577 cols
[2022-05-19 11:39:52] [INFO ] Computed 268 place invariants in 3 ms
[2022-05-19 11:39:52] [INFO ] Implicit Places using invariants in 302 ms returned []
// Phase 1: matrix 567 rows 577 cols
[2022-05-19 11:39:52] [INFO ] Computed 268 place invariants in 3 ms
[2022-05-19 11:39:53] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-19 11:39:53] [INFO ] Implicit Places using invariants and state equation in 568 ms returned []
Implicit Place search using SMT with State Equation took 871 ms to find 0 implicit places.
[2022-05-19 11:39:53] [INFO ] Redundant transitions in 33 ms returned []
// Phase 1: matrix 567 rows 577 cols
[2022-05-19 11:39:53] [INFO ] Computed 268 place invariants in 4 ms
[2022-05-19 11:39:53] [INFO ] Dead Transitions using invariants and state equation in 276 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 577/577 places, 567/567 transitions.
Partial Free-agglomeration rule applied 59 times.
Drop transitions removed 59 transitions
Iterating global reduction 0 with 59 rules applied. Total rules applied 59 place count 577 transition count 567
Applied a total of 59 rules in 28 ms. Remains 577 /577 variables (removed 0) and now considering 567/567 (removed 0) transitions.
Running SMT prover for 7 properties.
// Phase 1: matrix 567 rows 577 cols
[2022-05-19 11:39:53] [INFO ] Computed 268 place invariants in 3 ms
[2022-05-19 11:39:53] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-05-19 11:39:53] [INFO ] [Nat]Absence check using 268 positive place invariants in 37 ms returned sat
[2022-05-19 11:39:54] [INFO ] After 338ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2022-05-19 11:39:54] [INFO ] State equation strengthened by 56 read => feed constraints.
[2022-05-19 11:39:54] [INFO ] After 216ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2022-05-19 11:39:54] [INFO ] After 563ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 187 ms.
[2022-05-19 11:39:55] [INFO ] After 1328ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
[2022-05-19 11:39:55] [INFO ] Flatten gal took : 34 ms
[2022-05-19 11:39:55] [INFO ] Flatten gal took : 30 ms
[2022-05-19 11:39:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4086071438318424495.gal : 13 ms
[2022-05-19 11:39:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6781910112590269345.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms9303407659593907430;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4086071438318424495.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6781910112590269345.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality6781910112590269345.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :2 after 20
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :20 after 58
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :58 after 122
Reachability property AtomicPropp7 is true.
Reachability property AtomicPropp6 is true.
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :122 after 238
Reachability property AtomicPropp22 is true.
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :238 after 479
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :479 after 863
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :863 after 1570
Reachability property AtomicPropp35 is true.
Reachability property AtomicPropp19 is true.
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1570 after 61856
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :61856 after 288650
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :288650 after 1.81959e+06
Reachability property AtomicPropp10 is true.
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.81959e+06 after 4.40345e+07
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :4.40345e+07 after 2.46762e+08
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2.46762e+08 after 6.33151e+08
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :6.33151e+08 after 2.50636e+11
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2.50636e+11 after 2.63018e+14
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2.63018e+14 after 2.19518e+20
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :2.19518e+20 after 3.26597e+28
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :3.26597e+28 after 2.27285e+37
Reachability property AtomicPropp31 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65537 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,4.8809e+51,12.7762,336496,2,28872,31,1.12466e+06,6,0,2849,2.60699e+06,0
Total reachable state count : 4.880895686413784006618215465443922436807e+51
Verifying 7 reachability properties.
Reachability property AtomicPropp6 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp6,1,12.7801,336496,2,578,31,1.12466e+06,7,0,2852,2.60699e+06,0
Reachability property AtomicPropp7 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp7,4.08566e+26,12.782,336496,2,1019,31,1.12466e+06,8,0,2854,2.60699e+06,0
Reachability property AtomicPropp10 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp10,2.46546e+08,12.783,336496,2,712,31,1.12466e+06,9,0,2856,2.60699e+06,0
Reachability property AtomicPropp19 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp19,755712,12.784,336496,2,645,31,1.12466e+06,10,0,2858,2.60699e+06,0
Reachability property AtomicPropp22 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp22,3,12.7851,336496,2,581,31,1.12466e+06,11,0,2860,2.60699e+06,0
Reachability property AtomicPropp31 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp31,1.24684e+20,12.7861,336496,2,925,31,1.12466e+06,12,0,2865,2.60699e+06,0
Reachability property AtomicPropp35 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicPropp35,43008,12.7872,336496,2,606,31,1.12466e+06,13,0,2870,2.60699e+06,0
FORMULA ShieldIIPt-PT-030B-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 481 stabilizing places and 481 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (G(X(G(F(G(p1)))))&&p2)))'
Support contains 3 out of 1777 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1777/1777 places, 1627/1627 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1771 transition count 1621
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1771 transition count 1621
Applied a total of 12 rules in 146 ms. Remains 1771 /1777 variables (removed 6) and now considering 1621/1627 (removed 6) transitions.
// Phase 1: matrix 1621 rows 1771 cols
[2022-05-19 11:40:08] [INFO ] Computed 271 place invariants in 5 ms
[2022-05-19 11:40:09] [INFO ] Implicit Places using invariants in 600 ms returned []
// Phase 1: matrix 1621 rows 1771 cols
[2022-05-19 11:40:09] [INFO ] Computed 271 place invariants in 5 ms
[2022-05-19 11:40:10] [INFO ] Implicit Places using invariants and state equation in 1397 ms returned []
Implicit Place search using SMT with State Equation took 1998 ms to find 0 implicit places.
// Phase 1: matrix 1621 rows 1771 cols
[2022-05-19 11:40:10] [INFO ] Computed 271 place invariants in 4 ms
[2022-05-19 11:40:11] [INFO ] Dead Transitions using invariants and state equation in 865 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1771/1777 places, 1621/1627 transitions.
Finished structural reductions, in 1 iterations. Remains : 1771/1777 places, 1621/1627 transitions.
Stuttering acceptance computed with spot in 372 ms :[(OR (NOT p2) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s1480 1), p0:(EQ s823 1), p1:(EQ s729 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA ShieldIIPt-PT-030B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-LTLFireability-01 finished in 3482 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((X(p0)||p0))&&X(G(p1)))))'
Support contains 2 out of 1777 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1777/1777 places, 1627/1627 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1771 transition count 1621
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1771 transition count 1621
Applied a total of 12 rules in 130 ms. Remains 1771 /1777 variables (removed 6) and now considering 1621/1627 (removed 6) transitions.
// Phase 1: matrix 1621 rows 1771 cols
[2022-05-19 11:40:12] [INFO ] Computed 271 place invariants in 12 ms
[2022-05-19 11:40:12] [INFO ] Implicit Places using invariants in 486 ms returned []
// Phase 1: matrix 1621 rows 1771 cols
[2022-05-19 11:40:12] [INFO ] Computed 271 place invariants in 12 ms
[2022-05-19 11:40:13] [INFO ] Implicit Places using invariants and state equation in 1412 ms returned []
Implicit Place search using SMT with State Equation took 1900 ms to find 0 implicit places.
// Phase 1: matrix 1621 rows 1771 cols
[2022-05-19 11:40:13] [INFO ] Computed 271 place invariants in 4 ms
[2022-05-19 11:40:14] [INFO ] Dead Transitions using invariants and state equation in 780 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1771/1777 places, 1621/1627 transitions.
Finished structural reductions, in 1 iterations. Remains : 1771/1777 places, 1621/1627 transitions.
Stuttering acceptance computed with spot in 164 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p1:(EQ s1316 1), p0:(EQ s742 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-030B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-LTLFireability-02 finished in 3000 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(F(p0)&&X(G(p0))&&G(p1))))'
Support contains 2 out of 1777 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1777/1777 places, 1627/1627 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1771 transition count 1621
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1771 transition count 1621
Applied a total of 12 rules in 132 ms. Remains 1771 /1777 variables (removed 6) and now considering 1621/1627 (removed 6) transitions.
// Phase 1: matrix 1621 rows 1771 cols
[2022-05-19 11:40:15] [INFO ] Computed 271 place invariants in 12 ms
[2022-05-19 11:40:15] [INFO ] Implicit Places using invariants in 510 ms returned []
// Phase 1: matrix 1621 rows 1771 cols
[2022-05-19 11:40:15] [INFO ] Computed 271 place invariants in 3 ms
[2022-05-19 11:40:17] [INFO ] Implicit Places using invariants and state equation in 1473 ms returned []
Implicit Place search using SMT with State Equation took 1985 ms to find 0 implicit places.
// Phase 1: matrix 1621 rows 1771 cols
[2022-05-19 11:40:17] [INFO ] Computed 271 place invariants in 8 ms
[2022-05-19 11:40:17] [INFO ] Dead Transitions using invariants and state equation in 839 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1771/1777 places, 1621/1627 transitions.
Finished structural reductions, in 1 iterations. Remains : 1771/1777 places, 1621/1627 transitions.
Stuttering acceptance computed with spot in 149 ms :[true, (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s1230 1), p1:(EQ s42 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-030B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-LTLFireability-03 finished in 3135 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(X(p1)))))'
Support contains 2 out of 1777 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1777/1777 places, 1627/1627 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1772 transition count 1622
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1772 transition count 1622
Applied a total of 10 rules in 138 ms. Remains 1772 /1777 variables (removed 5) and now considering 1622/1627 (removed 5) transitions.
// Phase 1: matrix 1622 rows 1772 cols
[2022-05-19 11:40:18] [INFO ] Computed 271 place invariants in 10 ms
[2022-05-19 11:40:18] [INFO ] Implicit Places using invariants in 488 ms returned []
// Phase 1: matrix 1622 rows 1772 cols
[2022-05-19 11:40:18] [INFO ] Computed 271 place invariants in 4 ms
[2022-05-19 11:40:20] [INFO ] Implicit Places using invariants and state equation in 1512 ms returned []
Implicit Place search using SMT with State Equation took 2001 ms to find 0 implicit places.
// Phase 1: matrix 1622 rows 1772 cols
[2022-05-19 11:40:20] [INFO ] Computed 271 place invariants in 4 ms
[2022-05-19 11:40:21] [INFO ] Dead Transitions using invariants and state equation in 814 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1772/1777 places, 1622/1627 transitions.
Finished structural reductions, in 1 iterations. Remains : 1772/1777 places, 1622/1627 transitions.
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s519 1), p1:(EQ s1525 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 45 reset in 684 ms.
Stack based approach found an accepted trace after 2100 steps with 1 reset with depth 968 and stack size 968 in 14 ms.
FORMULA ShieldIIPt-PT-030B-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-030B-LTLFireability-04 finished in 3796 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(((p1 U p2)||!p3))))'
Support contains 3 out of 1777 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1777/1777 places, 1627/1627 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 356 transitions
Trivial Post-agglo rules discarded 356 transitions
Performed 356 trivial Post agglomeration. Transition count delta: 356
Iterating post reduction 0 with 356 rules applied. Total rules applied 356 place count 1776 transition count 1270
Reduce places removed 356 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 357 rules applied. Total rules applied 713 place count 1420 transition count 1269
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 714 place count 1419 transition count 1269
Performed 239 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 239 Pre rules applied. Total rules applied 714 place count 1419 transition count 1030
Deduced a syphon composed of 239 places in 1 ms
Reduce places removed 239 places and 0 transitions.
Iterating global reduction 3 with 478 rules applied. Total rules applied 1192 place count 1180 transition count 1030
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 1197 place count 1175 transition count 1025
Iterating global reduction 3 with 5 rules applied. Total rules applied 1202 place count 1175 transition count 1025
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 1202 place count 1175 transition count 1021
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 1210 place count 1171 transition count 1021
Performed 505 Post agglomeration using F-continuation condition.Transition count delta: 505
Deduced a syphon composed of 505 places in 0 ms
Reduce places removed 505 places and 0 transitions.
Iterating global reduction 3 with 1010 rules applied. Total rules applied 2220 place count 666 transition count 516
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2221 place count 666 transition count 515
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2223 place count 665 transition count 514
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -58
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 4 with 176 rules applied. Total rules applied 2399 place count 577 transition count 572
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2401 place count 575 transition count 570
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2403 place count 573 transition count 570
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2403 place count 573 transition count 569
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2405 place count 572 transition count 569
Applied a total of 2405 rules in 278 ms. Remains 572 /1777 variables (removed 1205) and now considering 569/1627 (removed 1058) transitions.
// Phase 1: matrix 569 rows 572 cols
[2022-05-19 11:40:22] [INFO ] Computed 269 place invariants in 3 ms
[2022-05-19 11:40:22] [INFO ] Implicit Places using invariants in 278 ms returned [561]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 279 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 571/1777 places, 569/1627 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 570 transition count 568
Applied a total of 2 rules in 18 ms. Remains 570 /571 variables (removed 1) and now considering 568/569 (removed 1) transitions.
// Phase 1: matrix 568 rows 570 cols
[2022-05-19 11:40:22] [INFO ] Computed 268 place invariants in 2 ms
[2022-05-19 11:40:22] [INFO ] Implicit Places using invariants in 274 ms returned []
// Phase 1: matrix 568 rows 570 cols
[2022-05-19 11:40:22] [INFO ] Computed 268 place invariants in 1 ms
[2022-05-19 11:40:23] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-19 11:40:23] [INFO ] Implicit Places using invariants and state equation in 546 ms returned []
Implicit Place search using SMT with State Equation took 821 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 570/1777 places, 568/1627 transitions.
Finished structural reductions, in 2 iterations. Remains : 570/1777 places, 568/1627 transitions.
Stuttering acceptance computed with spot in 240 ms :[(AND (NOT p2) p3), true, (NOT p2), (AND (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p2) p3)]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p3) p0) (AND p2 p0) (AND p1 p0)), acceptance={} source=0 dest: 0}, { cond=(AND p3 (NOT p2) (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p3 (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p3 (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p3) (NOT p0)) (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=0 dest: 3}, { cond=(AND p3 (NOT p2) p1 p0), acceptance={0} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND p3 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p3 (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(OR (NOT p3) p2 p1), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1) p0), acceptance={} source=4 dest: 0}, { cond=(AND p3 (NOT p2) (NOT p1) p0), acceptance={0} source=4 dest: 0}, { cond=(AND p3 (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND p3 (NOT p2) p1 (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p1 p0), acceptance={} source=4 dest: 4}, { cond=(AND p3 (NOT p2) p1 p0), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(AND p3 (NOT p2) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND p3 (NOT p2) p1), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p3:(OR (EQ s304 1) (EQ s48 1)), p0:(EQ s304 1), p2:(EQ s287 1), p1:(EQ s48 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-030B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-LTLFireability-05 finished in 1840 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((F(X(G(p0)))&&G((p1 U p2))))))'
Support contains 3 out of 1777 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1777/1777 places, 1627/1627 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 357 transitions
Trivial Post-agglo rules discarded 357 transitions
Performed 357 trivial Post agglomeration. Transition count delta: 357
Iterating post reduction 0 with 357 rules applied. Total rules applied 357 place count 1776 transition count 1269
Reduce places removed 357 places and 0 transitions.
Iterating post reduction 1 with 357 rules applied. Total rules applied 714 place count 1419 transition count 1269
Performed 239 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 239 Pre rules applied. Total rules applied 714 place count 1419 transition count 1030
Deduced a syphon composed of 239 places in 2 ms
Reduce places removed 239 places and 0 transitions.
Iterating global reduction 2 with 478 rules applied. Total rules applied 1192 place count 1180 transition count 1030
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1197 place count 1175 transition count 1025
Iterating global reduction 2 with 5 rules applied. Total rules applied 1202 place count 1175 transition count 1025
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1202 place count 1175 transition count 1021
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1210 place count 1171 transition count 1021
Performed 504 Post agglomeration using F-continuation condition.Transition count delta: 504
Deduced a syphon composed of 504 places in 0 ms
Reduce places removed 504 places and 0 transitions.
Iterating global reduction 2 with 1008 rules applied. Total rules applied 2218 place count 667 transition count 517
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2219 place count 667 transition count 516
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2221 place count 666 transition count 515
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -57
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 2397 place count 578 transition count 572
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2399 place count 576 transition count 570
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2401 place count 574 transition count 570
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2401 place count 574 transition count 569
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2403 place count 573 transition count 569
Applied a total of 2403 rules in 273 ms. Remains 573 /1777 variables (removed 1204) and now considering 569/1627 (removed 1058) transitions.
// Phase 1: matrix 569 rows 573 cols
[2022-05-19 11:40:23] [INFO ] Computed 269 place invariants in 2 ms
[2022-05-19 11:40:24] [INFO ] Implicit Places using invariants in 361 ms returned [562]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 366 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 572/1777 places, 569/1627 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 571 transition count 568
Applied a total of 2 rules in 15 ms. Remains 571 /572 variables (removed 1) and now considering 568/569 (removed 1) transitions.
// Phase 1: matrix 568 rows 571 cols
[2022-05-19 11:40:24] [INFO ] Computed 268 place invariants in 1 ms
[2022-05-19 11:40:24] [INFO ] Implicit Places using invariants in 318 ms returned []
// Phase 1: matrix 568 rows 571 cols
[2022-05-19 11:40:24] [INFO ] Computed 268 place invariants in 5 ms
[2022-05-19 11:40:24] [INFO ] State equation strengthened by 198 read => feed constraints.
[2022-05-19 11:40:26] [INFO ] Implicit Places using invariants and state equation in 1587 ms returned []
Implicit Place search using SMT with State Equation took 1908 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 571/1777 places, 568/1627 transitions.
Finished structural reductions, in 2 iterations. Remains : 571/1777 places, 568/1627 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(OR p2 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 1}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(EQ s1 1), p1:(EQ s501 1), p0:(EQ s151 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-030B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-LTLFireability-07 finished in 2709 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(G((F(p0)&&p1))))&&(p2 U G(p0))))'
Support contains 3 out of 1777 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1777/1777 places, 1627/1627 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 357 transitions
Trivial Post-agglo rules discarded 357 transitions
Performed 357 trivial Post agglomeration. Transition count delta: 357
Iterating post reduction 0 with 357 rules applied. Total rules applied 357 place count 1776 transition count 1269
Reduce places removed 357 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 358 rules applied. Total rules applied 715 place count 1419 transition count 1268
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 716 place count 1418 transition count 1268
Performed 238 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 238 Pre rules applied. Total rules applied 716 place count 1418 transition count 1030
Deduced a syphon composed of 238 places in 3 ms
Reduce places removed 238 places and 0 transitions.
Iterating global reduction 3 with 476 rules applied. Total rules applied 1192 place count 1180 transition count 1030
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1198 place count 1174 transition count 1024
Iterating global reduction 3 with 6 rules applied. Total rules applied 1204 place count 1174 transition count 1024
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 1204 place count 1174 transition count 1019
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 1214 place count 1169 transition count 1019
Performed 502 Post agglomeration using F-continuation condition.Transition count delta: 502
Deduced a syphon composed of 502 places in 0 ms
Reduce places removed 502 places and 0 transitions.
Iterating global reduction 3 with 1004 rules applied. Total rules applied 2218 place count 667 transition count 517
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2219 place count 667 transition count 516
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2221 place count 666 transition count 515
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -57
Deduced a syphon composed of 88 places in 1 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 4 with 176 rules applied. Total rules applied 2397 place count 578 transition count 572
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2399 place count 576 transition count 570
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2401 place count 574 transition count 570
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2401 place count 574 transition count 569
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2403 place count 573 transition count 569
Applied a total of 2403 rules in 243 ms. Remains 573 /1777 variables (removed 1204) and now considering 569/1627 (removed 1058) transitions.
// Phase 1: matrix 569 rows 573 cols
[2022-05-19 11:40:26] [INFO ] Computed 269 place invariants in 0 ms
[2022-05-19 11:40:27] [INFO ] Implicit Places using invariants in 459 ms returned [562]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 461 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 572/1777 places, 569/1627 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 571 transition count 568
Applied a total of 2 rules in 15 ms. Remains 571 /572 variables (removed 1) and now considering 568/569 (removed 1) transitions.
// Phase 1: matrix 568 rows 571 cols
[2022-05-19 11:40:27] [INFO ] Computed 268 place invariants in 3 ms
[2022-05-19 11:40:27] [INFO ] Implicit Places using invariants in 367 ms returned []
// Phase 1: matrix 568 rows 571 cols
[2022-05-19 11:40:27] [INFO ] Computed 268 place invariants in 1 ms
[2022-05-19 11:40:27] [INFO ] State equation strengthened by 125 read => feed constraints.
[2022-05-19 11:40:28] [INFO ] Implicit Places using invariants and state equation in 1183 ms returned []
Implicit Place search using SMT with State Equation took 1553 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 571/1777 places, 568/1627 transitions.
Finished structural reductions, in 2 iterations. Remains : 571/1777 places, 568/1627 transitions.
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(OR p0 p2), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=p2, acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p0 p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s43 1), p2:(NEQ s1 1), p1:(EQ s362 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-030B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-LTLFireability-08 finished in 2520 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((((p0 U p1)||X(!p1)) U X(p2)))'
Support contains 4 out of 1777 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1777/1777 places, 1627/1627 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1772 transition count 1622
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1772 transition count 1622
Applied a total of 10 rules in 133 ms. Remains 1772 /1777 variables (removed 5) and now considering 1622/1627 (removed 5) transitions.
// Phase 1: matrix 1622 rows 1772 cols
[2022-05-19 11:40:29] [INFO ] Computed 271 place invariants in 9 ms
[2022-05-19 11:40:29] [INFO ] Implicit Places using invariants in 481 ms returned []
// Phase 1: matrix 1622 rows 1772 cols
[2022-05-19 11:40:29] [INFO ] Computed 271 place invariants in 4 ms
[2022-05-19 11:40:30] [INFO ] Implicit Places using invariants and state equation in 1338 ms returned []
Implicit Place search using SMT with State Equation took 1823 ms to find 0 implicit places.
// Phase 1: matrix 1622 rows 1772 cols
[2022-05-19 11:40:30] [INFO ] Computed 271 place invariants in 10 ms
[2022-05-19 11:40:31] [INFO ] Dead Transitions using invariants and state equation in 886 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1772/1777 places, 1622/1627 transitions.
Finished structural reductions, in 1 iterations. Remains : 1772/1777 places, 1622/1627 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p2), true, (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(NEQ s1027 1), p0:(EQ s68 1), p2:(AND (EQ s1616 1) (EQ s1648 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 428 steps with 0 reset in 5 ms.
FORMULA ShieldIIPt-PT-030B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-LTLFireability-09 finished in 3006 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&!(F(p1) U X(X((F(p2)&&p3))))))'
Support contains 6 out of 1777 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1777/1777 places, 1627/1627 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1772 transition count 1622
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1772 transition count 1622
Applied a total of 10 rules in 150 ms. Remains 1772 /1777 variables (removed 5) and now considering 1622/1627 (removed 5) transitions.
// Phase 1: matrix 1622 rows 1772 cols
[2022-05-19 11:40:32] [INFO ] Computed 271 place invariants in 6 ms
[2022-05-19 11:40:32] [INFO ] Implicit Places using invariants in 502 ms returned []
// Phase 1: matrix 1622 rows 1772 cols
[2022-05-19 11:40:32] [INFO ] Computed 271 place invariants in 5 ms
[2022-05-19 11:40:34] [INFO ] Implicit Places using invariants and state equation in 1534 ms returned []
Implicit Place search using SMT with State Equation took 2038 ms to find 0 implicit places.
// Phase 1: matrix 1622 rows 1772 cols
[2022-05-19 11:40:34] [INFO ] Computed 271 place invariants in 4 ms
[2022-05-19 11:40:35] [INFO ] Dead Transitions using invariants and state equation in 881 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1772/1777 places, 1622/1627 transitions.
Finished structural reductions, in 1 iterations. Remains : 1772/1777 places, 1622/1627 transitions.
Stuttering acceptance computed with spot in 474 ms :[(OR (NOT p0) (AND p2 p3)), (AND p2 p3), (AND p2 p3), (NOT p0), (AND p1 p3 p2), (AND p2 p3), true, p2, (AND p1 p2 p3), (AND p2 p1 p3), (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), (AND p2 p1 (NOT p3))]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 1}, { cond=p1, acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 8}], [{ cond=(AND p3 p2), acceptance={} source=5 dest: 6}, { cond=(AND p3 (NOT p2)), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=p2, acceptance={} source=7 dest: 6}, { cond=(NOT p2), acceptance={} source=7 dest: 7}], [{ cond=p1, acceptance={} source=8 dest: 5}, { cond=(NOT p1), acceptance={} source=8 dest: 9}], [{ cond=(AND p1 p3 p2), acceptance={} source=9 dest: 6}, { cond=(AND p1 p3 (NOT p2)), acceptance={} source=9 dest: 7}, { cond=(AND (NOT p1) p3 p2), acceptance={} source=9 dest: 10}, { cond=(AND (NOT p1) p3 (NOT p2)), acceptance={} source=9 dest: 11}], [{ cond=(OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), acceptance={} source=10 dest: 6}, { cond=(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), acceptance={} source=10 dest: 10}], [{ cond=(AND p1 (NOT p3) p2), acceptance={} source=11 dest: 6}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=11 dest: 7}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=11 dest: 10}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=11 dest: 11}]], initial=0, aps=[p1:(EQ s651 1), p0:(EQ s1366 0), p3:(NEQ s932 1), p2:(AND (EQ s1565 1) (EQ s1590 1) (EQ s1599 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 618 steps with 1 reset in 7 ms.
FORMULA ShieldIIPt-PT-030B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-LTLFireability-10 finished in 3588 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(X((G((p0 U p1))||p1))) U p2)))'
Support contains 2 out of 1777 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1777/1777 places, 1627/1627 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 355 transitions
Trivial Post-agglo rules discarded 355 transitions
Performed 355 trivial Post agglomeration. Transition count delta: 355
Iterating post reduction 0 with 355 rules applied. Total rules applied 355 place count 1776 transition count 1271
Reduce places removed 355 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 357 rules applied. Total rules applied 712 place count 1421 transition count 1269
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 714 place count 1419 transition count 1269
Performed 238 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 238 Pre rules applied. Total rules applied 714 place count 1419 transition count 1031
Deduced a syphon composed of 238 places in 1 ms
Reduce places removed 238 places and 0 transitions.
Iterating global reduction 3 with 476 rules applied. Total rules applied 1190 place count 1181 transition count 1031
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1196 place count 1175 transition count 1025
Iterating global reduction 3 with 6 rules applied. Total rules applied 1202 place count 1175 transition count 1025
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 1202 place count 1175 transition count 1020
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 1212 place count 1170 transition count 1020
Performed 504 Post agglomeration using F-continuation condition.Transition count delta: 504
Deduced a syphon composed of 504 places in 0 ms
Reduce places removed 504 places and 0 transitions.
Iterating global reduction 3 with 1008 rules applied. Total rules applied 2220 place count 666 transition count 516
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2221 place count 666 transition count 515
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2223 place count 665 transition count 514
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: -55
Deduced a syphon composed of 87 places in 1 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 4 with 174 rules applied. Total rules applied 2397 place count 578 transition count 569
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2399 place count 576 transition count 567
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2401 place count 574 transition count 567
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2401 place count 574 transition count 566
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2403 place count 573 transition count 566
Applied a total of 2403 rules in 264 ms. Remains 573 /1777 variables (removed 1204) and now considering 566/1627 (removed 1061) transitions.
// Phase 1: matrix 566 rows 573 cols
[2022-05-19 11:40:35] [INFO ] Computed 269 place invariants in 1 ms
[2022-05-19 11:40:36] [INFO ] Implicit Places using invariants in 428 ms returned [562]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 430 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 572/1777 places, 566/1627 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 571 transition count 565
Applied a total of 2 rules in 13 ms. Remains 571 /572 variables (removed 1) and now considering 565/566 (removed 1) transitions.
// Phase 1: matrix 565 rows 571 cols
[2022-05-19 11:40:36] [INFO ] Computed 268 place invariants in 0 ms
[2022-05-19 11:40:36] [INFO ] Implicit Places using invariants in 341 ms returned []
// Phase 1: matrix 565 rows 571 cols
[2022-05-19 11:40:36] [INFO ] Computed 268 place invariants in 1 ms
[2022-05-19 11:40:36] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-19 11:40:37] [INFO ] Implicit Places using invariants and state equation in 523 ms returned []
Implicit Place search using SMT with State Equation took 880 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 571/1777 places, 565/1627 transitions.
Finished structural reductions, in 2 iterations. Remains : 571/1777 places, 565/1627 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p2), (OR (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (EQ s292 1) (EQ s136 1)), p1:(EQ s292 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-030B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-LTLFireability-11 finished in 1732 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(X(p0)))&&X(G(p1)))))'
Support contains 2 out of 1777 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1777/1777 places, 1627/1627 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1771 transition count 1621
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1771 transition count 1621
Applied a total of 12 rules in 124 ms. Remains 1771 /1777 variables (removed 6) and now considering 1621/1627 (removed 6) transitions.
// Phase 1: matrix 1621 rows 1771 cols
[2022-05-19 11:40:37] [INFO ] Computed 271 place invariants in 10 ms
[2022-05-19 11:40:37] [INFO ] Implicit Places using invariants in 460 ms returned []
// Phase 1: matrix 1621 rows 1771 cols
[2022-05-19 11:40:37] [INFO ] Computed 271 place invariants in 8 ms
[2022-05-19 11:40:39] [INFO ] Implicit Places using invariants and state equation in 1343 ms returned []
Implicit Place search using SMT with State Equation took 1807 ms to find 0 implicit places.
// Phase 1: matrix 1621 rows 1771 cols
[2022-05-19 11:40:39] [INFO ] Computed 271 place invariants in 4 ms
[2022-05-19 11:40:40] [INFO ] Dead Transitions using invariants and state equation in 851 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1771/1777 places, 1621/1627 transitions.
Finished structural reductions, in 1 iterations. Remains : 1771/1777 places, 1621/1627 transitions.
Stuttering acceptance computed with spot in 250 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 1}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 0}, { cond=p1, acceptance={} source=6 dest: 4}]], initial=2, aps=[p1:(EQ s817 1), p0:(OR (EQ s649 1) (EQ s817 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-030B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-LTLFireability-13 finished in 3065 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(X(p0))||F(p1)))))'
Support contains 3 out of 1777 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1777/1777 places, 1627/1627 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1772 transition count 1622
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1772 transition count 1622
Applied a total of 10 rules in 127 ms. Remains 1772 /1777 variables (removed 5) and now considering 1622/1627 (removed 5) transitions.
// Phase 1: matrix 1622 rows 1772 cols
[2022-05-19 11:40:40] [INFO ] Computed 271 place invariants in 11 ms
[2022-05-19 11:40:40] [INFO ] Implicit Places using invariants in 518 ms returned []
// Phase 1: matrix 1622 rows 1772 cols
[2022-05-19 11:40:40] [INFO ] Computed 271 place invariants in 4 ms
[2022-05-19 11:40:42] [INFO ] Implicit Places using invariants and state equation in 1484 ms returned []
Implicit Place search using SMT with State Equation took 2011 ms to find 0 implicit places.
// Phase 1: matrix 1622 rows 1772 cols
[2022-05-19 11:40:42] [INFO ] Computed 271 place invariants in 10 ms
[2022-05-19 11:40:43] [INFO ] Dead Transitions using invariants and state equation in 849 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1772/1777 places, 1622/1627 transitions.
Finished structural reductions, in 1 iterations. Remains : 1772/1777 places, 1622/1627 transitions.
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s105 1) (EQ s122 1)), p0:(EQ s604 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 572 ms.
Stack based approach found an accepted trace after 2495 steps with 0 reset with depth 2496 and stack size 2496 in 21 ms.
FORMULA ShieldIIPt-PT-030B-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-030B-LTLFireability-15 finished in 3756 ms.
All properties solved by simple procedures.
Total runtime 102225 ms.
BK_STOP 1652960444272
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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="ShieldIIPt-PT-030B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is ShieldIIPt-PT-030B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r222-tall-165286025000300"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-030B.tgz
mv ShieldIIPt-PT-030B execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;