Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 904K
-rw-r--r-- 1 mcc users 6.3K Feb 25 17:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 25 17:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 17:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 17:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 17:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 25 17:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 17:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 33K Feb 25 17:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 512K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME 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 1679438531690

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-030B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 22:42:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 22:42:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 22:42:15] [INFO ] Load time of PNML (sax parser for PT used): 203 ms
[2023-03-21 22:42:15] [INFO ] Transformed 2103 places.
[2023-03-21 22:42:15] [INFO ] Transformed 1953 transitions.
[2023-03-21 22:42:15] [INFO ] Found NUPN structural information;
[2023-03-21 22:42:15] [INFO ] Parsed PT model containing 2103 places and 1953 transitions and 4866 arcs in 418 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldIIPt-PT-030B-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030B-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-030B-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 2103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2103/2103 places, 1953/1953 transitions.
Discarding 320 places :
Symmetric choice reduction at 0 with 320 rule applications. Total rules 320 place count 1783 transition count 1633
Iterating global reduction 0 with 320 rules applied. Total rules applied 640 place count 1783 transition count 1633
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 641 place count 1782 transition count 1632
Iterating global reduction 0 with 1 rules applied. Total rules applied 642 place count 1782 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 643 place count 1781 transition count 1631
Iterating global reduction 0 with 1 rules applied. Total rules applied 644 place count 1781 transition count 1631
Applied a total of 644 rules in 874 ms. Remains 1781 /2103 variables (removed 322) and now considering 1631/1953 (removed 322) transitions.
// Phase 1: matrix 1631 rows 1781 cols
[2023-03-21 22:42:17] [INFO ] Computed 271 place invariants in 28 ms
[2023-03-21 22:42:19] [INFO ] Implicit Places using invariants in 2089 ms returned []
[2023-03-21 22:42:19] [INFO ] Invariant cache hit.
[2023-03-21 22:42:22] [INFO ] Implicit Places using invariants and state equation in 3762 ms returned []
Implicit Place search using SMT with State Equation took 5996 ms to find 0 implicit places.
[2023-03-21 22:42:22] [INFO ] Invariant cache hit.
[2023-03-21 22:42:24] [INFO ] Dead Transitions using invariants and state equation in 2034 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1781/2103 places, 1631/1953 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8905 ms. Remains : 1781/2103 places, 1631/1953 transitions.
Support contains 33 out of 1781 places after structural reductions.
[2023-03-21 22:42:25] [INFO ] Flatten gal took : 175 ms
[2023-03-21 22:42:25] [INFO ] Flatten gal took : 118 ms
[2023-03-21 22:42:25] [INFO ] Input system was already deterministic with 1631 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 434 ms. (steps per millisecond=23 ) properties (out of 27) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-03-21 22:42:26] [INFO ] Invariant cache hit.
[2023-03-21 22:42:27] [INFO ] [Real]Absence check using 271 positive place invariants in 227 ms returned sat
[2023-03-21 22:42:27] [INFO ] After 1088ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-21 22:42:28] [INFO ] [Nat]Absence check using 271 positive place invariants in 214 ms returned sat
[2023-03-21 22:42:31] [INFO ] After 1970ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-21 22:42:32] [INFO ] Deduced a trap composed of 19 places in 786 ms of which 5 ms to minimize.
[2023-03-21 22:42:32] [INFO ] Deduced a trap composed of 16 places in 505 ms of which 1 ms to minimize.
[2023-03-21 22:42:33] [INFO ] Deduced a trap composed of 20 places in 308 ms of which 2 ms to minimize.
[2023-03-21 22:42:33] [INFO ] Deduced a trap composed of 20 places in 776 ms of which 2 ms to minimize.
[2023-03-21 22:42:34] [INFO ] Deduced a trap composed of 21 places in 376 ms of which 2 ms to minimize.
[2023-03-21 22:42:34] [INFO ] Deduced a trap composed of 20 places in 516 ms of which 1 ms to minimize.
[2023-03-21 22:42:35] [INFO ] Deduced a trap composed of 25 places in 276 ms of which 1 ms to minimize.
[2023-03-21 22:42:35] [INFO ] Deduced a trap composed of 27 places in 260 ms of which 3 ms to minimize.
[2023-03-21 22:42:36] [INFO ] Deduced a trap composed of 29 places in 311 ms of which 1 ms to minimize.
[2023-03-21 22:42:36] [INFO ] Deduced a trap composed of 24 places in 446 ms of which 1 ms to minimize.
[2023-03-21 22:42:36] [INFO ] Deduced a trap composed of 17 places in 300 ms of which 0 ms to minimize.
[2023-03-21 22:42:37] [INFO ] Deduced a trap composed of 33 places in 374 ms of which 1 ms to minimize.
[2023-03-21 22:42:37] [INFO ] Deduced a trap composed of 27 places in 287 ms of which 13 ms to minimize.
[2023-03-21 22:42:38] [INFO ] Deduced a trap composed of 30 places in 272 ms of which 1 ms to minimize.
[2023-03-21 22:42:38] [INFO ] Deduced a trap composed of 38 places in 275 ms of which 7 ms to minimize.
[2023-03-21 22:42:38] [INFO ] Deduced a trap composed of 30 places in 217 ms of which 1 ms to minimize.
[2023-03-21 22:42:38] [INFO ] Deduced a trap composed of 33 places in 152 ms of which 0 ms to minimize.
[2023-03-21 22:42:39] [INFO ] Deduced a trap composed of 31 places in 163 ms of which 0 ms to minimize.
[2023-03-21 22:42:39] [INFO ] Deduced a trap composed of 27 places in 204 ms of which 0 ms to minimize.
[2023-03-21 22:42:39] [INFO ] Deduced a trap composed of 31 places in 292 ms of which 1 ms to minimize.
[2023-03-21 22:42:40] [INFO ] Deduced a trap composed of 41 places in 266 ms of which 1 ms to minimize.
[2023-03-21 22:42:40] [INFO ] Deduced a trap composed of 44 places in 229 ms of which 3 ms to minimize.
[2023-03-21 22:42:41] [INFO ] Deduced a trap composed of 46 places in 749 ms of which 1 ms to minimize.
[2023-03-21 22:42:41] [INFO ] Deduced a trap composed of 32 places in 204 ms of which 1 ms to minimize.
[2023-03-21 22:42:41] [INFO ] Deduced a trap composed of 32 places in 146 ms of which 1 ms to minimize.
[2023-03-21 22:42:41] [INFO ] Deduced a trap composed of 43 places in 170 ms of which 0 ms to minimize.
[2023-03-21 22:42:42] [INFO ] Deduced a trap composed of 45 places in 125 ms of which 0 ms to minimize.
[2023-03-21 22:42:42] [INFO ] Deduced a trap composed of 40 places in 215 ms of which 1 ms to minimize.
[2023-03-21 22:42:42] [INFO ] Deduced a trap composed of 42 places in 221 ms of which 1 ms to minimize.
[2023-03-21 22:42:42] [INFO ] Deduced a trap composed of 41 places in 147 ms of which 1 ms to minimize.
[2023-03-21 22:42:43] [INFO ] Deduced a trap composed of 44 places in 474 ms of which 26 ms to minimize.
[2023-03-21 22:42:43] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 12293 ms
[2023-03-21 22:42:44] [INFO ] Deduced a trap composed of 30 places in 317 ms of which 1 ms to minimize.
[2023-03-21 22:42:44] [INFO ] Deduced a trap composed of 33 places in 199 ms of which 0 ms to minimize.
[2023-03-21 22:42:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 731 ms
[2023-03-21 22:42:45] [INFO ] Deduced a trap composed of 43 places in 777 ms of which 1 ms to minimize.
[2023-03-21 22:42:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 959 ms
[2023-03-21 22:42:46] [INFO ] Deduced a trap composed of 41 places in 548 ms of which 0 ms to minimize.
[2023-03-21 22:42:46] [INFO ] Deduced a trap composed of 34 places in 308 ms of which 1 ms to minimize.
[2023-03-21 22:42:46] [INFO ] Deduced a trap composed of 43 places in 166 ms of which 1 ms to minimize.
[2023-03-21 22:42:47] [INFO ] Deduced a trap composed of 39 places in 259 ms of which 13 ms to minimize.
[2023-03-21 22:42:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1708 ms
[2023-03-21 22:42:47] [INFO ] Deduced a trap composed of 37 places in 182 ms of which 1 ms to minimize.
[2023-03-21 22:42:48] [INFO ] Deduced a trap composed of 34 places in 424 ms of which 26 ms to minimize.
[2023-03-21 22:42:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 846 ms
[2023-03-21 22:42:49] [INFO ] After 19934ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 1194 ms.
[2023-03-21 22:42:50] [INFO ] After 22591ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Fused 12 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 1322 ms.
Support contains 17 out of 1781 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1781/1781 places, 1631/1631 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 1781 transition count 1275
Reduce places removed 356 places and 0 transitions.
Iterating post reduction 1 with 356 rules applied. Total rules applied 712 place count 1425 transition count 1275
Performed 233 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 233 Pre rules applied. Total rules applied 712 place count 1425 transition count 1042
Deduced a syphon composed of 233 places in 1 ms
Reduce places removed 233 places and 0 transitions.
Iterating global reduction 2 with 466 rules applied. Total rules applied 1178 place count 1192 transition count 1042
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1180 place count 1190 transition count 1040
Iterating global reduction 2 with 2 rules applied. Total rules applied 1182 place count 1190 transition count 1040
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1182 place count 1190 transition count 1038
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1186 place count 1188 transition count 1038
Performed 507 Post agglomeration using F-continuation condition.Transition count delta: 507
Deduced a syphon composed of 507 places in 2 ms
Reduce places removed 507 places and 0 transitions.
Iterating global reduction 2 with 1014 rules applied. Total rules applied 2200 place count 681 transition count 531
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2201 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 3 with 2 rules applied. Total rules applied 2203 place count 680 transition count 529
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: -55
Deduced a syphon composed of 87 places in 2 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 3 with 174 rules applied. Total rules applied 2377 place count 593 transition count 584
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2378 place count 593 transition count 583
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 2381 place count 593 transition count 580
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 2384 place count 590 transition count 580
Partial Free-agglomeration rule applied 31 times.
Drop transitions removed 31 transitions
Iterating global reduction 5 with 31 rules applied. Total rules applied 2415 place count 590 transition count 580
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2416 place count 589 transition count 579
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2418 place count 587 transition count 579
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 2418 place count 587 transition count 578
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2420 place count 586 transition count 578
Applied a total of 2420 rules in 494 ms. Remains 586 /1781 variables (removed 1195) and now considering 578/1631 (removed 1053) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 494 ms. Remains : 586/1781 places, 578/1631 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 403 ms. (steps per millisecond=24 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 578 rows 586 cols
[2023-03-21 22:42:53] [INFO ] Computed 269 place invariants in 3 ms
[2023-03-21 22:42:53] [INFO ] [Real]Absence check using 269 positive place invariants in 60 ms returned sat
[2023-03-21 22:42:53] [INFO ] After 356ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-21 22:42:54] [INFO ] [Nat]Absence check using 269 positive place invariants in 87 ms returned sat
[2023-03-21 22:42:55] [INFO ] After 659ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-21 22:42:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-21 22:42:55] [INFO ] After 334ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-21 22:42:56] [INFO ] After 1004ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 491 ms.
[2023-03-21 22:42:56] [INFO ] After 2716ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 121 ms.
Support contains 15 out of 586 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 586/586 places, 578/578 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 584 transition count 576
Applied a total of 4 rules in 40 ms. Remains 584 /586 variables (removed 2) and now considering 576/578 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 584/586 places, 576/578 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 347 ms. (steps per millisecond=28 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 9) 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 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 9) 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 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 576 rows 584 cols
[2023-03-21 22:42:57] [INFO ] Computed 269 place invariants in 2 ms
[2023-03-21 22:42:57] [INFO ] [Real]Absence check using 269 positive place invariants in 121 ms returned sat
[2023-03-21 22:42:57] [INFO ] After 307ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-21 22:42:58] [INFO ] [Nat]Absence check using 269 positive place invariants in 42 ms returned sat
[2023-03-21 22:42:59] [INFO ] After 745ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-21 22:42:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-21 22:42:59] [INFO ] After 206ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-21 22:42:59] [INFO ] After 874ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 414 ms.
[2023-03-21 22:43:00] [INFO ] After 2441ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 244 ms.
Support contains 14 out of 584 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 584/584 places, 576/576 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 583 transition count 575
Applied a total of 2 rules in 53 ms. Remains 583 /584 variables (removed 1) and now considering 575/576 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 583/584 places, 575/576 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 9) 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 9) seen :0
Interrupted probabilistic random walk after 106008 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{}
Probabilistic random walk after 106008 steps, saw 67695 distinct states, run finished after 3005 ms. (steps per millisecond=35 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 575 rows 583 cols
[2023-03-21 22:43:04] [INFO ] Computed 269 place invariants in 2 ms
[2023-03-21 22:43:04] [INFO ] [Real]Absence check using 269 positive place invariants in 39 ms returned sat
[2023-03-21 22:43:04] [INFO ] After 202ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-21 22:43:05] [INFO ] [Nat]Absence check using 269 positive place invariants in 74 ms returned sat
[2023-03-21 22:43:05] [INFO ] After 447ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-21 22:43:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-21 22:43:06] [INFO ] After 340ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-21 22:43:06] [INFO ] After 774ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 343 ms.
[2023-03-21 22:43:06] [INFO ] After 2072ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 182 ms.
Support contains 14 out of 583 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 583/583 places, 575/575 transitions.
Applied a total of 0 rules in 15 ms. Remains 583 /583 variables (removed 0) and now considering 575/575 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 583/583 places, 575/575 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 583/583 places, 575/575 transitions.
Applied a total of 0 rules in 12 ms. Remains 583 /583 variables (removed 0) and now considering 575/575 (removed 0) transitions.
[2023-03-21 22:43:07] [INFO ] Invariant cache hit.
[2023-03-21 22:43:07] [INFO ] Implicit Places using invariants in 430 ms returned [572]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 432 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 582/583 places, 575/575 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 581 transition count 574
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 581 transition count 574
Applied a total of 2 rules in 21 ms. Remains 581 /582 variables (removed 1) and now considering 574/575 (removed 1) transitions.
// Phase 1: matrix 574 rows 581 cols
[2023-03-21 22:43:07] [INFO ] Computed 268 place invariants in 1 ms
[2023-03-21 22:43:08] [INFO ] Implicit Places using invariants in 1048 ms returned []
[2023-03-21 22:43:08] [INFO ] Invariant cache hit.
[2023-03-21 22:43:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 22:43:09] [INFO ] Implicit Places using invariants and state equation in 729 ms returned []
Implicit Place search using SMT with State Equation took 1787 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 581/583 places, 574/575 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2254 ms. Remains : 581/583 places, 574/575 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 273 ms. (steps per millisecond=36 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 9) 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 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 102443 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 102443 steps, saw 65375 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 9 properties.
[2023-03-21 22:43:13] [INFO ] Invariant cache hit.
[2023-03-21 22:43:13] [INFO ] [Real]Absence check using 268 positive place invariants in 54 ms returned sat
[2023-03-21 22:43:13] [INFO ] After 217ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-21 22:43:13] [INFO ] [Nat]Absence check using 268 positive place invariants in 73 ms returned sat
[2023-03-21 22:43:14] [INFO ] After 564ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-21 22:43:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 22:43:15] [INFO ] After 390ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-21 22:43:15] [INFO ] After 952ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 259 ms.
[2023-03-21 22:43:15] [INFO ] After 2270ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 76 ms.
Support contains 14 out of 581 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 574/574 transitions.
Applied a total of 0 rules in 13 ms. Remains 581 /581 variables (removed 0) and now considering 574/574 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 581/581 places, 574/574 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 581/581 places, 574/574 transitions.
Applied a total of 0 rules in 12 ms. Remains 581 /581 variables (removed 0) and now considering 574/574 (removed 0) transitions.
[2023-03-21 22:43:15] [INFO ] Invariant cache hit.
[2023-03-21 22:43:20] [INFO ] Implicit Places using invariants in 4350 ms returned []
[2023-03-21 22:43:20] [INFO ] Invariant cache hit.
[2023-03-21 22:43:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-21 22:43:21] [INFO ] Implicit Places using invariants and state equation in 1598 ms returned []
Implicit Place search using SMT with State Equation took 5964 ms to find 0 implicit places.
[2023-03-21 22:43:21] [INFO ] Redundant transitions in 42 ms returned []
[2023-03-21 22:43:21] [INFO ] Invariant cache hit.
[2023-03-21 22:43:22] [INFO ] Dead Transitions using invariants and state equation in 552 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6603 ms. Remains : 581/581 places, 574/574 transitions.
Partial Free-agglomeration rule applied 60 times.
Drop transitions removed 60 transitions
Iterating global reduction 0 with 60 rules applied. Total rules applied 60 place count 581 transition count 574
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 61 place count 581 transition count 573
Applied a total of 61 rules in 46 ms. Remains 581 /581 variables (removed 0) and now considering 573/574 (removed 1) transitions.
Running SMT prover for 9 properties.
// Phase 1: matrix 573 rows 581 cols
[2023-03-21 22:43:22] [INFO ] Computed 268 place invariants in 2 ms
[2023-03-21 22:43:22] [INFO ] [Real]Absence check using 268 positive place invariants in 61 ms returned sat
[2023-03-21 22:43:22] [INFO ] After 335ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-21 22:43:23] [INFO ] [Nat]Absence check using 268 positive place invariants in 57 ms returned sat
[2023-03-21 22:43:24] [INFO ] After 647ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-21 22:43:24] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-03-21 22:43:24] [INFO ] After 328ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-21 22:43:24] [INFO ] After 733ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 353 ms.
[2023-03-21 22:43:25] [INFO ] After 2309ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Computed a total of 480 stabilizing places and 480 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X((F(p0)&&G(p1)))))))'
Support contains 3 out of 1781 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1781/1781 places, 1631/1631 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1771 transition count 1621
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1771 transition count 1621
Applied a total of 20 rules in 208 ms. Remains 1771 /1781 variables (removed 10) and now considering 1621/1631 (removed 10) transitions.
// Phase 1: matrix 1621 rows 1771 cols
[2023-03-21 22:43:26] [INFO ] Computed 271 place invariants in 14 ms
[2023-03-21 22:43:28] [INFO ] Implicit Places using invariants in 2556 ms returned []
[2023-03-21 22:43:28] [INFO ] Invariant cache hit.
[2023-03-21 22:43:31] [INFO ] Implicit Places using invariants and state equation in 3215 ms returned []
Implicit Place search using SMT with State Equation took 5786 ms to find 0 implicit places.
[2023-03-21 22:43:31] [INFO ] Invariant cache hit.
[2023-03-21 22:43:33] [INFO ] Dead Transitions using invariants and state equation in 1683 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1771/1781 places, 1621/1631 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7696 ms. Remains : 1771/1781 places, 1621/1631 transitions.
Stuttering acceptance computed with spot in 655 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=6 dest: 0}, { cond=(NOT p1), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={0} source=6 dest: 6}]], initial=5, aps=[p1:(EQ s240 1), p0:(AND (EQ s1214 1) (EQ s1295 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 2 ms.
FORMULA ShieldIIPt-PT-030B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-LTLFireability-00 finished in 8466 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((X(F(p0))&&G(p1))))))'
Support contains 2 out of 1781 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1781/1781 places, 1631/1631 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1772 transition count 1622
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1772 transition count 1622
Applied a total of 18 rules in 168 ms. Remains 1772 /1781 variables (removed 9) and now considering 1622/1631 (removed 9) transitions.
// Phase 1: matrix 1622 rows 1772 cols
[2023-03-21 22:43:34] [INFO ] Computed 271 place invariants in 8 ms
[2023-03-21 22:43:35] [INFO ] Implicit Places using invariants in 758 ms returned []
[2023-03-21 22:43:35] [INFO ] Invariant cache hit.
[2023-03-21 22:43:37] [INFO ] Implicit Places using invariants and state equation in 2849 ms returned []
Implicit Place search using SMT with State Equation took 3635 ms to find 0 implicit places.
[2023-03-21 22:43:37] [INFO ] Invariant cache hit.
[2023-03-21 22:43:39] [INFO ] Dead Transitions using invariants and state equation in 1457 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1772/1781 places, 1622/1631 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5263 ms. Remains : 1772/1781 places, 1622/1631 transitions.
Stuttering acceptance computed with spot in 359 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s233 1), p0:(EQ s966 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 653 ms.
Stack based approach found an accepted trace after 2530 steps with 0 reset with depth 2531 and stack size 2531 in 32 ms.
FORMULA ShieldIIPt-PT-030B-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-030B-LTLFireability-01 finished in 6367 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U X(p1))&&X(G(p2))))'
Support contains 2 out of 1781 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1781/1781 places, 1631/1631 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1771 transition count 1621
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1771 transition count 1621
Applied a total of 20 rules in 220 ms. Remains 1771 /1781 variables (removed 10) and now considering 1621/1631 (removed 10) transitions.
// Phase 1: matrix 1621 rows 1771 cols
[2023-03-21 22:43:40] [INFO ] Computed 271 place invariants in 8 ms
[2023-03-21 22:43:41] [INFO ] Implicit Places using invariants in 946 ms returned []
[2023-03-21 22:43:41] [INFO ] Invariant cache hit.
[2023-03-21 22:43:43] [INFO ] Implicit Places using invariants and state equation in 2181 ms returned []
Implicit Place search using SMT with State Equation took 3152 ms to find 0 implicit places.
[2023-03-21 22:43:43] [INFO ] Invariant cache hit.
[2023-03-21 22:43:45] [INFO ] Dead Transitions using invariants and state equation in 1105 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1771/1781 places, 1621/1631 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4477 ms. Remains : 1771/1781 places, 1621/1631 transitions.
Stuttering acceptance computed with spot in 211 ms :[true, (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p1 p2), acceptance={} source=4 dest: 3}]], initial=1, aps=[p0:(OR (EQ s1512 1) (NEQ s1141 1)), p2:(EQ s1141 0), p1:(EQ s1512 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 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-030B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-LTLFireability-04 finished in 4716 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1781 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1781/1781 places, 1631/1631 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1771 transition count 1621
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1771 transition count 1621
Applied a total of 20 rules in 216 ms. Remains 1771 /1781 variables (removed 10) and now considering 1621/1631 (removed 10) transitions.
[2023-03-21 22:43:45] [INFO ] Invariant cache hit.
[2023-03-21 22:43:46] [INFO ] Implicit Places using invariants in 690 ms returned []
[2023-03-21 22:43:46] [INFO ] Invariant cache hit.
[2023-03-21 22:43:48] [INFO ] Implicit Places using invariants and state equation in 2269 ms returned []
Implicit Place search using SMT with State Equation took 2961 ms to find 0 implicit places.
[2023-03-21 22:43:48] [INFO ] Invariant cache hit.
[2023-03-21 22:43:49] [INFO ] Dead Transitions using invariants and state equation in 1116 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1771/1781 places, 1621/1631 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4310 ms. Remains : 1771/1781 places, 1621/1631 transitions.
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s1547 0) (EQ s547 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][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-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-LTLFireability-05 finished in 4517 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p0 U p1)&&(p2||F(p3))))))'
Support contains 3 out of 1781 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1781/1781 places, 1631/1631 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 360 transitions
Trivial Post-agglo rules discarded 360 transitions
Performed 360 trivial Post agglomeration. Transition count delta: 360
Iterating post reduction 0 with 360 rules applied. Total rules applied 360 place count 1780 transition count 1270
Reduce places removed 360 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 361 rules applied. Total rules applied 721 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 722 place count 1419 transition count 1269
Performed 233 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 233 Pre rules applied. Total rules applied 722 place count 1419 transition count 1036
Deduced a syphon composed of 233 places in 1 ms
Reduce places removed 233 places and 0 transitions.
Iterating global reduction 3 with 466 rules applied. Total rules applied 1188 place count 1186 transition count 1036
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 1193 place count 1181 transition count 1031
Iterating global reduction 3 with 5 rules applied. Total rules applied 1198 place count 1181 transition count 1031
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 1198 place count 1181 transition count 1026
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 1208 place count 1176 transition count 1026
Performed 511 Post agglomeration using F-continuation condition.Transition count delta: 511
Deduced a syphon composed of 511 places in 0 ms
Reduce places removed 511 places and 0 transitions.
Iterating global reduction 3 with 1022 rules applied. Total rules applied 2230 place count 665 transition count 515
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2231 place count 665 transition count 514
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 2233 place count 664 transition count 513
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: -55
Deduced a syphon composed of 87 places in 0 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 4 with 174 rules applied. Total rules applied 2407 place count 577 transition count 568
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2409 place count 575 transition count 566
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2411 place count 573 transition count 566
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2411 place count 573 transition count 565
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 2413 place count 572 transition count 565
Applied a total of 2413 rules in 338 ms. Remains 572 /1781 variables (removed 1209) and now considering 565/1631 (removed 1066) transitions.
// Phase 1: matrix 565 rows 572 cols
[2023-03-21 22:43:50] [INFO ] Computed 269 place invariants in 1 ms
[2023-03-21 22:43:50] [INFO ] Implicit Places using invariants in 648 ms returned [561]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 659 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 571/1781 places, 565/1631 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 570 transition count 564
Applied a total of 2 rules in 29 ms. Remains 570 /571 variables (removed 1) and now considering 564/565 (removed 1) transitions.
// Phase 1: matrix 564 rows 570 cols
[2023-03-21 22:43:50] [INFO ] Computed 268 place invariants in 3 ms
[2023-03-21 22:43:51] [INFO ] Implicit Places using invariants in 581 ms returned []
[2023-03-21 22:43:51] [INFO ] Invariant cache hit.
[2023-03-21 22:43:53] [INFO ] Implicit Places using invariants and state equation in 2296 ms returned []
Implicit Place search using SMT with State Equation took 2893 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 570/1781 places, 564/1631 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3921 ms. Remains : 570/1781 places, 564/1631 transitions.
Stuttering acceptance computed with spot in 261 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(OR (AND p1 (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND p1 p2 (NOT p3)) (AND p0 p2 (NOT p3))), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0 p2 (NOT p3)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s133 1), p0:(EQ s538 1), p2:(EQ s538 0), p3:(EQ s211 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-030B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-LTLFireability-06 finished in 4215 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(F(p1)))))'
Support contains 3 out of 1781 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1781/1781 places, 1631/1631 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 360 transitions
Trivial Post-agglo rules discarded 360 transitions
Performed 360 trivial Post agglomeration. Transition count delta: 360
Iterating post reduction 0 with 360 rules applied. Total rules applied 360 place count 1780 transition count 1270
Reduce places removed 360 places and 0 transitions.
Iterating post reduction 1 with 360 rules applied. Total rules applied 720 place count 1420 transition count 1270
Performed 234 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 234 Pre rules applied. Total rules applied 720 place count 1420 transition count 1036
Deduced a syphon composed of 234 places in 1 ms
Reduce places removed 234 places and 0 transitions.
Iterating global reduction 2 with 468 rules applied. Total rules applied 1188 place count 1186 transition count 1036
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 1192 place count 1182 transition count 1032
Iterating global reduction 2 with 4 rules applied. Total rules applied 1196 place count 1182 transition count 1032
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1196 place count 1182 transition count 1028
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1204 place count 1178 transition count 1028
Performed 511 Post agglomeration using F-continuation condition.Transition count delta: 511
Deduced a syphon composed of 511 places in 1 ms
Reduce places removed 511 places and 0 transitions.
Iterating global reduction 2 with 1022 rules applied. Total rules applied 2226 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 2227 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 2229 place count 666 transition count 515
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -58
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 2407 place count 577 transition count 573
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 2408 place count 577 transition count 573
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2410 place count 575 transition count 571
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2412 place count 573 transition count 571
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2412 place count 573 transition count 570
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 2414 place count 572 transition count 570
Applied a total of 2414 rules in 343 ms. Remains 572 /1781 variables (removed 1209) and now considering 570/1631 (removed 1061) transitions.
// Phase 1: matrix 570 rows 572 cols
[2023-03-21 22:43:54] [INFO ] Computed 269 place invariants in 2 ms
[2023-03-21 22:43:54] [INFO ] Implicit Places using invariants in 343 ms returned [561]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 353 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 571/1781 places, 570/1631 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 569
Applied a total of 2 rules in 48 ms. Remains 570 /571 variables (removed 1) and now considering 569/570 (removed 1) transitions.
// Phase 1: matrix 569 rows 570 cols
[2023-03-21 22:43:54] [INFO ] Computed 268 place invariants in 1 ms
[2023-03-21 22:43:55] [INFO ] Implicit Places using invariants in 375 ms returned []
[2023-03-21 22:43:55] [INFO ] Invariant cache hit.
[2023-03-21 22:43:55] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-21 22:43:56] [INFO ] Implicit Places using invariants and state equation in 1200 ms returned []
Implicit Place search using SMT with State Equation took 1592 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 570/1781 places, 569/1631 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2337 ms. Remains : 570/1781 places, 569/1631 transitions.
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s209 0) (EQ s74 0)), p0:(OR (EQ s74 1) (EQ s173 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, 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 2544 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 4 out of 1781 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1781/1781 places, 1631/1631 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 361 transitions
Trivial Post-agglo rules discarded 361 transitions
Performed 361 trivial Post agglomeration. Transition count delta: 361
Iterating post reduction 0 with 361 rules applied. Total rules applied 361 place count 1780 transition count 1269
Reduce places removed 361 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 362 rules applied. Total rules applied 723 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 724 place count 1418 transition count 1268
Performed 232 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 232 Pre rules applied. Total rules applied 724 place count 1418 transition count 1036
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 1188 place count 1186 transition count 1036
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1195 place count 1179 transition count 1029
Iterating global reduction 3 with 7 rules applied. Total rules applied 1202 place count 1179 transition count 1029
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 1202 place count 1179 transition count 1023
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 1214 place count 1173 transition count 1023
Performed 507 Post agglomeration using F-continuation condition.Transition count delta: 507
Deduced a syphon composed of 507 places in 1 ms
Reduce places removed 507 places and 0 transitions.
Iterating global reduction 3 with 1014 rules applied. Total rules applied 2228 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 2229 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 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2231 place count 665 transition count 514
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 4 with 178 rules applied. Total rules applied 2409 place count 576 transition count 573
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2411 place count 574 transition count 571
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2413 place count 572 transition count 571
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2413 place count 572 transition count 570
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 2415 place count 571 transition count 570
Applied a total of 2415 rules in 280 ms. Remains 571 /1781 variables (removed 1210) and now considering 570/1631 (removed 1061) transitions.
// Phase 1: matrix 570 rows 571 cols
[2023-03-21 22:43:56] [INFO ] Computed 269 place invariants in 1 ms
[2023-03-21 22:43:57] [INFO ] Implicit Places using invariants in 645 ms returned [560]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 668 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 570/1781 places, 570/1631 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 569 transition count 569
Applied a total of 2 rules in 27 ms. Remains 569 /570 variables (removed 1) and now considering 569/570 (removed 1) transitions.
// Phase 1: matrix 569 rows 569 cols
[2023-03-21 22:43:57] [INFO ] Computed 268 place invariants in 1 ms
[2023-03-21 22:43:57] [INFO ] Implicit Places using invariants in 348 ms returned []
[2023-03-21 22:43:57] [INFO ] Invariant cache hit.
[2023-03-21 22:43:58] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-21 22:43:58] [INFO ] Implicit Places using invariants and state equation in 724 ms returned []
Implicit Place search using SMT with State Equation took 1099 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 569/1781 places, 569/1631 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2074 ms. Remains : 569/1781 places, 569/1631 transitions.
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(OR (EQ s202 0) (EQ s209 0) (EQ s212 0)), p0:(EQ s550 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 21502 reset in 695 ms.
Product exploration explored 100000 steps with 21497 reset in 738 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/569 stabilizing places and 2/569 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 4 factoid took 484 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-21 22:44:00] [INFO ] Invariant cache hit.
[2023-03-21 22:44:01] [INFO ] After 163ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 22:44:01] [INFO ] [Nat]Absence check using 268 positive place invariants in 60 ms returned sat
[2023-03-21 22:44:01] [INFO ] After 466ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 22:44:01] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-21 22:44:01] [INFO ] After 30ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 22:44:01] [INFO ] After 115ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-03-21 22:44:01] [INFO ] After 849ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 569 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 569/569 places, 569/569 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 569 transition count 568
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 569 transition count 568
Applied a total of 2 rules in 27 ms. Remains 569 /569 variables (removed 0) and now considering 568/569 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 569/569 places, 568/569 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 327073 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :{}
Probabilistic random walk after 327073 steps, saw 209522 distinct states, run finished after 3001 ms. (steps per millisecond=108 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 568 rows 569 cols
[2023-03-21 22:44:05] [INFO ] Computed 268 place invariants in 4 ms
[2023-03-21 22:44:05] [INFO ] After 133ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 22:44:05] [INFO ] [Nat]Absence check using 268 positive place invariants in 60 ms returned sat
[2023-03-21 22:44:05] [INFO ] After 297ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 22:44:05] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-21 22:44:05] [INFO ] After 55ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 22:44:05] [INFO ] After 111ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-21 22:44:05] [INFO ] After 598ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 569 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 569/569 places, 568/568 transitions.
Applied a total of 0 rules in 10 ms. Remains 569 /569 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 569/569 places, 568/568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 569/569 places, 568/568 transitions.
Applied a total of 0 rules in 10 ms. Remains 569 /569 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2023-03-21 22:44:05] [INFO ] Invariant cache hit.
[2023-03-21 22:44:06] [INFO ] Implicit Places using invariants in 344 ms returned []
[2023-03-21 22:44:06] [INFO ] Invariant cache hit.
[2023-03-21 22:44:06] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-21 22:44:07] [INFO ] Implicit Places using invariants and state equation in 1243 ms returned []
Implicit Place search using SMT with State Equation took 1602 ms to find 0 implicit places.
[2023-03-21 22:44:07] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-21 22:44:07] [INFO ] Invariant cache hit.
[2023-03-21 22:44:07] [INFO ] Dead Transitions using invariants and state equation in 332 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1958 ms. Remains : 569/569 places, 568/568 transitions.
Partial Free-agglomeration rule applied 62 times.
Drop transitions removed 62 transitions
Iterating global reduction 0 with 62 rules applied. Total rules applied 62 place count 569 transition count 568
Applied a total of 62 rules in 20 ms. Remains 569 /569 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 568 rows 569 cols
[2023-03-21 22:44:07] [INFO ] Computed 268 place invariants in 1 ms
[2023-03-21 22:44:07] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 22:44:08] [INFO ] [Nat]Absence check using 268 positive place invariants in 67 ms returned sat
[2023-03-21 22:44:08] [INFO ] After 273ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 22:44:08] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-21 22:44:08] [INFO ] After 69ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 22:44:08] [INFO ] After 99ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-21 22:44:08] [INFO ] After 597ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 4 factoid took 380 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p1) (NOT p0))]
Support contains 4 out of 569 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 569/569 places, 569/569 transitions.
Applied a total of 0 rules in 25 ms. Remains 569 /569 variables (removed 0) and now considering 569/569 (removed 0) transitions.
// Phase 1: matrix 569 rows 569 cols
[2023-03-21 22:44:09] [INFO ] Computed 268 place invariants in 2 ms
[2023-03-21 22:44:09] [INFO ] Implicit Places using invariants in 468 ms returned []
[2023-03-21 22:44:09] [INFO ] Invariant cache hit.
[2023-03-21 22:44:09] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-21 22:44:10] [INFO ] Implicit Places using invariants and state equation in 844 ms returned []
Implicit Place search using SMT with State Equation took 1337 ms to find 0 implicit places.
[2023-03-21 22:44:10] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-21 22:44:10] [INFO ] Invariant cache hit.
[2023-03-21 22:44:10] [INFO ] Dead Transitions using invariants and state equation in 327 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1715 ms. Remains : 569/569 places, 569/569 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/569 stabilizing places and 2/569 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 4 factoid took 408 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-21 22:44:11] [INFO ] Invariant cache hit.
[2023-03-21 22:44:11] [INFO ] After 144ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 22:44:11] [INFO ] [Nat]Absence check using 268 positive place invariants in 75 ms returned sat
[2023-03-21 22:44:11] [INFO ] After 252ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 22:44:11] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-21 22:44:11] [INFO ] After 28ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 22:44:12] [INFO ] After 100ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-21 22:44:12] [INFO ] After 648ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 569 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 569/569 places, 569/569 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 569 transition count 568
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 569 transition count 568
Applied a total of 2 rules in 40 ms. Remains 569 /569 variables (removed 0) and now considering 568/569 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 569/569 places, 568/569 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 333405 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :{}
Probabilistic random walk after 333405 steps, saw 213637 distinct states, run finished after 3001 ms. (steps per millisecond=111 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 568 rows 569 cols
[2023-03-21 22:44:15] [INFO ] Computed 268 place invariants in 2 ms
[2023-03-21 22:44:15] [INFO ] After 158ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 22:44:15] [INFO ] [Nat]Absence check using 268 positive place invariants in 46 ms returned sat
[2023-03-21 22:44:15] [INFO ] After 229ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 22:44:15] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-21 22:44:15] [INFO ] After 24ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 22:44:15] [INFO ] After 87ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-21 22:44:15] [INFO ] After 516ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 569 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 569/569 places, 568/568 transitions.
Applied a total of 0 rules in 9 ms. Remains 569 /569 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 569/569 places, 568/568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 569/569 places, 568/568 transitions.
Applied a total of 0 rules in 17 ms. Remains 569 /569 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2023-03-21 22:44:15] [INFO ] Invariant cache hit.
[2023-03-21 22:44:16] [INFO ] Implicit Places using invariants in 799 ms returned []
[2023-03-21 22:44:16] [INFO ] Invariant cache hit.
[2023-03-21 22:44:17] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-21 22:44:18] [INFO ] Implicit Places using invariants and state equation in 1337 ms returned []
Implicit Place search using SMT with State Equation took 2142 ms to find 0 implicit places.
[2023-03-21 22:44:18] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-21 22:44:18] [INFO ] Invariant cache hit.
[2023-03-21 22:44:19] [INFO ] Dead Transitions using invariants and state equation in 904 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3092 ms. Remains : 569/569 places, 568/568 transitions.
Partial Free-agglomeration rule applied 62 times.
Drop transitions removed 62 transitions
Iterating global reduction 0 with 62 rules applied. Total rules applied 62 place count 569 transition count 568
Applied a total of 62 rules in 18 ms. Remains 569 /569 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 568 rows 569 cols
[2023-03-21 22:44:19] [INFO ] Computed 268 place invariants in 1 ms
[2023-03-21 22:44:19] [INFO ] After 181ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 22:44:19] [INFO ] [Nat]Absence check using 268 positive place invariants in 59 ms returned sat
[2023-03-21 22:44:19] [INFO ] After 199ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 22:44:19] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-21 22:44:19] [INFO ] After 35ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 22:44:19] [INFO ] After 98ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 71 ms.
[2023-03-21 22:44:19] [INFO ] After 566ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 4 factoid took 357 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 21544 reset in 645 ms.
Product exploration explored 100000 steps with 21494 reset in 644 ms.
Support contains 4 out of 569 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 569/569 places, 569/569 transitions.
Applied a total of 0 rules in 8 ms. Remains 569 /569 variables (removed 0) and now considering 569/569 (removed 0) transitions.
// Phase 1: matrix 569 rows 569 cols
[2023-03-21 22:44:21] [INFO ] Computed 268 place invariants in 15 ms
[2023-03-21 22:44:22] [INFO ] Implicit Places using invariants in 1086 ms returned []
[2023-03-21 22:44:22] [INFO ] Invariant cache hit.
[2023-03-21 22:44:23] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-21 22:44:23] [INFO ] Implicit Places using invariants and state equation in 1234 ms returned []
Implicit Place search using SMT with State Equation took 2358 ms to find 0 implicit places.
[2023-03-21 22:44:24] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-21 22:44:24] [INFO ] Invariant cache hit.
[2023-03-21 22:44:27] [INFO ] Dead Transitions using invariants and state equation in 3048 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5448 ms. Remains : 569/569 places, 569/569 transitions.
Treatment of property ShieldIIPt-PT-030B-LTLFireability-08 finished in 30708 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((X(!p0)&&G(p1))||G(!p0)))))'
Support contains 3 out of 1781 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1781/1781 places, 1631/1631 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 361 transitions
Trivial Post-agglo rules discarded 361 transitions
Performed 361 trivial Post agglomeration. Transition count delta: 361
Iterating post reduction 0 with 361 rules applied. Total rules applied 361 place count 1780 transition count 1269
Reduce places removed 361 places and 0 transitions.
Iterating post reduction 1 with 361 rules applied. Total rules applied 722 place count 1419 transition count 1269
Performed 234 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 234 Pre rules applied. Total rules applied 722 place count 1419 transition count 1035
Deduced a syphon composed of 234 places in 1 ms
Reduce places removed 234 places and 0 transitions.
Iterating global reduction 2 with 468 rules applied. Total rules applied 1190 place count 1185 transition count 1035
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1196 place count 1179 transition count 1029
Iterating global reduction 2 with 6 rules applied. Total rules applied 1202 place count 1179 transition count 1029
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 1202 place count 1179 transition count 1024
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 1212 place count 1174 transition count 1024
Performed 508 Post agglomeration using F-continuation condition.Transition count delta: 508
Deduced a syphon composed of 508 places in 0 ms
Reduce places removed 508 places and 0 transitions.
Iterating global reduction 2 with 1016 rules applied. Total rules applied 2228 place count 666 transition count 516
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2229 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 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2231 place count 665 transition count 514
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 2409 place count 576 transition count 573
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 2410 place count 576 transition count 573
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2412 place count 574 transition count 571
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2414 place count 572 transition count 571
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2414 place count 572 transition count 570
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 2416 place count 571 transition count 570
Applied a total of 2416 rules in 306 ms. Remains 571 /1781 variables (removed 1210) and now considering 570/1631 (removed 1061) transitions.
// Phase 1: matrix 570 rows 571 cols
[2023-03-21 22:44:27] [INFO ] Computed 269 place invariants in 1 ms
[2023-03-21 22:44:28] [INFO ] Implicit Places using invariants in 771 ms returned [560]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 774 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 570/1781 places, 570/1631 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 569 transition count 569
Applied a total of 2 rules in 37 ms. Remains 569 /570 variables (removed 1) and now considering 569/570 (removed 1) transitions.
// Phase 1: matrix 569 rows 569 cols
[2023-03-21 22:44:28] [INFO ] Computed 268 place invariants in 14 ms
[2023-03-21 22:44:28] [INFO ] Implicit Places using invariants in 463 ms returned []
[2023-03-21 22:44:28] [INFO ] Invariant cache hit.
[2023-03-21 22:44:29] [INFO ] Implicit Places using invariants and state equation in 1085 ms returned []
Implicit Place search using SMT with State Equation took 1567 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 569/1781 places, 569/1631 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2684 ms. Remains : 569/1781 places, 569/1631 transitions.
Stuttering acceptance computed with spot in 247 ms :[p0, p0, p0, (AND (NOT p1) p0)]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND p1 p0), acceptance={0, 1} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p1 p0), acceptance={1} source=1 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={1} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND p1 p0), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s207 1), p0:(AND (EQ s196 1) (EQ s206 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 41129 steps with 0 reset in 311 ms.
FORMULA ShieldIIPt-PT-030B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-LTLFireability-09 finished in 3281 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 1781 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1781/1781 places, 1631/1631 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1772 transition count 1622
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1772 transition count 1622
Applied a total of 18 rules in 178 ms. Remains 1772 /1781 variables (removed 9) and now considering 1622/1631 (removed 9) transitions.
// Phase 1: matrix 1622 rows 1772 cols
[2023-03-21 22:44:30] [INFO ] Computed 271 place invariants in 11 ms
[2023-03-21 22:44:31] [INFO ] Implicit Places using invariants in 795 ms returned []
[2023-03-21 22:44:31] [INFO ] Invariant cache hit.
[2023-03-21 22:44:33] [INFO ] Implicit Places using invariants and state equation in 1523 ms returned []
Implicit Place search using SMT with State Equation took 2327 ms to find 0 implicit places.
[2023-03-21 22:44:33] [INFO ] Invariant cache hit.
[2023-03-21 22:44:34] [INFO ] Dead Transitions using invariants and state equation in 1197 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1772/1781 places, 1622/1631 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3705 ms. Remains : 1772/1781 places, 1622/1631 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s1585 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][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-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-LTLFireability-10 finished in 3821 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(F(p1)))))'
Support contains 3 out of 1781 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1781/1781 places, 1631/1631 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 362 transitions
Trivial Post-agglo rules discarded 362 transitions
Performed 362 trivial Post agglomeration. Transition count delta: 362
Iterating post reduction 0 with 362 rules applied. Total rules applied 362 place count 1780 transition count 1268
Reduce places removed 362 places and 0 transitions.
Iterating post reduction 1 with 362 rules applied. Total rules applied 724 place count 1418 transition count 1268
Performed 233 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 233 Pre rules applied. Total rules applied 724 place count 1418 transition count 1035
Deduced a syphon composed of 233 places in 2 ms
Reduce places removed 233 places and 0 transitions.
Iterating global reduction 2 with 466 rules applied. Total rules applied 1190 place count 1185 transition count 1035
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1195 place count 1180 transition count 1030
Iterating global reduction 2 with 5 rules applied. Total rules applied 1200 place count 1180 transition count 1030
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 1200 place count 1180 transition count 1025
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 1210 place count 1175 transition count 1025
Performed 509 Post agglomeration using F-continuation condition.Transition count delta: 509
Deduced a syphon composed of 509 places in 1 ms
Reduce places removed 509 places and 0 transitions.
Iterating global reduction 2 with 1018 rules applied. Total rules applied 2228 place count 666 transition count 516
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2229 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 3 with 2 rules applied. Total rules applied 2231 place count 665 transition count 514
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 2409 place count 576 transition count 573
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2411 place count 574 transition count 571
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2413 place count 572 transition count 571
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2413 place count 572 transition count 570
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 2415 place count 571 transition count 570
Applied a total of 2415 rules in 256 ms. Remains 571 /1781 variables (removed 1210) and now considering 570/1631 (removed 1061) transitions.
// Phase 1: matrix 570 rows 571 cols
[2023-03-21 22:44:34] [INFO ] Computed 269 place invariants in 3 ms
[2023-03-21 22:44:35] [INFO ] Implicit Places using invariants in 433 ms returned [560]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 435 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 570/1781 places, 570/1631 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 569 transition count 569
Applied a total of 2 rules in 29 ms. Remains 569 /570 variables (removed 1) and now considering 569/570 (removed 1) transitions.
// Phase 1: matrix 569 rows 569 cols
[2023-03-21 22:44:35] [INFO ] Computed 268 place invariants in 1 ms
[2023-03-21 22:44:35] [INFO ] Implicit Places using invariants in 483 ms returned []
[2023-03-21 22:44:35] [INFO ] Invariant cache hit.
[2023-03-21 22:44:36] [INFO ] Implicit Places using invariants and state equation in 994 ms returned []
Implicit Place search using SMT with State Equation took 1505 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 569/1781 places, 569/1631 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2225 ms. Remains : 569/1781 places, 569/1631 transitions.
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s88 1) (EQ s115 1)), p1:(NEQ s286 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 77548 steps with 2 reset in 429 ms.
FORMULA ShieldIIPt-PT-030B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-030B-LTLFireability-11 finished in 2764 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G(p1)))'
Support contains 3 out of 1781 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1781/1781 places, 1631/1631 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1772 transition count 1622
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1772 transition count 1622
Applied a total of 18 rules in 154 ms. Remains 1772 /1781 variables (removed 9) and now considering 1622/1631 (removed 9) transitions.
// Phase 1: matrix 1622 rows 1772 cols
[2023-03-21 22:44:37] [INFO ] Computed 271 place invariants in 11 ms
[2023-03-21 22:44:38] [INFO ] Implicit Places using invariants in 784 ms returned []
[2023-03-21 22:44:38] [INFO ] Invariant cache hit.
[2023-03-21 22:44:39] [INFO ] Implicit Places using invariants and state equation in 1667 ms returned []
Implicit Place search using SMT with State Equation took 2469 ms to find 0 implicit places.
[2023-03-21 22:44:39] [INFO ] Invariant cache hit.
[2023-03-21 22:44:41] [INFO ] Dead Transitions using invariants and state equation in 1241 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1772/1781 places, 1622/1631 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3886 ms. Remains : 1772/1781 places, 1622/1631 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s1666 1) (EQ s1711 1)), p1:(AND (OR (NEQ s1666 1) (NEQ s1711 1)) (EQ s1361 0))], 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 172 reset in 531 ms.
Product exploration explored 100000 steps with 166 reset in 570 ms.
Computed a total of 478 stabilizing places and 478 stable transitions
Computed a total of 478 stabilizing places and 478 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 432 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 8630 steps, including 2 resets, run visited all 3 properties in 76 ms. (steps per millisecond=113 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 453 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 1772 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1772/1772 places, 1622/1622 transitions.
Applied a total of 0 rules in 71 ms. Remains 1772 /1772 variables (removed 0) and now considering 1622/1622 (removed 0) transitions.
[2023-03-21 22:44:43] [INFO ] Invariant cache hit.
[2023-03-21 22:44:44] [INFO ] Implicit Places using invariants in 630 ms returned []
[2023-03-21 22:44:44] [INFO ] Invariant cache hit.
[2023-03-21 22:44:46] [INFO ] Implicit Places using invariants and state equation in 2240 ms returned []
Implicit Place search using SMT with State Equation took 2884 ms to find 0 implicit places.
[2023-03-21 22:44:46] [INFO ] Invariant cache hit.
[2023-03-21 22:44:48] [INFO ] Dead Transitions using invariants and state equation in 1881 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4850 ms. Remains : 1772/1772 places, 1622/1622 transitions.
Computed a total of 478 stabilizing places and 478 stable transitions
Computed a total of 478 stabilizing places and 478 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 359 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 8492 steps, including 2 resets, run visited all 3 properties in 78 ms. (steps per millisecond=108 )
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 6 factoid took 415 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 176 reset in 517 ms.
Product exploration explored 100000 steps with 171 reset in 578 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 234 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 1772 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1772/1772 places, 1622/1622 transitions.
Performed 358 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 358 rules applied. Total rules applied 358 place count 1772 transition count 1622
Performed 121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 121 Pre rules applied. Total rules applied 358 place count 1772 transition count 1713
Deduced a syphon composed of 479 places in 1 ms
Iterating global reduction 1 with 121 rules applied. Total rules applied 479 place count 1772 transition count 1713
Performed 598 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1077 places in 2 ms
Iterating global reduction 1 with 598 rules applied. Total rules applied 1077 place count 1772 transition count 1713
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1078 place count 1772 transition count 1712
Renaming transitions due to excessive name length > 1024 char.
Discarding 240 places :
Symmetric choice reduction at 2 with 240 rule applications. Total rules 1318 place count 1532 transition count 1472
Deduced a syphon composed of 837 places in 1 ms
Iterating global reduction 2 with 240 rules applied. Total rules applied 1558 place count 1532 transition count 1472
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 838 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1559 place count 1532 transition count 1472
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1561 place count 1530 transition count 1470
Deduced a syphon composed of 836 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1563 place count 1530 transition count 1470
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -523
Deduced a syphon composed of 937 places in 1 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1664 place count 1530 transition count 1993
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 1765 place count 1429 transition count 1791
Deduced a syphon composed of 836 places in 1 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1866 place count 1429 transition count 1791
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -97
Deduced a syphon composed of 853 places in 2 ms
Iterating global reduction 2 with 17 rules applied. Total rules applied 1883 place count 1429 transition count 1888
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1900 place count 1412 transition count 1854
Deduced a syphon composed of 836 places in 1 ms
Iterating global reduction 2 with 17 rules applied. Total rules applied 1917 place count 1412 transition count 1854
Deduced a syphon composed of 836 places in 1 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 1926 place count 1412 transition count 1845
Deduced a syphon composed of 836 places in 2 ms
Applied a total of 1926 rules in 1030 ms. Remains 1412 /1772 variables (removed 360) and now considering 1845/1622 (removed -223) transitions.
[2023-03-21 22:44:53] [INFO ] Redundant transitions in 21 ms returned []
// Phase 1: matrix 1845 rows 1412 cols
[2023-03-21 22:44:53] [INFO ] Computed 271 place invariants in 25 ms
[2023-03-21 22:44:53] [INFO ] Dead Transitions using invariants and state equation in 860 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1412/1772 places, 1845/1622 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1933 ms. Remains : 1412/1772 places, 1845/1622 transitions.
Support contains 3 out of 1772 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1772/1772 places, 1622/1622 transitions.
Applied a total of 0 rules in 90 ms. Remains 1772 /1772 variables (removed 0) and now considering 1622/1622 (removed 0) transitions.
// Phase 1: matrix 1622 rows 1772 cols
[2023-03-21 22:44:54] [INFO ] Computed 271 place invariants in 4 ms
[2023-03-21 22:44:54] [INFO ] Implicit Places using invariants in 865 ms returned []
[2023-03-21 22:44:54] [INFO ] Invariant cache hit.
[2023-03-21 22:44:59] [INFO ] Implicit Places using invariants and state equation in 4418 ms returned []
Implicit Place search using SMT with State Equation took 5334 ms to find 0 implicit places.
[2023-03-21 22:44:59] [INFO ] Invariant cache hit.
[2023-03-21 22:45:00] [INFO ] Dead Transitions using invariants and state equation in 982 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6420 ms. Remains : 1772/1772 places, 1622/1622 transitions.
Treatment of property ShieldIIPt-PT-030B-LTLFireability-12 finished in 23320 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 2 out of 1781 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1781/1781 places, 1631/1631 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 361 transitions
Trivial Post-agglo rules discarded 361 transitions
Performed 361 trivial Post agglomeration. Transition count delta: 361
Iterating post reduction 0 with 361 rules applied. Total rules applied 361 place count 1780 transition count 1269
Reduce places removed 361 places and 0 transitions.
Iterating post reduction 1 with 361 rules applied. Total rules applied 722 place count 1419 transition count 1269
Performed 233 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 233 Pre rules applied. Total rules applied 722 place count 1419 transition count 1036
Deduced a syphon composed of 233 places in 1 ms
Reduce places removed 233 places and 0 transitions.
Iterating global reduction 2 with 466 rules applied. Total rules applied 1188 place count 1186 transition count 1036
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 1193 place count 1181 transition count 1031
Iterating global reduction 2 with 5 rules applied. Total rules applied 1198 place count 1181 transition count 1031
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 1198 place count 1181 transition count 1026
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 1208 place count 1176 transition count 1026
Performed 511 Post agglomeration using F-continuation condition.Transition count delta: 511
Deduced a syphon composed of 511 places in 0 ms
Reduce places removed 511 places and 0 transitions.
Iterating global reduction 2 with 1022 rules applied. Total rules applied 2230 place count 665 transition count 515
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2231 place count 665 transition count 514
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 3 with 2 rules applied. Total rules applied 2233 place count 664 transition count 513
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 3 with 176 rules applied. Total rules applied 2409 place count 576 transition count 571
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2411 place count 574 transition count 569
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2413 place count 572 transition count 569
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2413 place count 572 transition count 568
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 2415 place count 571 transition count 568
Applied a total of 2415 rules in 298 ms. Remains 571 /1781 variables (removed 1210) and now considering 568/1631 (removed 1063) transitions.
// Phase 1: matrix 568 rows 571 cols
[2023-03-21 22:45:00] [INFO ] Computed 269 place invariants in 1 ms
[2023-03-21 22:45:01] [INFO ] Implicit Places using invariants in 310 ms returned [558]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 311 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 570/1781 places, 568/1631 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 569 transition count 567
Applied a total of 2 rules in 16 ms. Remains 569 /570 variables (removed 1) and now considering 567/568 (removed 1) transitions.
// Phase 1: matrix 567 rows 569 cols
[2023-03-21 22:45:01] [INFO ] Computed 268 place invariants in 0 ms
[2023-03-21 22:45:01] [INFO ] Implicit Places using invariants in 293 ms returned []
[2023-03-21 22:45:01] [INFO ] Invariant cache hit.
[2023-03-21 22:45:01] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-21 22:45:02] [INFO ] Implicit Places using invariants and state equation in 804 ms returned []
Implicit Place search using SMT with State Equation took 1099 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 569/1781 places, 567/1631 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1724 ms. Remains : 569/1781 places, 567/1631 transitions.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-030B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(EQ s400 1), p0:(EQ s568 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 711 ms.
Product exploration explored 100000 steps with 50000 reset in 830 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/569 stabilizing places and 2/567 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 475 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p1) (NOT p0))]
Finished random walk after 245 steps, including 0 resets, run visited all 2 properties in 15 ms. (steps per millisecond=16 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 6 factoid took 541 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p1) (NOT p0))]
[2023-03-21 22:45:04] [INFO ] Invariant cache hit.
[2023-03-21 22:45:06] [INFO ] [Real]Absence check using 268 positive place invariants in 180 ms returned sat
[2023-03-21 22:45:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:45:07] [INFO ] [Real]Absence check using state equation in 997 ms returned sat
[2023-03-21 22:45:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:45:07] [INFO ] [Nat]Absence check using 268 positive place invariants in 103 ms returned sat
[2023-03-21 22:45:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:45:08] [INFO ] [Nat]Absence check using state equation in 692 ms returned sat
[2023-03-21 22:45:08] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-21 22:45:08] [INFO ] [Nat]Added 3 Read/Feed constraints in 6 ms returned sat
[2023-03-21 22:45:08] [INFO ] Deduced a trap composed of 4 places in 261 ms of which 26 ms to minimize.
[2023-03-21 22:45:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 337 ms
[2023-03-21 22:45:08] [INFO ] Computed and/alt/rep : 566/868/566 causal constraints (skipped 0 transitions) in 80 ms.
[2023-03-21 22:45:22] [INFO ] Added : 518 causal constraints over 105 iterations in 13486 ms. Result :unknown
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 2 out of 569 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 569/569 places, 567/567 transitions.
Applied a total of 0 rules in 11 ms. Remains 569 /569 variables (removed 0) and now considering 567/567 (removed 0) transitions.
[2023-03-21 22:45:22] [INFO ] Invariant cache hit.
[2023-03-21 22:45:22] [INFO ] Implicit Places using invariants in 446 ms returned []
[2023-03-21 22:45:22] [INFO ] Invariant cache hit.
[2023-03-21 22:45:22] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-21 22:45:23] [INFO ] Implicit Places using invariants and state equation in 913 ms returned []
Implicit Place search using SMT with State Equation took 1362 ms to find 0 implicit places.
[2023-03-21 22:45:23] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-21 22:45:23] [INFO ] Invariant cache hit.
[2023-03-21 22:45:24] [INFO ] Dead Transitions using invariants and state equation in 532 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1924 ms. Remains : 569/569 places, 567/567 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/569 stabilizing places and 2/567 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 331 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p1) (NOT p0))]
Finished random walk after 1530 steps, including 0 resets, run visited all 2 properties in 17 ms. (steps per millisecond=90 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 6 factoid took 310 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p1) (NOT p0))]
[2023-03-21 22:45:24] [INFO ] Invariant cache hit.
[2023-03-21 22:45:25] [INFO ] [Real]Absence check using 268 positive place invariants in 106 ms returned sat
[2023-03-21 22:45:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 22:45:26] [INFO ] [Real]Absence check using state equation in 582 ms returned sat
[2023-03-21 22:45:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 22:45:26] [INFO ] [Nat]Absence check using 268 positive place invariants in 113 ms returned sat
[2023-03-21 22:45:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 22:45:27] [INFO ] [Nat]Absence check using state equation in 901 ms returned sat
[2023-03-21 22:45:27] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-21 22:45:27] [INFO ] [Nat]Added 3 Read/Feed constraints in 5 ms returned sat
[2023-03-21 22:45:27] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2023-03-21 22:45:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2023-03-21 22:45:27] [INFO ] Computed and/alt/rep : 566/868/566 causal constraints (skipped 0 transitions) in 84 ms.
[2023-03-21 22:45:41] [INFO ] Added : 518 causal constraints over 105 iterations in 13522 ms. Result :unknown
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 50000 reset in 762 ms.
Product exploration explored 100000 steps with 50000 reset in 836 ms.
Support contains 2 out of 569 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 569/569 places, 567/567 transitions.
Applied a total of 0 rules in 10 ms. Remains 569 /569 variables (removed 0) and now considering 567/567 (removed 0) transitions.
[2023-03-21 22:45:42] [INFO ] Invariant cache hit.
[2023-03-21 22:45:43] [INFO ] Implicit Places using invariants in 487 ms returned []
[2023-03-21 22:45:43] [INFO ] Invariant cache hit.
[2023-03-21 22:45:43] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-21 22:45:44] [INFO ] Implicit Places using invariants and state equation in 980 ms returned []
Implicit Place search using SMT with State Equation took 1483 ms to find 0 implicit places.
[2023-03-21 22:45:44] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-21 22:45:44] [INFO ] Invariant cache hit.
[2023-03-21 22:45:44] [INFO ] Dead Transitions using invariants and state equation in 347 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1867 ms. Remains : 569/569 places, 567/567 transitions.
Treatment of property ShieldIIPt-PT-030B-LTLFireability-14 finished in 44239 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F(p1)))))'
Support contains 2 out of 1781 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1781/1781 places, 1631/1631 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1771 transition count 1621
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1771 transition count 1621
Applied a total of 20 rules in 180 ms. Remains 1771 /1781 variables (removed 10) and now considering 1621/1631 (removed 10) transitions.
// Phase 1: matrix 1621 rows 1771 cols
[2023-03-21 22:45:44] [INFO ] Computed 271 place invariants in 10 ms
[2023-03-21 22:45:45] [INFO ] Implicit Places using invariants in 872 ms returned []
[2023-03-21 22:45:45] [INFO ] Invariant cache hit.
[2023-03-21 22:45:47] [INFO ] Implicit Places using invariants and state equation in 1860 ms returned []
Implicit Place search using SMT with State Equation took 2765 ms to find 0 implicit places.
[2023-03-21 22:45:47] [INFO ] Invariant cache hit.
[2023-03-21 22:45:48] [INFO ] Dead Transitions using invariants and state equation in 1134 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1771/1781 places, 1621/1631 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4080 ms. Remains : 1771/1781 places, 1621/1631 transitions.
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (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: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s751 1), p0:(NEQ s867 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 0 reset in 609 ms.
Stack based approach found an accepted trace after 2995 steps with 0 reset with depth 2996 and stack size 2996 in 27 ms.
FORMULA ShieldIIPt-PT-030B-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-030B-LTLFireability-15 finished in 4928 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G(p1)))'
Found a Shortening insensitive property : ShieldIIPt-PT-030B-LTLFireability-12
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 1781 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1781/1781 places, 1631/1631 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 361 transitions
Trivial Post-agglo rules discarded 361 transitions
Performed 361 trivial Post agglomeration. Transition count delta: 361
Iterating post reduction 0 with 361 rules applied. Total rules applied 361 place count 1780 transition count 1269
Reduce places removed 361 places and 0 transitions.
Iterating post reduction 1 with 361 rules applied. Total rules applied 722 place count 1419 transition count 1269
Performed 233 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 233 Pre rules applied. Total rules applied 722 place count 1419 transition count 1036
Deduced a syphon composed of 233 places in 3 ms
Reduce places removed 233 places and 0 transitions.
Iterating global reduction 2 with 466 rules applied. Total rules applied 1188 place count 1186 transition count 1036
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1194 place count 1180 transition count 1030
Iterating global reduction 2 with 6 rules applied. Total rules applied 1200 place count 1180 transition count 1030
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 1200 place count 1180 transition count 1024
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 1212 place count 1174 transition count 1024
Performed 508 Post agglomeration using F-continuation condition.Transition count delta: 508
Deduced a syphon composed of 508 places in 1 ms
Reduce places removed 508 places and 0 transitions.
Iterating global reduction 2 with 1016 rules applied. Total rules applied 2228 place count 666 transition count 516
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2229 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 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2231 place count 665 transition count 514
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 2407 place count 577 transition count 571
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2409 place count 575 transition count 569
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 2411 place count 573 transition count 569
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 2411 place count 573 transition count 568
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 2413 place count 572 transition count 568
Applied a total of 2413 rules in 303 ms. Remains 572 /1781 variables (removed 1209) and now considering 568/1631 (removed 1063) transitions.
// Phase 1: matrix 568 rows 572 cols
[2023-03-21 22:45:50] [INFO ] Computed 269 place invariants in 0 ms
[2023-03-21 22:45:50] [INFO ] Implicit Places using invariants in 414 ms returned [561]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 415 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 571/1781 places, 568/1631 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 567
Applied a total of 2 rules in 16 ms. Remains 570 /571 variables (removed 1) and now considering 567/568 (removed 1) transitions.
// Phase 1: matrix 567 rows 570 cols
[2023-03-21 22:45:50] [INFO ] Computed 268 place invariants in 2 ms
[2023-03-21 22:45:51] [INFO ] Implicit Places using invariants in 382 ms returned []
[2023-03-21 22:45:51] [INFO ] Invariant cache hit.
[2023-03-21 22:45:51] [INFO ] Implicit Places using invariants and state equation in 684 ms returned []
Implicit Place search using SMT with State Equation took 1080 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 570/1781 places, 567/1631 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1814 ms. Remains : 570/1781 places, 567/1631 transitions.
Running random walk in product with property : ShieldIIPt-PT-030B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s537 1) (EQ s556 1)), p1:(AND (OR (NEQ s537 1) (NEQ s556 1)) (EQ s438 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 13495 steps with 661 reset in 71 ms.
Treatment of property ShieldIIPt-PT-030B-LTLFireability-12 finished in 2199 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
[2023-03-21 22:45:52] [INFO ] Flatten gal took : 102 ms
[2023-03-21 22:45:52] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-21 22:45:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1781 places, 1631 transitions and 4222 arcs took 13 ms.
Total runtime 216907 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1680/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1680/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1680/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldIIPt-PT-030B-LTLFireability-08
Could not compute solution for formula : ShieldIIPt-PT-030B-LTLFireability-12
Could not compute solution for formula : ShieldIIPt-PT-030B-LTLFireability-14

BK_STOP 1679438755463

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ sed s/.jar//
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name ShieldIIPt-PT-030B-LTLFireability-08
ltl formula formula --ltl=/tmp/1680/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1781 places, 1631 transitions and 4222 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.390 real 0.100 user 0.200 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1680/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1680/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1680/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1680/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name ShieldIIPt-PT-030B-LTLFireability-12
ltl formula formula --ltl=/tmp/1680/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1781 places, 1631 transitions and 4222 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1680/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1680/ltl_1_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.460 real 0.130 user 0.210 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1680/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1680/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

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

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is 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 r393-oct2-167903716900300"
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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;