Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r425-tajo-167905977800155.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldRVs-PT-050B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r425-tajo-167905977800155
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.9K Feb 26 18:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 26 18:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 18:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 18:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K Feb 26 18:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 26 18:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 18:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 18:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:03 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 625K 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 ShieldRVs-PT-050B-LTLCardinality-00
FORMULA_NAME ShieldRVs-PT-050B-LTLCardinality-01
FORMULA_NAME ShieldRVs-PT-050B-LTLCardinality-02
FORMULA_NAME ShieldRVs-PT-050B-LTLCardinality-03
FORMULA_NAME ShieldRVs-PT-050B-LTLCardinality-04
FORMULA_NAME ShieldRVs-PT-050B-LTLCardinality-05
FORMULA_NAME ShieldRVs-PT-050B-LTLCardinality-06
FORMULA_NAME ShieldRVs-PT-050B-LTLCardinality-07
FORMULA_NAME ShieldRVs-PT-050B-LTLCardinality-08
FORMULA_NAME ShieldRVs-PT-050B-LTLCardinality-09
FORMULA_NAME ShieldRVs-PT-050B-LTLCardinality-10
FORMULA_NAME ShieldRVs-PT-050B-LTLCardinality-11
FORMULA_NAME ShieldRVs-PT-050B-LTLCardinality-12
FORMULA_NAME ShieldRVs-PT-050B-LTLCardinality-13
FORMULA_NAME ShieldRVs-PT-050B-LTLCardinality-14
FORMULA_NAME ShieldRVs-PT-050B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679302517994

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-050B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 08:55:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 08:55:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 08:55:21] [INFO ] Load time of PNML (sax parser for PT used): 142 ms
[2023-03-20 08:55:21] [INFO ] Transformed 2003 places.
[2023-03-20 08:55:21] [INFO ] Transformed 2253 transitions.
[2023-03-20 08:55:21] [INFO ] Found NUPN structural information;
[2023-03-20 08:55:21] [INFO ] Parsed PT model containing 2003 places and 2253 transitions and 7200 arcs in 329 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ShieldRVs-PT-050B-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050B-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050B-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050B-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050B-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050B-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050B-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050B-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-050B-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 2003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2003/2003 places, 2253/2253 transitions.
Discarding 334 places :
Symmetric choice reduction at 0 with 334 rule applications. Total rules 334 place count 1669 transition count 1919
Iterating global reduction 0 with 334 rules applied. Total rules applied 668 place count 1669 transition count 1919
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 669 place count 1668 transition count 1918
Iterating global reduction 0 with 1 rules applied. Total rules applied 670 place count 1668 transition count 1918
Applied a total of 670 rules in 434 ms. Remains 1668 /2003 variables (removed 335) and now considering 1918/2253 (removed 335) transitions.
// Phase 1: matrix 1918 rows 1668 cols
[2023-03-20 08:55:22] [INFO ] Computed 201 place invariants in 58 ms
[2023-03-20 08:55:22] [INFO ] Implicit Places using invariants in 905 ms returned []
[2023-03-20 08:55:22] [INFO ] Invariant cache hit.
[2023-03-20 08:55:25] [INFO ] Implicit Places using invariants and state equation in 2780 ms returned []
Implicit Place search using SMT with State Equation took 3714 ms to find 0 implicit places.
[2023-03-20 08:55:25] [INFO ] Invariant cache hit.
[2023-03-20 08:55:27] [INFO ] Dead Transitions using invariants and state equation in 1935 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1668/2003 places, 1918/2253 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6085 ms. Remains : 1668/2003 places, 1918/2253 transitions.
Support contains 33 out of 1668 places after structural reductions.
[2023-03-20 08:55:28] [INFO ] Flatten gal took : 324 ms
[2023-03-20 08:55:28] [INFO ] Flatten gal took : 199 ms
[2023-03-20 08:55:28] [INFO ] Input system was already deterministic with 1918 transitions.
Support contains 32 out of 1668 places (down from 33) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 511 ms. (steps per millisecond=19 ) properties (out of 17) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-20 08:55:29] [INFO ] Invariant cache hit.
[2023-03-20 08:55:30] [INFO ] After 485ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 08:55:30] [INFO ] [Nat]Absence check using 201 positive place invariants in 66 ms returned sat
[2023-03-20 08:55:31] [INFO ] After 997ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 08:55:32] [INFO ] Deduced a trap composed of 14 places in 331 ms of which 5 ms to minimize.
[2023-03-20 08:55:32] [INFO ] Deduced a trap composed of 28 places in 310 ms of which 1 ms to minimize.
[2023-03-20 08:55:33] [INFO ] Deduced a trap composed of 23 places in 455 ms of which 2 ms to minimize.
[2023-03-20 08:55:33] [INFO ] Deduced a trap composed of 33 places in 453 ms of which 3 ms to minimize.
[2023-03-20 08:55:34] [INFO ] Deduced a trap composed of 22 places in 454 ms of which 2 ms to minimize.
[2023-03-20 08:55:34] [INFO ] Deduced a trap composed of 21 places in 355 ms of which 0 ms to minimize.
[2023-03-20 08:55:34] [INFO ] Deduced a trap composed of 36 places in 351 ms of which 1 ms to minimize.
[2023-03-20 08:55:35] [INFO ] Deduced a trap composed of 15 places in 354 ms of which 1 ms to minimize.
[2023-03-20 08:55:35] [INFO ] Deduced a trap composed of 62 places in 336 ms of which 1 ms to minimize.
[2023-03-20 08:55:36] [INFO ] Deduced a trap composed of 26 places in 311 ms of which 1 ms to minimize.
[2023-03-20 08:55:36] [INFO ] Deduced a trap composed of 28 places in 302 ms of which 0 ms to minimize.
[2023-03-20 08:55:36] [INFO ] Deduced a trap composed of 48 places in 295 ms of which 0 ms to minimize.
[2023-03-20 08:55:37] [INFO ] Deduced a trap composed of 44 places in 303 ms of which 1 ms to minimize.
[2023-03-20 08:55:37] [INFO ] Deduced a trap composed of 56 places in 254 ms of which 1 ms to minimize.
[2023-03-20 08:55:37] [INFO ] Deduced a trap composed of 78 places in 272 ms of which 1 ms to minimize.
[2023-03-20 08:55:38] [INFO ] Deduced a trap composed of 28 places in 262 ms of which 1 ms to minimize.
[2023-03-20 08:55:38] [INFO ] Deduced a trap composed of 31 places in 256 ms of which 1 ms to minimize.
[2023-03-20 08:55:38] [INFO ] Deduced a trap composed of 62 places in 268 ms of which 13 ms to minimize.
[2023-03-20 08:55:39] [INFO ] Deduced a trap composed of 52 places in 275 ms of which 1 ms to minimize.
[2023-03-20 08:55:39] [INFO ] Deduced a trap composed of 30 places in 256 ms of which 1 ms to minimize.
[2023-03-20 08:55:39] [INFO ] Deduced a trap composed of 64 places in 352 ms of which 1 ms to minimize.
[2023-03-20 08:55:40] [INFO ] Deduced a trap composed of 33 places in 335 ms of which 0 ms to minimize.
[2023-03-20 08:55:40] [INFO ] Deduced a trap composed of 53 places in 406 ms of which 2 ms to minimize.
[2023-03-20 08:55:41] [INFO ] Deduced a trap composed of 27 places in 340 ms of which 1 ms to minimize.
[2023-03-20 08:55:41] [INFO ] Deduced a trap composed of 35 places in 282 ms of which 1 ms to minimize.
[2023-03-20 08:55:41] [INFO ] Deduced a trap composed of 27 places in 278 ms of which 1 ms to minimize.
[2023-03-20 08:55:42] [INFO ] Deduced a trap composed of 31 places in 289 ms of which 1 ms to minimize.
[2023-03-20 08:55:42] [INFO ] Deduced a trap composed of 54 places in 305 ms of which 1 ms to minimize.
[2023-03-20 08:55:42] [INFO ] Deduced a trap composed of 41 places in 352 ms of which 1 ms to minimize.
[2023-03-20 08:55:43] [INFO ] Deduced a trap composed of 44 places in 267 ms of which 0 ms to minimize.
[2023-03-20 08:55:43] [INFO ] Deduced a trap composed of 30 places in 279 ms of which 1 ms to minimize.
[2023-03-20 08:55:43] [INFO ] Deduced a trap composed of 21 places in 269 ms of which 1 ms to minimize.
[2023-03-20 08:55:44] [INFO ] Deduced a trap composed of 57 places in 259 ms of which 1 ms to minimize.
[2023-03-20 08:55:44] [INFO ] Deduced a trap composed of 48 places in 256 ms of which 2 ms to minimize.
[2023-03-20 08:55:44] [INFO ] Deduced a trap composed of 61 places in 319 ms of which 1 ms to minimize.
[2023-03-20 08:55:45] [INFO ] Deduced a trap composed of 67 places in 260 ms of which 0 ms to minimize.
[2023-03-20 08:55:45] [INFO ] Deduced a trap composed of 52 places in 242 ms of which 1 ms to minimize.
[2023-03-20 08:55:45] [INFO ] Deduced a trap composed of 51 places in 281 ms of which 7 ms to minimize.
[2023-03-20 08:55:46] [INFO ] Deduced a trap composed of 56 places in 259 ms of which 1 ms to minimize.
[2023-03-20 08:55:46] [INFO ] Deduced a trap composed of 40 places in 279 ms of which 2 ms to minimize.
[2023-03-20 08:55:46] [INFO ] Deduced a trap composed of 54 places in 302 ms of which 1 ms to minimize.
[2023-03-20 08:55:47] [INFO ] Deduced a trap composed of 44 places in 262 ms of which 1 ms to minimize.
[2023-03-20 08:55:47] [INFO ] Deduced a trap composed of 50 places in 261 ms of which 0 ms to minimize.
[2023-03-20 08:55:47] [INFO ] Deduced a trap composed of 59 places in 279 ms of which 1 ms to minimize.
[2023-03-20 08:55:48] [INFO ] Deduced a trap composed of 51 places in 280 ms of which 1 ms to minimize.
[2023-03-20 08:55:48] [INFO ] Deduced a trap composed of 53 places in 232 ms of which 1 ms to minimize.
[2023-03-20 08:55:48] [INFO ] Deduced a trap composed of 44 places in 221 ms of which 0 ms to minimize.
[2023-03-20 08:55:49] [INFO ] Deduced a trap composed of 49 places in 336 ms of which 1 ms to minimize.
[2023-03-20 08:55:49] [INFO ] Deduced a trap composed of 64 places in 232 ms of which 1 ms to minimize.
[2023-03-20 08:55:49] [INFO ] Deduced a trap composed of 61 places in 227 ms of which 1 ms to minimize.
[2023-03-20 08:55:50] [INFO ] Deduced a trap composed of 60 places in 213 ms of which 2 ms to minimize.
[2023-03-20 08:55:50] [INFO ] Deduced a trap composed of 33 places in 220 ms of which 1 ms to minimize.
[2023-03-20 08:55:50] [INFO ] Deduced a trap composed of 72 places in 232 ms of which 1 ms to minimize.
[2023-03-20 08:55:50] [INFO ] Deduced a trap composed of 50 places in 220 ms of which 1 ms to minimize.
[2023-03-20 08:55:51] [INFO ] Deduced a trap composed of 68 places in 240 ms of which 0 ms to minimize.
[2023-03-20 08:55:51] [INFO ] Deduced a trap composed of 47 places in 250 ms of which 6 ms to minimize.
[2023-03-20 08:55:51] [INFO ] Deduced a trap composed of 54 places in 231 ms of which 1 ms to minimize.
[2023-03-20 08:55:52] [INFO ] Deduced a trap composed of 47 places in 257 ms of which 1 ms to minimize.
[2023-03-20 08:55:52] [INFO ] Deduced a trap composed of 80 places in 277 ms of which 1 ms to minimize.
[2023-03-20 08:55:52] [INFO ] Deduced a trap composed of 58 places in 246 ms of which 1 ms to minimize.
[2023-03-20 08:55:53] [INFO ] Deduced a trap composed of 66 places in 242 ms of which 1 ms to minimize.
[2023-03-20 08:55:53] [INFO ] Deduced a trap composed of 40 places in 180 ms of which 0 ms to minimize.
[2023-03-20 08:55:53] [INFO ] Deduced a trap composed of 52 places in 137 ms of which 1 ms to minimize.
[2023-03-20 08:55:53] [INFO ] Deduced a trap composed of 64 places in 140 ms of which 1 ms to minimize.
[2023-03-20 08:55:53] [INFO ] Deduced a trap composed of 58 places in 123 ms of which 3 ms to minimize.
[2023-03-20 08:55:54] [INFO ] Deduced a trap composed of 63 places in 106 ms of which 0 ms to minimize.
[2023-03-20 08:55:54] [INFO ] Trap strengthening (SAT) tested/added 67/66 trap constraints in 22399 ms
[2023-03-20 08:55:54] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 2 ms to minimize.
[2023-03-20 08:55:54] [INFO ] Deduced a trap composed of 45 places in 181 ms of which 1 ms to minimize.
[2023-03-20 08:55:54] [INFO ] Deduced a trap composed of 37 places in 186 ms of which 0 ms to minimize.
[2023-03-20 08:55:54] [INFO ] Deduced a trap composed of 45 places in 143 ms of which 0 ms to minimize.
[2023-03-20 08:55:55] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 0 ms to minimize.
[2023-03-20 08:55:55] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1054 ms
[2023-03-20 08:55:55] [INFO ] After 24579ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-20 08:55:55] [INFO ] After 25061ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 254 ms.
Support contains 8 out of 1668 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1668/1668 places, 1918/1918 transitions.
Drop transitions removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 1668 transition count 1719
Reduce places removed 199 places and 0 transitions.
Iterating post reduction 1 with 199 rules applied. Total rules applied 398 place count 1469 transition count 1719
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 398 place count 1469 transition count 1469
Deduced a syphon composed of 250 places in 7 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 898 place count 1219 transition count 1469
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 908 place count 1209 transition count 1459
Iterating global reduction 2 with 10 rules applied. Total rules applied 918 place count 1209 transition count 1459
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 918 place count 1209 transition count 1455
Deduced a syphon composed of 4 places in 9 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 926 place count 1205 transition count 1455
Performed 495 Post agglomeration using F-continuation condition.Transition count delta: 495
Deduced a syphon composed of 495 places in 2 ms
Reduce places removed 495 places and 0 transitions.
Iterating global reduction 2 with 990 rules applied. Total rules applied 1916 place count 710 transition count 960
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 102 times.
Drop transitions removed 102 transitions
Iterating global reduction 2 with 102 rules applied. Total rules applied 2018 place count 710 transition count 960
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2019 place count 709 transition count 959
Applied a total of 2019 rules in 717 ms. Remains 709 /1668 variables (removed 959) and now considering 959/1918 (removed 959) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 718 ms. Remains : 709/1668 places, 959/1918 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 959 rows 709 cols
[2023-03-20 08:55:56] [INFO ] Computed 201 place invariants in 6 ms
[2023-03-20 08:55:56] [INFO ] [Real]Absence check using 201 positive place invariants in 51 ms returned sat
[2023-03-20 08:55:56] [INFO ] After 263ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 08:55:56] [INFO ] [Nat]Absence check using 201 positive place invariants in 57 ms returned sat
[2023-03-20 08:55:57] [INFO ] After 324ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 08:55:57] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 1 ms to minimize.
[2023-03-20 08:55:57] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 0 ms to minimize.
[2023-03-20 08:55:57] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 0 ms to minimize.
[2023-03-20 08:55:57] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2023-03-20 08:55:57] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 364 ms
[2023-03-20 08:55:57] [INFO ] After 748ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-20 08:55:57] [INFO ] After 1025ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 14 ms.
Support contains 6 out of 709 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 709/709 places, 959/959 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 709 transition count 958
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 708 transition count 958
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 707 transition count 957
Applied a total of 4 rules in 89 ms. Remains 707 /709 variables (removed 2) and now considering 957/959 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 707/709 places, 957/959 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 245 ms. (steps per millisecond=40 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 189658 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :{}
Probabilistic random walk after 189658 steps, saw 64247 distinct states, run finished after 3003 ms. (steps per millisecond=63 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 957 rows 707 cols
[2023-03-20 08:56:01] [INFO ] Computed 201 place invariants in 20 ms
[2023-03-20 08:56:01] [INFO ] [Real]Absence check using 201 positive place invariants in 35 ms returned sat
[2023-03-20 08:56:01] [INFO ] After 183ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 08:56:01] [INFO ] [Nat]Absence check using 201 positive place invariants in 24 ms returned sat
[2023-03-20 08:56:01] [INFO ] After 291ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 08:56:01] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 0 ms to minimize.
[2023-03-20 08:56:02] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 0 ms to minimize.
[2023-03-20 08:56:02] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
[2023-03-20 08:56:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 249 ms
[2023-03-20 08:56:02] [INFO ] After 604ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 60 ms.
[2023-03-20 08:56:02] [INFO ] After 826ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 46 ms.
Support contains 6 out of 707 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 707/707 places, 957/957 transitions.
Applied a total of 0 rules in 35 ms. Remains 707 /707 variables (removed 0) and now considering 957/957 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 707/707 places, 957/957 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 707/707 places, 957/957 transitions.
Applied a total of 0 rules in 21 ms. Remains 707 /707 variables (removed 0) and now considering 957/957 (removed 0) transitions.
[2023-03-20 08:56:02] [INFO ] Invariant cache hit.
[2023-03-20 08:56:02] [INFO ] Implicit Places using invariants in 420 ms returned []
[2023-03-20 08:56:02] [INFO ] Invariant cache hit.
[2023-03-20 08:56:03] [INFO ] Implicit Places using invariants and state equation in 806 ms returned []
Implicit Place search using SMT with State Equation took 1229 ms to find 0 implicit places.
[2023-03-20 08:56:03] [INFO ] Redundant transitions in 111 ms returned []
[2023-03-20 08:56:03] [INFO ] Invariant cache hit.
[2023-03-20 08:56:04] [INFO ] Dead Transitions using invariants and state equation in 563 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1939 ms. Remains : 707/707 places, 957/957 transitions.
Applied a total of 0 rules in 21 ms. Remains 707 /707 variables (removed 0) and now considering 957/957 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-20 08:56:04] [INFO ] Invariant cache hit.
[2023-03-20 08:56:04] [INFO ] [Real]Absence check using 201 positive place invariants in 31 ms returned sat
[2023-03-20 08:56:04] [INFO ] After 167ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 08:56:04] [INFO ] [Nat]Absence check using 201 positive place invariants in 23 ms returned sat
[2023-03-20 08:56:04] [INFO ] After 309ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 08:56:05] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2023-03-20 08:56:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2023-03-20 08:56:05] [INFO ] After 478ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-20 08:56:05] [INFO ] After 661ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
FORMULA ShieldRVs-PT-050B-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ShieldRVs-PT-050B-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 406 stabilizing places and 406 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(!p0) U !(p0 U p1))))))'
Support contains 4 out of 1668 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1668/1668 places, 1918/1918 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1654 transition count 1904
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1654 transition count 1904
Applied a total of 28 rules in 80 ms. Remains 1654 /1668 variables (removed 14) and now considering 1904/1918 (removed 14) transitions.
// Phase 1: matrix 1904 rows 1654 cols
[2023-03-20 08:56:05] [INFO ] Computed 201 place invariants in 11 ms
[2023-03-20 08:56:06] [INFO ] Implicit Places using invariants in 607 ms returned []
[2023-03-20 08:56:06] [INFO ] Invariant cache hit.
[2023-03-20 08:56:08] [INFO ] Implicit Places using invariants and state equation in 1924 ms returned []
Implicit Place search using SMT with State Equation took 2533 ms to find 0 implicit places.
[2023-03-20 08:56:08] [INFO ] Invariant cache hit.
[2023-03-20 08:56:09] [INFO ] Dead Transitions using invariants and state equation in 925 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1654/1668 places, 1904/1918 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3542 ms. Remains : 1654/1668 places, 1904/1918 transitions.
Stuttering acceptance computed with spot in 353 ms :[true, (OR p1 p0), p1, p1, p1, p1, p1, p1]
Running random walk in product with property : ShieldRVs-PT-050B-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 2}], [{ cond=true, acceptance={} source=6 dest: 5}], [{ cond=true, acceptance={} source=7 dest: 6}]], initial=7, aps=[p0:(OR (EQ s781 0) (EQ s577 1)), p1:(OR (EQ s1036 0) (EQ s989 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, 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 ShieldRVs-PT-050B-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050B-LTLCardinality-00 finished in 3998 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)&&F(G(((p1 U p2) U (p1&&F(p3)))))))'
Support contains 8 out of 1668 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1668/1668 places, 1918/1918 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 0 with 198 rules applied. Total rules applied 198 place count 1667 transition count 1719
Reduce places removed 198 places and 0 transitions.
Iterating post reduction 1 with 198 rules applied. Total rules applied 396 place count 1469 transition count 1719
Performed 249 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 249 Pre rules applied. Total rules applied 396 place count 1469 transition count 1470
Deduced a syphon composed of 249 places in 3 ms
Reduce places removed 249 places and 0 transitions.
Iterating global reduction 2 with 498 rules applied. Total rules applied 894 place count 1220 transition count 1470
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 908 place count 1206 transition count 1456
Iterating global reduction 2 with 14 rules applied. Total rules applied 922 place count 1206 transition count 1456
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 922 place count 1206 transition count 1452
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 930 place count 1202 transition count 1452
Performed 492 Post agglomeration using F-continuation condition.Transition count delta: 492
Deduced a syphon composed of 492 places in 2 ms
Reduce places removed 492 places and 0 transitions.
Iterating global reduction 2 with 984 rules applied. Total rules applied 1914 place count 710 transition count 960
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1916 place count 708 transition count 958
Applied a total of 1916 rules in 266 ms. Remains 708 /1668 variables (removed 960) and now considering 958/1918 (removed 960) transitions.
// Phase 1: matrix 958 rows 708 cols
[2023-03-20 08:56:09] [INFO ] Computed 201 place invariants in 4 ms
[2023-03-20 08:56:10] [INFO ] Implicit Places using invariants in 486 ms returned []
[2023-03-20 08:56:10] [INFO ] Invariant cache hit.
[2023-03-20 08:56:10] [INFO ] Implicit Places using invariants and state equation in 644 ms returned []
Implicit Place search using SMT with State Equation took 1135 ms to find 0 implicit places.
[2023-03-20 08:56:10] [INFO ] Redundant transitions in 136 ms returned [957]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 957 rows 708 cols
[2023-03-20 08:56:10] [INFO ] Computed 201 place invariants in 3 ms
[2023-03-20 08:56:11] [INFO ] Dead Transitions using invariants and state equation in 497 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 708/1668 places, 957/1918 transitions.
Applied a total of 0 rules in 39 ms. Remains 708 /708 variables (removed 0) and now considering 957/957 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2083 ms. Remains : 708/1668 places, 957/1918 transitions.
Stuttering acceptance computed with spot in 364 ms :[(OR (NOT p0) (NOT p1) (NOT p3)), (NOT p0), (OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), (NOT p3)]
Running random walk in product with property : ShieldRVs-PT-050B-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p3)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(OR p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 3}, { cond=(AND p1 (NOT p3)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p3)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s409 0) (EQ s656 1)), p1:(OR (EQ s312 0) (EQ s226 1)), p2:(OR (EQ s32 0) (EQ s680 1)), p3:(OR (EQ s179 0) (EQ s534 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 329 reset in 590 ms.
Product exploration explored 100000 steps with 328 reset in 602 ms.
Computed a total of 6 stabilizing places and 6 stable transitions
Computed a total of 6 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p0 p1 p2 p3), (X (NOT (AND p1 (NOT p3)))), (X p3), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (OR p1 p2)), (X (X (NOT (AND p1 (NOT p3))))), (X (X p3)), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (OR p1 p2)))]
False Knowledge obtained : [(X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2))))]
Knowledge based reduction with 11 factoid took 561 ms. Reduced automaton from 5 states, 13 edges and 4 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), (NOT p3)]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-20 08:56:14] [INFO ] Invariant cache hit.
[2023-03-20 08:56:14] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 08:56:14] [INFO ] [Nat]Absence check using 201 positive place invariants in 24 ms returned sat
[2023-03-20 08:56:14] [INFO ] After 276ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 08:56:14] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 0 ms to minimize.
[2023-03-20 08:56:14] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 0 ms to minimize.
[2023-03-20 08:56:14] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2023-03-20 08:56:14] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2023-03-20 08:56:14] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 0 ms to minimize.
[2023-03-20 08:56:15] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 0 ms to minimize.
[2023-03-20 08:56:15] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 0 ms to minimize.
[2023-03-20 08:56:15] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 1 ms to minimize.
[2023-03-20 08:56:15] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 737 ms
[2023-03-20 08:56:15] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 0 ms to minimize.
[2023-03-20 08:56:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2023-03-20 08:56:15] [INFO ] After 1217ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-03-20 08:56:15] [INFO ] After 1387ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 23 ms.
Support contains 4 out of 708 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 708/708 places, 957/957 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 708 transition count 956
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 707 transition count 956
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 706 transition count 955
Partial Free-agglomeration rule applied 101 times.
Drop transitions removed 101 transitions
Iterating global reduction 2 with 101 rules applied. Total rules applied 105 place count 706 transition count 955
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 107 place count 704 transition count 953
Applied a total of 107 rules in 169 ms. Remains 704 /708 variables (removed 4) and now considering 953/957 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 704/708 places, 953/957 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 103760 steps, run timeout after 3002 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 103760 steps, saw 101691 distinct states, run finished after 3015 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 953 rows 704 cols
[2023-03-20 08:56:19] [INFO ] Computed 201 place invariants in 7 ms
[2023-03-20 08:56:19] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 08:56:19] [INFO ] [Nat]Absence check using 201 positive place invariants in 34 ms returned sat
[2023-03-20 08:56:19] [INFO ] After 367ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 08:56:19] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2023-03-20 08:56:19] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 0 ms to minimize.
[2023-03-20 08:56:20] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 0 ms to minimize.
[2023-03-20 08:56:20] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 0 ms to minimize.
[2023-03-20 08:56:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 493 ms
[2023-03-20 08:56:20] [INFO ] After 963ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 70 ms.
[2023-03-20 08:56:20] [INFO ] After 1217ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 22 ms.
Support contains 4 out of 704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 704/704 places, 953/953 transitions.
Applied a total of 0 rules in 26 ms. Remains 704 /704 variables (removed 0) and now considering 953/953 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 704/704 places, 953/953 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 704/704 places, 953/953 transitions.
Applied a total of 0 rules in 21 ms. Remains 704 /704 variables (removed 0) and now considering 953/953 (removed 0) transitions.
[2023-03-20 08:56:20] [INFO ] Invariant cache hit.
[2023-03-20 08:56:20] [INFO ] Implicit Places using invariants in 453 ms returned []
[2023-03-20 08:56:20] [INFO ] Invariant cache hit.
[2023-03-20 08:56:21] [INFO ] Implicit Places using invariants and state equation in 900 ms returned []
Implicit Place search using SMT with State Equation took 1391 ms to find 0 implicit places.
[2023-03-20 08:56:21] [INFO ] Redundant transitions in 80 ms returned []
[2023-03-20 08:56:21] [INFO ] Invariant cache hit.
[2023-03-20 08:56:22] [INFO ] Dead Transitions using invariants and state equation in 454 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1966 ms. Remains : 704/704 places, 953/953 transitions.
Applied a total of 0 rules in 21 ms. Remains 704 /704 variables (removed 0) and now considering 953/953 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-20 08:56:22] [INFO ] Invariant cache hit.
[2023-03-20 08:56:22] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 08:56:22] [INFO ] [Nat]Absence check using 201 positive place invariants in 30 ms returned sat
[2023-03-20 08:56:23] [INFO ] After 352ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 08:56:23] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 0 ms to minimize.
[2023-03-20 08:56:23] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 0 ms to minimize.
[2023-03-20 08:56:23] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2023-03-20 08:56:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 276 ms
[2023-03-20 08:56:23] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2023-03-20 08:56:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2023-03-20 08:56:23] [INFO ] After 784ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 59 ms.
[2023-03-20 08:56:23] [INFO ] After 1002ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 p1 p2 p3), (X (NOT (AND p1 (NOT p3)))), (X p3), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X (OR p1 p2)), (X (X (NOT (AND p1 (NOT p3))))), (X (X p3)), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (OR p1 p2)))]
False Knowledge obtained : [(X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (F (NOT p3)), (F (AND (NOT p3) p1)), (F (AND (NOT p1) p2))]
Knowledge based reduction with 11 factoid took 681 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), (NOT p3)]
Support contains 6 out of 708 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 708/708 places, 957/957 transitions.
Applied a total of 0 rules in 18 ms. Remains 708 /708 variables (removed 0) and now considering 957/957 (removed 0) transitions.
// Phase 1: matrix 957 rows 708 cols
[2023-03-20 08:56:24] [INFO ] Computed 201 place invariants in 3 ms
[2023-03-20 08:56:24] [INFO ] Implicit Places using invariants in 304 ms returned []
[2023-03-20 08:56:24] [INFO ] Invariant cache hit.
[2023-03-20 08:56:25] [INFO ] Implicit Places using invariants and state equation in 641 ms returned []
Implicit Place search using SMT with State Equation took 959 ms to find 0 implicit places.
[2023-03-20 08:56:25] [INFO ] Redundant transitions in 194 ms returned []
[2023-03-20 08:56:25] [INFO ] Invariant cache hit.
[2023-03-20 08:56:26] [INFO ] Dead Transitions using invariants and state equation in 400 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1582 ms. Remains : 708/708 places, 957/957 transitions.
Computed a total of 6 stabilizing places and 6 stable transitions
Computed a total of 6 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p1 p2 p3), (X (NOT (AND (NOT p3) p1))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (OR p1 p2)), (X (X p3)), (X (X (NOT (AND (NOT p3) p1)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (OR p1 p2)))]
False Knowledge obtained : [(X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2))))]
Knowledge based reduction with 8 factoid took 413 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), (NOT p3)]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-20 08:56:26] [INFO ] Invariant cache hit.
[2023-03-20 08:56:27] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 08:56:27] [INFO ] [Nat]Absence check using 201 positive place invariants in 27 ms returned sat
[2023-03-20 08:56:27] [INFO ] After 283ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 08:56:27] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 1 ms to minimize.
[2023-03-20 08:56:27] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 0 ms to minimize.
[2023-03-20 08:56:27] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 1 ms to minimize.
[2023-03-20 08:56:28] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2023-03-20 08:56:28] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 0 ms to minimize.
[2023-03-20 08:56:28] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 0 ms to minimize.
[2023-03-20 08:56:28] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2023-03-20 08:56:28] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2023-03-20 08:56:28] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1005 ms
[2023-03-20 08:56:28] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 0 ms to minimize.
[2023-03-20 08:56:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2023-03-20 08:56:28] [INFO ] After 1494ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 69 ms.
[2023-03-20 08:56:28] [INFO ] After 1731ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 20 ms.
Support contains 4 out of 708 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 708/708 places, 957/957 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 708 transition count 956
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 707 transition count 956
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 706 transition count 955
Partial Free-agglomeration rule applied 101 times.
Drop transitions removed 101 transitions
Iterating global reduction 2 with 101 rules applied. Total rules applied 105 place count 706 transition count 955
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 107 place count 704 transition count 953
Applied a total of 107 rules in 83 ms. Remains 704 /708 variables (removed 4) and now considering 953/957 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 704/708 places, 953/957 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 193343 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :{}
Probabilistic random walk after 193343 steps, saw 189712 distinct states, run finished after 3002 ms. (steps per millisecond=64 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 953 rows 704 cols
[2023-03-20 08:56:32] [INFO ] Computed 201 place invariants in 13 ms
[2023-03-20 08:56:32] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 08:56:32] [INFO ] [Nat]Absence check using 201 positive place invariants in 30 ms returned sat
[2023-03-20 08:56:32] [INFO ] After 277ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 08:56:32] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2023-03-20 08:56:32] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2023-03-20 08:56:33] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2023-03-20 08:56:33] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 0 ms to minimize.
[2023-03-20 08:56:33] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 410 ms
[2023-03-20 08:56:33] [INFO ] After 790ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 69 ms.
[2023-03-20 08:56:33] [INFO ] After 1032ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 15 ms.
Support contains 4 out of 704 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 704/704 places, 953/953 transitions.
Applied a total of 0 rules in 21 ms. Remains 704 /704 variables (removed 0) and now considering 953/953 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 704/704 places, 953/953 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 704/704 places, 953/953 transitions.
Applied a total of 0 rules in 20 ms. Remains 704 /704 variables (removed 0) and now considering 953/953 (removed 0) transitions.
[2023-03-20 08:56:33] [INFO ] Invariant cache hit.
[2023-03-20 08:56:33] [INFO ] Implicit Places using invariants in 309 ms returned []
[2023-03-20 08:56:33] [INFO ] Invariant cache hit.
[2023-03-20 08:56:34] [INFO ] Implicit Places using invariants and state equation in 861 ms returned []
Implicit Place search using SMT with State Equation took 1173 ms to find 0 implicit places.
[2023-03-20 08:56:34] [INFO ] Redundant transitions in 89 ms returned []
[2023-03-20 08:56:34] [INFO ] Invariant cache hit.
[2023-03-20 08:56:35] [INFO ] Dead Transitions using invariants and state equation in 441 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1735 ms. Remains : 704/704 places, 953/953 transitions.
Applied a total of 0 rules in 16 ms. Remains 704 /704 variables (removed 0) and now considering 953/953 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-20 08:56:35] [INFO ] Invariant cache hit.
[2023-03-20 08:56:35] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 08:56:35] [INFO ] [Nat]Absence check using 201 positive place invariants in 27 ms returned sat
[2023-03-20 08:56:35] [INFO ] After 312ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 08:56:35] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 0 ms to minimize.
[2023-03-20 08:56:35] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 0 ms to minimize.
[2023-03-20 08:56:35] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 0 ms to minimize.
[2023-03-20 08:56:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 270 ms
[2023-03-20 08:56:36] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2023-03-20 08:56:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2023-03-20 08:56:36] [INFO ] After 724ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-20 08:56:36] [INFO ] After 915ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p1 p2 p3), (X (NOT (AND (NOT p3) p1))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (OR p1 p2)), (X (X p3)), (X (X (NOT (AND (NOT p3) p1)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (OR p1 p2)))]
False Knowledge obtained : [(X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (F (NOT p3)), (F (AND (NOT p3) p1)), (F (AND (NOT p1) p2))]
Knowledge based reduction with 8 factoid took 439 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), (OR (NOT p1) (NOT p3)), (NOT p3)]
Product exploration explored 100000 steps with 290 reset in 502 ms.
Product exploration explored 100000 steps with 305 reset in 653 ms.
Support contains 6 out of 708 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 708/708 places, 957/957 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 706 transition count 955
Applied a total of 1 rules in 38 ms. Remains 706 /708 variables (removed 2) and now considering 955/957 (removed 2) transitions.
// Phase 1: matrix 955 rows 706 cols
[2023-03-20 08:56:38] [INFO ] Computed 201 place invariants in 5 ms
[2023-03-20 08:56:38] [INFO ] Implicit Places using invariants in 319 ms returned []
[2023-03-20 08:56:38] [INFO ] Invariant cache hit.
[2023-03-20 08:56:39] [INFO ] Implicit Places using invariants and state equation in 775 ms returned []
Implicit Place search using SMT with State Equation took 1096 ms to find 0 implicit places.
[2023-03-20 08:56:39] [INFO ] Redundant transitions in 144 ms returned []
[2023-03-20 08:56:39] [INFO ] Invariant cache hit.
[2023-03-20 08:56:39] [INFO ] Dead Transitions using invariants and state equation in 460 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 706/708 places, 955/957 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1748 ms. Remains : 706/708 places, 955/957 transitions.
Treatment of property ShieldRVs-PT-050B-LTLCardinality-04 finished in 30773 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U (G(((p1 U p2) U p3)) U X(p2))))'
Support contains 8 out of 1668 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1668/1668 places, 1918/1918 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1655 transition count 1905
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1655 transition count 1905
Applied a total of 26 rules in 83 ms. Remains 1655 /1668 variables (removed 13) and now considering 1905/1918 (removed 13) transitions.
// Phase 1: matrix 1905 rows 1655 cols
[2023-03-20 08:56:40] [INFO ] Computed 201 place invariants in 12 ms
[2023-03-20 08:56:40] [INFO ] Implicit Places using invariants in 475 ms returned []
[2023-03-20 08:56:40] [INFO ] Invariant cache hit.
[2023-03-20 08:56:42] [INFO ] Implicit Places using invariants and state equation in 1518 ms returned []
Implicit Place search using SMT with State Equation took 1995 ms to find 0 implicit places.
[2023-03-20 08:56:42] [INFO ] Invariant cache hit.
[2023-03-20 08:56:43] [INFO ] Dead Transitions using invariants and state equation in 931 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1655/1668 places, 1905/1918 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3013 ms. Remains : 1655/1668 places, 1905/1918 transitions.
Stuttering acceptance computed with spot in 499 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : ShieldRVs-PT-050B-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=0 dest: 4}, { cond=(OR p3 p2 p1), acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 6}, { cond=(NOT p2), acceptance={} source=1 dest: 7}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=2 dest: 4}, { cond=(OR (AND p3 (NOT p2)) (AND (NOT p2) p1)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={} source=5 dest: 8}, { cond=(OR (AND p3 (NOT p2)) (AND (NOT p2) p1)), acceptance={} source=5 dest: 9}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 6}, { cond=true, acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={} source=8 dest: 3}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=8 dest: 6}, { cond=(OR (AND (NOT p3) p2 (NOT p0)) (AND (NOT p3) p1 (NOT p0))), acceptance={0} source=8 dest: 8}], [{ cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={} source=9 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=9 dest: 4}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=9 dest: 7}, { cond=(OR (AND (NOT p3) p2 (NOT p0)) (AND (NOT p3) p1 (NOT p0))), acceptance={} source=9 dest: 8}, { cond=(OR p3 p2 p1), acceptance={} source=9 dest: 9}]], initial=0, aps=[p3:(OR (EQ s791 0) (EQ s1525 1)), p2:(OR (EQ s231 0) (EQ s596 1)), p1:(OR (EQ s1122 0) (EQ s1080 1)), p0:(OR (EQ s1225 0) (EQ s148 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1144 ms.
Product exploration explored 100000 steps with 50000 reset in 1153 ms.
Computed a total of 400 stabilizing places and 400 stable transitions
Computed a total of 400 stabilizing places and 400 stable transitions
Detected a total of 400/1655 stabilizing places and 400/1905 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p3 p2 p1 p0), (X p2), (X (NOT (AND (NOT p3) (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (OR (AND p3 (NOT p2)) (AND (NOT p2) p1)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p3) (NOT p2) p1 (NOT p0))))), (X (X (NOT (OR (AND p3 (NOT p2)) (AND (NOT p2) p1))))), (X (X (OR p3 p2 p1))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0))))), true, (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (OR (AND (NOT p3) p2 (NOT p0)) (AND (NOT p3) p1 (NOT p0)))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p2)
Knowledge based reduction with 28 factoid took 329 ms. Reduced automaton from 10 states, 34 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVs-PT-050B-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-050B-LTLCardinality-05 finished in 6228 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(!p0)||(!p0&&F(!p1))))))'
Support contains 4 out of 1668 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1668/1668 places, 1918/1918 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 200 place count 1667 transition count 1717
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 1 with 200 rules applied. Total rules applied 400 place count 1467 transition count 1717
Performed 248 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 248 Pre rules applied. Total rules applied 400 place count 1467 transition count 1469
Deduced a syphon composed of 248 places in 3 ms
Reduce places removed 248 places and 0 transitions.
Iterating global reduction 2 with 496 rules applied. Total rules applied 896 place count 1219 transition count 1469
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 910 place count 1205 transition count 1455
Iterating global reduction 2 with 14 rules applied. Total rules applied 924 place count 1205 transition count 1455
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 924 place count 1205 transition count 1451
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 932 place count 1201 transition count 1451
Performed 493 Post agglomeration using F-continuation condition.Transition count delta: 493
Deduced a syphon composed of 493 places in 2 ms
Reduce places removed 493 places and 0 transitions.
Iterating global reduction 2 with 986 rules applied. Total rules applied 1918 place count 708 transition count 958
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1920 place count 706 transition count 956
Applied a total of 1920 rules in 255 ms. Remains 706 /1668 variables (removed 962) and now considering 956/1918 (removed 962) transitions.
// Phase 1: matrix 956 rows 706 cols
[2023-03-20 08:56:46] [INFO ] Computed 201 place invariants in 2 ms
[2023-03-20 08:56:46] [INFO ] Implicit Places using invariants in 333 ms returned []
[2023-03-20 08:56:46] [INFO ] Invariant cache hit.
[2023-03-20 08:56:47] [INFO ] Implicit Places using invariants and state equation in 921 ms returned []
Implicit Place search using SMT with State Equation took 1255 ms to find 0 implicit places.
[2023-03-20 08:56:48] [INFO ] Redundant transitions in 194 ms returned [955]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 955 rows 706 cols
[2023-03-20 08:56:48] [INFO ] Computed 201 place invariants in 2 ms
[2023-03-20 08:56:48] [INFO ] Dead Transitions using invariants and state equation in 435 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 706/1668 places, 955/1918 transitions.
Applied a total of 0 rules in 19 ms. Remains 706 /706 variables (removed 0) and now considering 955/955 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2169 ms. Remains : 706/1668 places, 955/1918 transitions.
Stuttering acceptance computed with spot in 108 ms :[p0, (AND p1 p0), p0]
Running random walk in product with property : ShieldRVs-PT-050B-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s600 0) (EQ s365 1)), p0:(OR (EQ s358 0) (EQ s355 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1403 steps with 9 reset in 8 ms.
FORMULA ShieldRVs-PT-050B-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050B-LTLCardinality-09 finished in 2310 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 1668 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1668/1668 places, 1918/1918 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 201 transitions
Trivial Post-agglo rules discarded 201 transitions
Performed 201 trivial Post agglomeration. Transition count delta: 201
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 1667 transition count 1716
Reduce places removed 201 places and 0 transitions.
Iterating post reduction 1 with 201 rules applied. Total rules applied 402 place count 1466 transition count 1716
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 402 place count 1466 transition count 1466
Deduced a syphon composed of 250 places in 3 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 902 place count 1216 transition count 1466
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 916 place count 1202 transition count 1452
Iterating global reduction 2 with 14 rules applied. Total rules applied 930 place count 1202 transition count 1452
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 930 place count 1202 transition count 1447
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 940 place count 1197 transition count 1447
Performed 492 Post agglomeration using F-continuation condition.Transition count delta: 492
Deduced a syphon composed of 492 places in 3 ms
Reduce places removed 492 places and 0 transitions.
Iterating global reduction 2 with 984 rules applied. Total rules applied 1924 place count 705 transition count 955
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1926 place count 703 transition count 953
Applied a total of 1926 rules in 239 ms. Remains 703 /1668 variables (removed 965) and now considering 953/1918 (removed 965) transitions.
// Phase 1: matrix 953 rows 703 cols
[2023-03-20 08:56:48] [INFO ] Computed 201 place invariants in 3 ms
[2023-03-20 08:56:49] [INFO ] Implicit Places using invariants in 316 ms returned []
[2023-03-20 08:56:49] [INFO ] Invariant cache hit.
[2023-03-20 08:56:50] [INFO ] Implicit Places using invariants and state equation in 742 ms returned []
Implicit Place search using SMT with State Equation took 1061 ms to find 0 implicit places.
[2023-03-20 08:56:50] [INFO ] Redundant transitions in 213 ms returned [952]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 952 rows 703 cols
[2023-03-20 08:56:50] [INFO ] Computed 201 place invariants in 3 ms
[2023-03-20 08:56:50] [INFO ] Dead Transitions using invariants and state equation in 472 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 703/1668 places, 952/1918 transitions.
Applied a total of 0 rules in 18 ms. Remains 703 /703 variables (removed 0) and now considering 952/952 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2018 ms. Remains : 703/1668 places, 952/1918 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-050B-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s417 0) (EQ s495 1) (EQ s323 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 670 steps with 0 reset in 4 ms.
FORMULA ShieldRVs-PT-050B-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-050B-LTLCardinality-14 finished in 2076 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)&&F(G(((p1 U p2) U (p1&&F(p3)))))))'
[2023-03-20 08:56:51] [INFO ] Flatten gal took : 71 ms
[2023-03-20 08:56:51] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-20 08:56:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1668 places, 1918 transitions and 6530 arcs took 13 ms.
Total runtime 90184 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1481/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldRVs-PT-050B-LTLCardinality-04

BK_STOP 1679302612097

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name ShieldRVs-PT-050B-LTLCardinality-04
ltl formula formula --ltl=/tmp/1481/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 1668 places, 1918 transitions and 6530 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.250 real 0.040 user 0.110 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1481/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1481/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1481/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1481/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 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:
corrupted size vs. prev_size in fastbins

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="ShieldRVs-PT-050B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is ShieldRVs-PT-050B, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r425-tajo-167905977800155"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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