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-167905978100340.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 ShieldRVt-PT-100A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r425-tajo-167905978100340
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 724K
-rw-r--r-- 1 mcc users 6.9K Feb 26 01:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 01:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 26 00:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Feb 26 00:27 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.9K Feb 25 17:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 17:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 02:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Feb 26 02:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 01:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 01:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:05 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 273K 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 ShieldRVt-PT-100A-LTLFireability-00
FORMULA_NAME ShieldRVt-PT-100A-LTLFireability-01
FORMULA_NAME ShieldRVt-PT-100A-LTLFireability-02
FORMULA_NAME ShieldRVt-PT-100A-LTLFireability-03
FORMULA_NAME ShieldRVt-PT-100A-LTLFireability-04
FORMULA_NAME ShieldRVt-PT-100A-LTLFireability-05
FORMULA_NAME ShieldRVt-PT-100A-LTLFireability-06
FORMULA_NAME ShieldRVt-PT-100A-LTLFireability-07
FORMULA_NAME ShieldRVt-PT-100A-LTLFireability-08
FORMULA_NAME ShieldRVt-PT-100A-LTLFireability-09
FORMULA_NAME ShieldRVt-PT-100A-LTLFireability-10
FORMULA_NAME ShieldRVt-PT-100A-LTLFireability-11
FORMULA_NAME ShieldRVt-PT-100A-LTLFireability-12
FORMULA_NAME ShieldRVt-PT-100A-LTLFireability-13
FORMULA_NAME ShieldRVt-PT-100A-LTLFireability-14
FORMULA_NAME ShieldRVt-PT-100A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679310986158

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=ShieldRVt-PT-100A
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 11:16:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 11:16:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 11:16:27] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2023-03-20 11:16:27] [INFO ] Transformed 803 places.
[2023-03-20 11:16:27] [INFO ] Transformed 803 transitions.
[2023-03-20 11:16:27] [INFO ] Found NUPN structural information;
[2023-03-20 11:16:27] [INFO ] Parsed PT model containing 803 places and 803 transitions and 3406 arcs in 148 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldRVt-PT-100A-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-100A-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-100A-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 803/803 places, 802/802 transitions.
Applied a total of 0 rules in 86 ms. Remains 803 /803 variables (removed 0) and now considering 802/802 (removed 0) transitions.
// Phase 1: matrix 802 rows 803 cols
[2023-03-20 11:16:28] [INFO ] Computed 401 place invariants in 22 ms
[2023-03-20 11:16:28] [INFO ] Implicit Places using invariants in 537 ms returned []
[2023-03-20 11:16:28] [INFO ] Invariant cache hit.
[2023-03-20 11:16:29] [INFO ] Implicit Places using invariants and state equation in 686 ms returned []
Implicit Place search using SMT with State Equation took 1249 ms to find 0 implicit places.
[2023-03-20 11:16:29] [INFO ] Invariant cache hit.
[2023-03-20 11:16:29] [INFO ] Dead Transitions using invariants and state equation in 414 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1752 ms. Remains : 803/803 places, 802/802 transitions.
Support contains 44 out of 803 places after structural reductions.
[2023-03-20 11:16:30] [INFO ] Flatten gal took : 133 ms
[2023-03-20 11:16:30] [INFO ] Flatten gal took : 66 ms
[2023-03-20 11:16:30] [INFO ] Input system was already deterministic with 802 transitions.
Support contains 43 out of 803 places (down from 44) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 463 ms. (steps per millisecond=21 ) properties (out of 28) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 25) seen :0
Running SMT prover for 25 properties.
[2023-03-20 11:16:31] [INFO ] Invariant cache hit.
[2023-03-20 11:16:31] [INFO ] [Real]Absence check using 401 positive place invariants in 49 ms returned sat
[2023-03-20 11:16:33] [INFO ] After 2451ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:25
[2023-03-20 11:16:34] [INFO ] [Nat]Absence check using 401 positive place invariants in 50 ms returned sat
[2023-03-20 11:16:38] [INFO ] After 3988ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :25
[2023-03-20 11:16:42] [INFO ] After 7834ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :25
Attempting to minimize the solution found.
Minimization took 2759 ms.
[2023-03-20 11:16:44] [INFO ] After 11330ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :25
Parikh walk visited 0 properties in 1987 ms.
Support contains 41 out of 803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 803/803 places, 802/802 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 802 transition count 801
Partial Free-agglomeration rule applied 93 times.
Drop transitions removed 93 transitions
Iterating global reduction 0 with 93 rules applied. Total rules applied 95 place count 802 transition count 801
Drop transitions removed 93 transitions
Redundant transition composition rules discarded 93 transitions
Iterating global reduction 0 with 93 rules applied. Total rules applied 188 place count 802 transition count 708
Applied a total of 188 rules in 245 ms. Remains 802 /803 variables (removed 1) and now considering 708/802 (removed 94) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 245 ms. Remains : 802/803 places, 708/802 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 300 ms. (steps per millisecond=33 ) properties (out of 25) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Running SMT prover for 21 properties.
// Phase 1: matrix 708 rows 802 cols
[2023-03-20 11:16:47] [INFO ] Computed 401 place invariants in 3 ms
[2023-03-20 11:16:48] [INFO ] [Real]Absence check using 401 positive place invariants in 60 ms returned sat
[2023-03-20 11:16:49] [INFO ] After 1800ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:21
[2023-03-20 11:16:49] [INFO ] [Nat]Absence check using 401 positive place invariants in 49 ms returned sat
[2023-03-20 11:16:53] [INFO ] After 3792ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :21
[2023-03-20 11:16:53] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 11:16:55] [INFO ] After 1581ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :21
[2023-03-20 11:16:58] [INFO ] After 4118ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :21
Attempting to minimize the solution found.
Minimization took 2320 ms.
[2023-03-20 11:17:00] [INFO ] After 10846ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :21
Parikh walk visited 0 properties in 1597 ms.
Support contains 37 out of 802 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 802/802 places, 708/708 transitions.
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 802 transition count 708
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 802 transition count 706
Applied a total of 4 rules in 75 ms. Remains 802 /802 variables (removed 0) and now considering 706/708 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 802/802 places, 706/708 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 319 ms. (steps per millisecond=31 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Finished probabilistic random walk after 40037 steps, run visited all 21 properties in 965 ms. (steps per millisecond=41 )
Probabilistic random walk after 40037 steps, saw 39380 distinct states, run finished after 972 ms. (steps per millisecond=41 ) properties seen :21
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((G(!p0) U p1)))))'
Support contains 4 out of 803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 803/803 places, 802/802 transitions.
Applied a total of 0 rules in 27 ms. Remains 803 /803 variables (removed 0) and now considering 802/802 (removed 0) transitions.
// Phase 1: matrix 802 rows 803 cols
[2023-03-20 11:17:03] [INFO ] Computed 401 place invariants in 6 ms
[2023-03-20 11:17:04] [INFO ] Implicit Places using invariants in 349 ms returned []
[2023-03-20 11:17:04] [INFO ] Invariant cache hit.
[2023-03-20 11:17:04] [INFO ] Implicit Places using invariants and state equation in 634 ms returned []
Implicit Place search using SMT with State Equation took 986 ms to find 0 implicit places.
[2023-03-20 11:17:04] [INFO ] Invariant cache hit.
[2023-03-20 11:17:05] [INFO ] Dead Transitions using invariants and state equation in 410 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1435 ms. Remains : 803/803 places, 802/802 transitions.
Stuttering acceptance computed with spot in 322 ms :[(NOT p1), (NOT p1), (NOT p1), true, p0, (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-100A-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s137 1), p0:(AND (EQ s400 1) (EQ s402 1) (EQ s407 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 713 ms.
Product exploration explored 100000 steps with 0 reset in 833 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 183 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 6 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(NOT p1), (NOT p1), (NOT p1), true, p0, (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 4) seen :0
Finished probabilistic random walk after 7583 steps, run visited all 4 properties in 171 ms. (steps per millisecond=44 )
Probabilistic random walk after 7583 steps, saw 7392 distinct states, run finished after 173 ms. (steps per millisecond=43 ) properties seen :4
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 4 factoid took 224 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 6 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (NOT p1), (NOT p1), true, p0, (NOT p1)]
Stuttering acceptance computed with spot in 156 ms :[(NOT p1), (NOT p1), (NOT p1), true, p0, (NOT p1)]
[2023-03-20 11:17:08] [INFO ] Invariant cache hit.
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1))), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 4 factoid took 133 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-100A-LTLFireability-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-100A-LTLFireability-00 finished in 5350 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(F(p1))||(G(p2)&&F(p3))))))'
Support contains 3 out of 803 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 803/803 places, 802/802 transitions.
Reduce places removed 1 places and 1 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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 800 transition count 800
Applied a total of 3 rules in 46 ms. Remains 800 /803 variables (removed 3) and now considering 800/802 (removed 2) transitions.
// Phase 1: matrix 800 rows 800 cols
[2023-03-20 11:17:09] [INFO ] Computed 400 place invariants in 3 ms
[2023-03-20 11:17:09] [INFO ] Implicit Places using invariants in 309 ms returned []
[2023-03-20 11:17:09] [INFO ] Invariant cache hit.
[2023-03-20 11:17:10] [INFO ] Implicit Places using invariants and state equation in 621 ms returned []
Implicit Place search using SMT with State Equation took 933 ms to find 0 implicit places.
[2023-03-20 11:17:10] [INFO ] Redundant transitions in 34 ms returned []
[2023-03-20 11:17:10] [INFO ] Invariant cache hit.
[2023-03-20 11:17:10] [INFO ] Dead Transitions using invariants and state equation in 390 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 800/803 places, 800/802 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1409 ms. Remains : 800/803 places, 800/802 transitions.
Stuttering acceptance computed with spot in 243 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : ShieldRVt-PT-100A-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=0 dest: 5}, { cond=p2, acceptance={} source=0 dest: 6}, { cond=(AND p2 (NOT p3)), acceptance={} source=0 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=2 dest: 5}, { cond=p2, acceptance={} source=2 dest: 6}, { cond=(AND p2 (NOT p3)), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 3}, { cond=p2, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=7 dest: 5}, { cond=(NOT p3), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(EQ s652 1), p2:(EQ s240 1), p1:(EQ s652 0), p3:(EQ s98 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 1 reset in 646 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 0 ms.
FORMULA ShieldRVt-PT-100A-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-100A-LTLFireability-01 finished in 2319 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 803 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 803/803 places, 802/802 transitions.
Reduce places removed 1 places and 1 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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 800 transition count 800
Applied a total of 3 rules in 68 ms. Remains 800 /803 variables (removed 3) and now considering 800/802 (removed 2) transitions.
[2023-03-20 11:17:11] [INFO ] Invariant cache hit.
[2023-03-20 11:17:11] [INFO ] Implicit Places using invariants in 330 ms returned []
[2023-03-20 11:17:11] [INFO ] Invariant cache hit.
[2023-03-20 11:17:12] [INFO ] Implicit Places using invariants and state equation in 707 ms returned []
Implicit Place search using SMT with State Equation took 1040 ms to find 0 implicit places.
[2023-03-20 11:17:12] [INFO ] Redundant transitions in 52 ms returned []
[2023-03-20 11:17:12] [INFO ] Invariant cache hit.
[2023-03-20 11:17:13] [INFO ] Dead Transitions using invariants and state equation in 374 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 800/803 places, 800/802 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1542 ms. Remains : 800/803 places, 800/802 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-100A-LTLFireability-02 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 s750 0) (NEQ s398 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 633 ms.
Stack based approach found an accepted trace after 564 steps with 0 reset with depth 565 and stack size 257 in 5 ms.
FORMULA ShieldRVt-PT-100A-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-100A-LTLFireability-02 finished in 2232 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||(F(p2)&&p1)))))'
Support contains 3 out of 803 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 803/803 places, 802/802 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 802 transition count 801
Applied a total of 2 rules in 38 ms. Remains 802 /803 variables (removed 1) and now considering 801/802 (removed 1) transitions.
// Phase 1: matrix 801 rows 802 cols
[2023-03-20 11:17:13] [INFO ] Computed 401 place invariants in 6 ms
[2023-03-20 11:17:14] [INFO ] Implicit Places using invariants in 425 ms returned [795]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 431 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 801/803 places, 801/802 transitions.
Applied a total of 0 rules in 30 ms. Remains 801 /801 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 499 ms. Remains : 801/803 places, 801/802 transitions.
Stuttering acceptance computed with spot in 90 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldRVt-PT-100A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s374 1) (EQ s377 1)), p0:(EQ s97 1), p2:(AND (EQ s374 1) (EQ s377 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 641 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA ShieldRVt-PT-100A-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-100A-LTLFireability-03 finished in 1257 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 1 out of 803 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 803/803 places, 802/802 transitions.
Reduce places removed 1 places and 1 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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 800 transition count 800
Applied a total of 3 rules in 49 ms. Remains 800 /803 variables (removed 3) and now considering 800/802 (removed 2) transitions.
// Phase 1: matrix 800 rows 800 cols
[2023-03-20 11:17:15] [INFO ] Computed 400 place invariants in 4 ms
[2023-03-20 11:17:15] [INFO ] Implicit Places using invariants in 327 ms returned []
[2023-03-20 11:17:15] [INFO ] Invariant cache hit.
[2023-03-20 11:17:15] [INFO ] Implicit Places using invariants and state equation in 624 ms returned []
Implicit Place search using SMT with State Equation took 952 ms to find 0 implicit places.
[2023-03-20 11:17:15] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-20 11:17:15] [INFO ] Invariant cache hit.
[2023-03-20 11:17:16] [INFO ] Dead Transitions using invariants and state equation in 447 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 800/803 places, 800/802 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1466 ms. Remains : 800/803 places, 800/802 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-100A-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s518 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 745 ms.
Stack based approach found an accepted trace after 27 steps with 0 reset with depth 28 and stack size 28 in 1 ms.
FORMULA ShieldRVt-PT-100A-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-100A-LTLFireability-04 finished in 2270 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&&F((p1&&X(!p2)))) U (G((G(p0)||(p0&&F((p1&&X(!p2))))))||(p3&&(G(p0)||(p0&&F((p1&&X(!p2)))))))))'
Support contains 2 out of 803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 803/803 places, 802/802 transitions.
Applied a total of 0 rules in 12 ms. Remains 803 /803 variables (removed 0) and now considering 802/802 (removed 0) transitions.
// Phase 1: matrix 802 rows 803 cols
[2023-03-20 11:17:17] [INFO ] Computed 401 place invariants in 8 ms
[2023-03-20 11:17:17] [INFO ] Implicit Places using invariants in 354 ms returned []
[2023-03-20 11:17:17] [INFO ] Invariant cache hit.
[2023-03-20 11:17:18] [INFO ] Implicit Places using invariants and state equation in 784 ms returned []
Implicit Place search using SMT with State Equation took 1140 ms to find 0 implicit places.
[2023-03-20 11:17:18] [INFO ] Invariant cache hit.
[2023-03-20 11:17:18] [INFO ] Dead Transitions using invariants and state equation in 470 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1624 ms. Remains : 803/803 places, 802/802 transitions.
Stuttering acceptance computed with spot in 220 ms :[p2, true, (OR (NOT p1) p2), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2)]
Running random walk in product with property : ShieldRVt-PT-100A-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND p1 p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={0} source=2 dest: 0}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p3)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1) p3), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1 p3), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=5 dest: 4}, { cond=(AND p0 p1 p2), acceptance={} source=5 dest: 5}]], initial=3, aps=[p1:(NEQ s747 1), p2:(AND (EQ s747 1) (EQ s511 1)), p0:(NEQ s511 1), p3:(OR (EQ s747 1) (EQ s511 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 105 reset in 750 ms.
Product exploration explored 100000 steps with 115 reset in 816 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0 (NOT p3)), (X (NOT (AND p0 p1 p3))), (X (NOT (AND p0 (NOT p1) p3))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) p1 p2))), (X (AND p0 (NOT p3))), (X (NOT (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p3)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 p1 p2)))), true, (X (X (NOT (AND p0 (NOT p1) p3)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND p0 (NOT p3)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 29 factoid took 959 ms. Reduced automaton from 6 states, 17 edges and 4 AP (stutter sensitive) to 6 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 245 ms :[p2, (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2), true, (OR (NOT p1) p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 327 ms. (steps per millisecond=30 ) properties (out of 15) seen :5
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 10) 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 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 66 ms. (steps per millisecond=151 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-20 11:17:22] [INFO ] Invariant cache hit.
[2023-03-20 11:17:23] [INFO ] [Real]Absence check using 401 positive place invariants in 50 ms returned sat
[2023-03-20 11:17:23] [INFO ] After 606ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0 real:5
[2023-03-20 11:17:23] [INFO ] [Nat]Absence check using 401 positive place invariants in 49 ms returned sat
[2023-03-20 11:17:24] [INFO ] After 1130ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :5
[2023-03-20 11:17:25] [INFO ] After 1334ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :5
Attempting to minimize the solution found.
Minimization took 129 ms.
[2023-03-20 11:17:25] [INFO ] After 1708ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :5
Fused 10 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 118 ms.
Support contains 2 out of 803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 803/803 places, 802/802 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 802 transition count 801
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 0 with 100 rules applied. Total rules applied 102 place count 802 transition count 801
Drop transitions removed 100 transitions
Redundant transition composition rules discarded 100 transitions
Iterating global reduction 0 with 100 rules applied. Total rules applied 202 place count 802 transition count 701
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 203 place count 801 transition count 700
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 204 place count 800 transition count 700
Applied a total of 204 rules in 85 ms. Remains 800 /803 variables (removed 3) and now considering 700/802 (removed 102) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 800/803 places, 700/802 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) 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 5) 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 5) seen :0
Finished probabilistic random walk after 4095 steps, run visited all 5 properties in 103 ms. (steps per millisecond=39 )
Probabilistic random walk after 4095 steps, saw 3986 distinct states, run finished after 104 ms. (steps per millisecond=39 ) properties seen :5
Found 5 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p2) p0 (NOT p3)), (X (NOT (AND p0 p1 p3))), (X (NOT (AND p0 (NOT p1) p3))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) p1 p2))), (X (AND p0 (NOT p3))), (X (NOT (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p3)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 p1 p2)))), true, (X (X (NOT (AND p0 (NOT p1) p3)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND p0 (NOT p3)))), (X (X p1)), (G (NOT (AND p0 p1 p3))), (G (NOT (AND p2 p0 p1))), (G (NOT (AND p2 p1))), (G (NOT (AND p2 p0 (NOT p1)))), (G (NOT (AND p2 (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F (NOT p1)), (F (AND p0 (NOT p1) p3)), (F (AND p2 (NOT p0) (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT p0)), (F (NOT (AND p0 (NOT p3)))), (F (AND p2 (NOT p1)))]
Knowledge based reduction with 34 factoid took 1583 ms. Reduced automaton from 6 states, 17 edges and 4 AP (stutter sensitive) to 5 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p0) p2), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (NOT p2) (NOT p0)), (OR (NOT p1) (AND (NOT p0) p2))]
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) p2), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (NOT p2) (NOT p0)), (OR (NOT p1) (AND (NOT p0) p2))]
Support contains 2 out of 803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 803/803 places, 802/802 transitions.
Applied a total of 0 rules in 12 ms. Remains 803 /803 variables (removed 0) and now considering 802/802 (removed 0) transitions.
[2023-03-20 11:17:28] [INFO ] Invariant cache hit.
[2023-03-20 11:17:28] [INFO ] Implicit Places using invariants in 431 ms returned []
[2023-03-20 11:17:28] [INFO ] Invariant cache hit.
[2023-03-20 11:17:29] [INFO ] Implicit Places using invariants and state equation in 639 ms returned []
Implicit Place search using SMT with State Equation took 1072 ms to find 0 implicit places.
[2023-03-20 11:17:29] [INFO ] Invariant cache hit.
[2023-03-20 11:17:29] [INFO ] Dead Transitions using invariants and state equation in 427 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1511 ms. Remains : 803/803 places, 802/802 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p3) p1), (X (OR (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (AND p0 (NOT p2) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p3))), (X p1), (X (X (OR (NOT p0) (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (OR (AND p0 p1) (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (AND p0 (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 499 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 5 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p1) (AND (NOT p0) p2)), (AND (NOT p0) p2), (OR (NOT p2) (NOT p0)), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 10) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) 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 4) 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 4) seen :0
Running SMT prover for 4 properties.
[2023-03-20 11:17:30] [INFO ] Invariant cache hit.
[2023-03-20 11:17:30] [INFO ] [Real]Absence check using 401 positive place invariants in 45 ms returned sat
[2023-03-20 11:17:31] [INFO ] After 532ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2023-03-20 11:17:31] [INFO ] [Nat]Absence check using 401 positive place invariants in 46 ms returned sat
[2023-03-20 11:17:32] [INFO ] After 802ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-20 11:17:32] [INFO ] After 928ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 75 ms.
[2023-03-20 11:17:32] [INFO ] After 1199ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 66 ms.
Support contains 2 out of 803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 803/803 places, 802/802 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 802 transition count 801
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 0 with 100 rules applied. Total rules applied 102 place count 802 transition count 801
Drop transitions removed 100 transitions
Redundant transition composition rules discarded 100 transitions
Iterating global reduction 0 with 100 rules applied. Total rules applied 202 place count 802 transition count 701
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 203 place count 801 transition count 700
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 204 place count 800 transition count 700
Applied a total of 204 rules in 81 ms. Remains 800 /803 variables (removed 3) and now considering 700/802 (removed 102) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 800/803 places, 700/802 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Finished probabilistic random walk after 3936 steps, run visited all 3 properties in 58 ms. (steps per millisecond=67 )
Probabilistic random walk after 3936 steps, saw 3830 distinct states, run finished after 59 ms. (steps per millisecond=66 ) properties seen :3
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p3) p1), (X (OR (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (AND p0 (NOT p2) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p3))), (X p1), (X (X (OR (NOT p0) (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (OR (AND p0 p1) (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (AND p0 (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X p1)), (G (OR (NOT p0) (NOT p2)))]
False Knowledge obtained : [(F (NOT p0)), (F (AND p0 (NOT p2) p3)), (F (NOT (AND p0 (NOT p2) (NOT p3)))), (F (OR (AND (NOT p0) p2) (NOT p1))), (F (AND (NOT p0) p2)), (F (NOT (OR (AND p0 p1) (AND (NOT p2) p1)))), (F (NOT p1)), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 19 factoid took 657 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 5 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[p2, (OR (NOT p0) (AND p1 p2 p3)), (OR (AND (NOT p0) (NOT p1)) (AND p1 p2)), true, (OR (NOT p1) p2)]
Stuttering acceptance computed with spot in 121 ms :[p2, (OR (NOT p0) (AND p1 p2 p3)), (OR (AND (NOT p0) (NOT p1)) (AND p1 p2)), true, (OR (NOT p1) p2)]
Stuttering acceptance computed with spot in 122 ms :[p2, (OR (NOT p0) (AND p1 p2 p3)), (OR (AND (NOT p0) (NOT p1)) (AND p1 p2)), true, (OR (NOT p1) p2)]
Product exploration explored 100000 steps with 124 reset in 634 ms.
Product exploration explored 100000 steps with 112 reset in 790 ms.
Support contains 2 out of 803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 803/803 places, 802/802 transitions.
Applied a total of 0 rules in 13 ms. Remains 803 /803 variables (removed 0) and now considering 802/802 (removed 0) transitions.
[2023-03-20 11:17:35] [INFO ] Invariant cache hit.
[2023-03-20 11:17:35] [INFO ] Implicit Places using invariants in 319 ms returned []
[2023-03-20 11:17:35] [INFO ] Invariant cache hit.
[2023-03-20 11:17:36] [INFO ] Implicit Places using invariants and state equation in 629 ms returned []
Implicit Place search using SMT with State Equation took 950 ms to find 0 implicit places.
[2023-03-20 11:17:36] [INFO ] Invariant cache hit.
[2023-03-20 11:17:36] [INFO ] Dead Transitions using invariants and state equation in 402 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1366 ms. Remains : 803/803 places, 802/802 transitions.
Treatment of property ShieldRVt-PT-100A-LTLFireability-05 finished in 19581 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (G(!p0)||(!p0&&G(!p1)))))'
Support contains 5 out of 803 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 803/803 places, 802/802 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 802 transition count 801
Applied a total of 2 rules in 31 ms. Remains 802 /803 variables (removed 1) and now considering 801/802 (removed 1) transitions.
// Phase 1: matrix 801 rows 802 cols
[2023-03-20 11:17:36] [INFO ] Computed 401 place invariants in 3 ms
[2023-03-20 11:17:37] [INFO ] Implicit Places using invariants in 328 ms returned [795]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 330 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 801/803 places, 801/802 transitions.
Applied a total of 0 rules in 17 ms. Remains 801 /801 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 379 ms. Remains : 801/803 places, 801/802 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, p0, (AND p0 p1), p1]
Running random walk in product with property : ShieldRVt-PT-100A-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (EQ s646 1) (EQ s649 1)), p1:(AND (EQ s424 1) (EQ s426 1) (EQ s431 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 629 ms.
Product exploration explored 100000 steps with 0 reset in 820 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (X (NOT (AND p1 p0)))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 403 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[true, p0, p1, (AND p0 p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 801 rows 801 cols
[2023-03-20 11:17:39] [INFO ] Computed 400 place invariants in 6 ms
[2023-03-20 11:17:39] [INFO ] [Real]Absence check using 400 positive place invariants in 46 ms returned sat
[2023-03-20 11:17:40] [INFO ] After 544ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 11:17:40] [INFO ] [Nat]Absence check using 400 positive place invariants in 46 ms returned sat
[2023-03-20 11:17:41] [INFO ] After 962ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 11:17:41] [INFO ] After 1119ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 108 ms.
[2023-03-20 11:17:41] [INFO ] After 1424ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 74 ms.
Support contains 5 out of 801 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 801/801 places, 801/801 transitions.
Partial Free-agglomeration rule applied 99 times.
Drop transitions removed 99 transitions
Iterating global reduction 0 with 99 rules applied. Total rules applied 99 place count 801 transition count 801
Drop transitions removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 0 with 99 rules applied. Total rules applied 198 place count 801 transition count 702
Applied a total of 198 rules in 79 ms. Remains 801 /801 variables (removed 0) and now considering 702/801 (removed 99) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 801/801 places, 702/801 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 3) 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 3) 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 3) 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 3) seen :0
Finished probabilistic random walk after 48987 steps, run visited all 3 properties in 491 ms. (steps per millisecond=99 )
Probabilistic random walk after 48987 steps, saw 48289 distinct states, run finished after 492 ms. (steps per millisecond=99 ) properties seen :3
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (X (NOT (AND p1 p0)))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND p0 p1)), (F p1), (F (AND p0 (NOT p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Property proved to be false thanks to negative knowledge :(F (AND p0 p1))
Knowledge based reduction with 13 factoid took 235 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-100A-LTLFireability-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-100A-LTLFireability-07 finished in 6056 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 803 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 803/803 places, 802/802 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 802 transition count 801
Applied a total of 2 rules in 44 ms. Remains 802 /803 variables (removed 1) and now considering 801/802 (removed 1) transitions.
// Phase 1: matrix 801 rows 802 cols
[2023-03-20 11:17:42] [INFO ] Computed 401 place invariants in 3 ms
[2023-03-20 11:17:43] [INFO ] Implicit Places using invariants in 401 ms returned [795]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 403 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 801/803 places, 801/802 transitions.
Applied a total of 0 rules in 17 ms. Remains 801 /801 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 465 ms. Remains : 801/803 places, 801/802 transitions.
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-100A-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:(AND (EQ s315 1) (EQ s324 1) (EQ s330 1)), p0:(EQ s651 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 0 reset in 615 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 0 ms.
FORMULA ShieldRVt-PT-100A-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-100A-LTLFireability-08 finished in 1140 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 6 out of 803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 803/803 places, 802/802 transitions.
Applied a total of 0 rules in 12 ms. Remains 803 /803 variables (removed 0) and now considering 802/802 (removed 0) transitions.
// Phase 1: matrix 802 rows 803 cols
[2023-03-20 11:17:44] [INFO ] Computed 401 place invariants in 2 ms
[2023-03-20 11:17:44] [INFO ] Implicit Places using invariants in 402 ms returned []
[2023-03-20 11:17:44] [INFO ] Invariant cache hit.
[2023-03-20 11:17:45] [INFO ] Implicit Places using invariants and state equation in 716 ms returned []
Implicit Place search using SMT with State Equation took 1120 ms to find 0 implicit places.
[2023-03-20 11:17:45] [INFO ] Invariant cache hit.
[2023-03-20 11:17:45] [INFO ] Dead Transitions using invariants and state equation in 447 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1581 ms. Remains : 803/803 places, 802/802 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-100A-LTLFireability-09 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 s216 1) (EQ s218 1) (EQ s223 1)), p1:(OR (EQ s196 0) (EQ s197 0) (EQ s200 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 0 reset in 630 ms.
Product exploration explored 100000 steps with 0 reset in 792 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND p1 (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 230 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 84 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Finished probabilistic random walk after 28371 steps, run visited all 3 properties in 599 ms. (steps per millisecond=47 )
Probabilistic random walk after 28371 steps, saw 27837 distinct states, run finished after 600 ms. (steps per millisecond=47 ) properties seen :3
Knowledge obtained : [(AND (NOT p0) p1), (X (AND p1 (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT 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 291 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 83 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 803/803 places, 802/802 transitions.
Applied a total of 0 rules in 12 ms. Remains 803 /803 variables (removed 0) and now considering 802/802 (removed 0) transitions.
[2023-03-20 11:17:48] [INFO ] Invariant cache hit.
[2023-03-20 11:17:49] [INFO ] Implicit Places using invariants in 349 ms returned []
[2023-03-20 11:17:49] [INFO ] Invariant cache hit.
[2023-03-20 11:17:49] [INFO ] Implicit Places using invariants and state equation in 675 ms returned []
Implicit Place search using SMT with State Equation took 1027 ms to find 0 implicit places.
[2023-03-20 11:17:49] [INFO ] Invariant cache hit.
[2023-03-20 11:17:50] [INFO ] Dead Transitions using invariants and state equation in 420 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1460 ms. Remains : 803/803 places, 802/802 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 168 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 94 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :0
Finished probabilistic random walk after 28371 steps, run visited all 3 properties in 377 ms. (steps per millisecond=75 )
Probabilistic random walk after 28371 steps, saw 27837 distinct states, run finished after 378 ms. (steps per millisecond=75 ) properties seen :3
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) 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 229 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 77 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 658 ms.
Product exploration explored 100000 steps with 0 reset in 809 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 803 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 803/803 places, 802/802 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 803 transition count 802
Deduced a syphon composed of 1 places in 2 ms
Applied a total of 1 rules in 124 ms. Remains 803 /803 variables (removed 0) and now considering 802/802 (removed 0) transitions.
[2023-03-20 11:17:53] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 802 rows 803 cols
[2023-03-20 11:17:53] [INFO ] Computed 401 place invariants in 4 ms
[2023-03-20 11:17:54] [INFO ] Dead Transitions using invariants and state equation in 444 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 803/803 places, 802/802 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 589 ms. Remains : 803/803 places, 802/802 transitions.
Support contains 6 out of 803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 803/803 places, 802/802 transitions.
Applied a total of 0 rules in 18 ms. Remains 803 /803 variables (removed 0) and now considering 802/802 (removed 0) transitions.
// Phase 1: matrix 802 rows 803 cols
[2023-03-20 11:17:54] [INFO ] Computed 401 place invariants in 3 ms
[2023-03-20 11:17:54] [INFO ] Implicit Places using invariants in 335 ms returned []
[2023-03-20 11:17:54] [INFO ] Invariant cache hit.
[2023-03-20 11:17:55] [INFO ] Implicit Places using invariants and state equation in 618 ms returned []
Implicit Place search using SMT with State Equation took 955 ms to find 0 implicit places.
[2023-03-20 11:17:55] [INFO ] Invariant cache hit.
[2023-03-20 11:17:55] [INFO ] Dead Transitions using invariants and state equation in 409 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1385 ms. Remains : 803/803 places, 802/802 transitions.
Treatment of property ShieldRVt-PT-100A-LTLFireability-09 finished in 11585 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))'
Support contains 3 out of 803 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 803/803 places, 802/802 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 802 transition count 801
Applied a total of 2 rules in 32 ms. Remains 802 /803 variables (removed 1) and now considering 801/802 (removed 1) transitions.
// Phase 1: matrix 801 rows 802 cols
[2023-03-20 11:17:55] [INFO ] Computed 401 place invariants in 2 ms
[2023-03-20 11:17:55] [INFO ] Implicit Places using invariants in 326 ms returned [795]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 328 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 801/803 places, 801/802 transitions.
Applied a total of 0 rules in 18 ms. Remains 801 /801 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 378 ms. Remains : 801/803 places, 801/802 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-100A-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s539 1) (EQ s548 1) (EQ s554 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 595 ms.
Stack based approach found an accepted trace after 34 steps with 0 reset with depth 35 and stack size 35 in 0 ms.
FORMULA ShieldRVt-PT-100A-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-100A-LTLFireability-11 finished in 1026 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&&X(G(p1))))&&F(p2))))'
Support contains 4 out of 803 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 803/803 places, 802/802 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 802 transition count 801
Applied a total of 2 rules in 34 ms. Remains 802 /803 variables (removed 1) and now considering 801/802 (removed 1) transitions.
[2023-03-20 11:17:56] [INFO ] Invariant cache hit.
[2023-03-20 11:17:57] [INFO ] Implicit Places using invariants in 446 ms returned [795]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 448 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 801/803 places, 801/802 transitions.
Applied a total of 0 rules in 21 ms. Remains 801 /801 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 503 ms. Remains : 801/803 places, 801/802 transitions.
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-100A-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s131 1), p2:(AND (EQ s534 1) (EQ s537 1)), p1:(EQ s373 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 724 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA ShieldRVt-PT-100A-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-100A-LTLFireability-12 finished in 1433 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)||X(F(p1))))'
Support contains 5 out of 803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 803/803 places, 802/802 transitions.
Applied a total of 0 rules in 13 ms. Remains 803 /803 variables (removed 0) and now considering 802/802 (removed 0) transitions.
// Phase 1: matrix 802 rows 803 cols
[2023-03-20 11:17:58] [INFO ] Computed 401 place invariants in 4 ms
[2023-03-20 11:17:58] [INFO ] Implicit Places using invariants in 398 ms returned []
[2023-03-20 11:17:58] [INFO ] Invariant cache hit.
[2023-03-20 11:17:59] [INFO ] Implicit Places using invariants and state equation in 734 ms returned []
Implicit Place search using SMT with State Equation took 1133 ms to find 0 implicit places.
[2023-03-20 11:17:59] [INFO ] Invariant cache hit.
[2023-03-20 11:17:59] [INFO ] Dead Transitions using invariants and state equation in 399 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1548 ms. Remains : 803/803 places, 802/802 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-100A-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s244 1) (EQ s245 1) (EQ s248 1)), p1:(AND (EQ s1 1) (EQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 774 ms.
Stack based approach found an accepted trace after 29 steps with 0 reset with depth 30 and stack size 30 in 0 ms.
FORMULA ShieldRVt-PT-100A-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-100A-LTLFireability-13 finished in 2431 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 1 out of 803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 803/803 places, 802/802 transitions.
Applied a total of 0 rules in 12 ms. Remains 803 /803 variables (removed 0) and now considering 802/802 (removed 0) transitions.
[2023-03-20 11:18:00] [INFO ] Invariant cache hit.
[2023-03-20 11:18:00] [INFO ] Implicit Places using invariants in 386 ms returned []
[2023-03-20 11:18:00] [INFO ] Invariant cache hit.
[2023-03-20 11:18:01] [INFO ] Implicit Places using invariants and state equation in 654 ms returned []
Implicit Place search using SMT with State Equation took 1042 ms to find 0 implicit places.
[2023-03-20 11:18:01] [INFO ] Invariant cache hit.
[2023-03-20 11:18:01] [INFO ] Dead Transitions using invariants and state equation in 420 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1476 ms. Remains : 803/803 places, 802/802 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-100A-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(EQ s37 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, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 2006 ms.
Product exploration explored 100000 steps with 25000 reset in 1819 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 1) 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 1) seen :0
Finished probabilistic random walk after 38761 steps, run visited all 1 properties in 313 ms. (steps per millisecond=123 )
Probabilistic random walk after 38761 steps, saw 38148 distinct states, run finished after 315 ms. (steps per millisecond=123 ) properties seen :1
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 135 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 803/803 places, 802/802 transitions.
Applied a total of 0 rules in 18 ms. Remains 803 /803 variables (removed 0) and now considering 802/802 (removed 0) transitions.
[2023-03-20 11:18:07] [INFO ] Invariant cache hit.
[2023-03-20 11:18:07] [INFO ] Implicit Places using invariants in 377 ms returned []
[2023-03-20 11:18:07] [INFO ] Invariant cache hit.
[2023-03-20 11:18:08] [INFO ] Implicit Places using invariants and state equation in 699 ms returned []
Implicit Place search using SMT with State Equation took 1077 ms to find 0 implicit places.
[2023-03-20 11:18:08] [INFO ] Invariant cache hit.
[2023-03-20 11:18:08] [INFO ] Dead Transitions using invariants and state equation in 396 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1492 ms. Remains : 803/803 places, 802/802 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Finished probabilistic random walk after 38761 steps, run visited all 1 properties in 450 ms. (steps per millisecond=86 )
Probabilistic random walk after 38761 steps, saw 38148 distinct states, run finished after 452 ms. (steps per millisecond=85 ) properties seen :1
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 145 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 1861 ms.
Product exploration explored 100000 steps with 25000 reset in 2042 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 803 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 803/803 places, 802/802 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 803 transition count 802
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 1 rules in 56 ms. Remains 803 /803 variables (removed 0) and now considering 802/802 (removed 0) transitions.
[2023-03-20 11:18:14] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 802 rows 803 cols
[2023-03-20 11:18:14] [INFO ] Computed 401 place invariants in 4 ms
[2023-03-20 11:18:14] [INFO ] Dead Transitions using invariants and state equation in 542 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 803/803 places, 802/802 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 621 ms. Remains : 803/803 places, 802/802 transitions.
Support contains 1 out of 803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 803/803 places, 802/802 transitions.
Applied a total of 0 rules in 14 ms. Remains 803 /803 variables (removed 0) and now considering 802/802 (removed 0) transitions.
// Phase 1: matrix 802 rows 803 cols
[2023-03-20 11:18:14] [INFO ] Computed 401 place invariants in 2 ms
[2023-03-20 11:18:15] [INFO ] Implicit Places using invariants in 398 ms returned []
[2023-03-20 11:18:15] [INFO ] Invariant cache hit.
[2023-03-20 11:18:16] [INFO ] Implicit Places using invariants and state equation in 792 ms returned []
Implicit Place search using SMT with State Equation took 1191 ms to find 0 implicit places.
[2023-03-20 11:18:16] [INFO ] Invariant cache hit.
[2023-03-20 11:18:16] [INFO ] Dead Transitions using invariants and state equation in 403 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1608 ms. Remains : 803/803 places, 802/802 transitions.
Treatment of property ShieldRVt-PT-100A-LTLFireability-14 finished in 16005 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&&F((p1&&X(!p2)))) U (G((G(p0)||(p0&&F((p1&&X(!p2))))))||(p3&&(G(p0)||(p0&&F((p1&&X(!p2)))))))))'
Found a Shortening insensitive property : ShieldRVt-PT-100A-LTLFireability-05
Stuttering acceptance computed with spot in 213 ms :[p2, true, (OR (NOT p1) p2), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2)]
Support contains 2 out of 803 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 803/803 places, 802/802 transitions.
Reduce places removed 1 places and 1 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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 800 transition count 800
Applied a total of 3 rules in 32 ms. Remains 800 /803 variables (removed 3) and now considering 800/802 (removed 2) transitions.
// Phase 1: matrix 800 rows 800 cols
[2023-03-20 11:18:16] [INFO ] Computed 400 place invariants in 2 ms
[2023-03-20 11:18:17] [INFO ] Implicit Places using invariants in 341 ms returned []
[2023-03-20 11:18:17] [INFO ] Invariant cache hit.
[2023-03-20 11:18:17] [INFO ] Implicit Places using invariants and state equation in 659 ms returned []
Implicit Place search using SMT with State Equation took 1003 ms to find 0 implicit places.
[2023-03-20 11:18:17] [INFO ] Invariant cache hit.
[2023-03-20 11:18:18] [INFO ] Dead Transitions using invariants and state equation in 424 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 800/803 places, 800/802 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1460 ms. Remains : 800/803 places, 800/802 transitions.
Running random walk in product with property : ShieldRVt-PT-100A-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND p1 p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={0} source=2 dest: 0}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p3)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1) p3), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1 p3), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=5 dest: 4}, { cond=(AND p0 p1 p2), acceptance={} source=5 dest: 5}]], initial=3, aps=[p1:(NEQ s746 1), p2:(AND (EQ s746 1) (EQ s510 1)), p0:(NEQ s510 1), p3:(OR (EQ s746 1) (EQ s510 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 128 reset in 636 ms.
Product exploration explored 100000 steps with 101 reset in 785 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0 (NOT p3)), (X (NOT (AND p0 p1 p3))), (X (NOT (AND p0 (NOT p1) p3))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) p1 p2))), (X (AND p0 (NOT p3))), (X (NOT (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p3)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 p1 p2)))), true, (X (X (NOT (AND p0 (NOT p1) p3)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND p0 (NOT p3)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 29 factoid took 1472 ms. Reduced automaton from 6 states, 17 edges and 4 AP (stutter sensitive) to 6 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 247 ms :[p2, (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) p2), true, (OR (NOT p1) p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 384 ms. (steps per millisecond=26 ) properties (out of 15) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 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 89 ms. (steps per millisecond=112 ) properties (out of 10) seen :0
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 76 ms. (steps per millisecond=131 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-20 11:18:22] [INFO ] Invariant cache hit.
[2023-03-20 11:18:22] [INFO ] [Real]Absence check using 400 positive place invariants in 41 ms returned sat
[2023-03-20 11:18:23] [INFO ] After 568ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0 real:5
[2023-03-20 11:18:23] [INFO ] [Nat]Absence check using 400 positive place invariants in 47 ms returned sat
[2023-03-20 11:18:24] [INFO ] After 710ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :5
[2023-03-20 11:18:25] [INFO ] After 1813ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :5
Attempting to minimize the solution found.
Minimization took 1929 ms.
[2023-03-20 11:18:27] [INFO ] After 4019ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :5
Fused 10 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 154 ms.
Support contains 2 out of 800 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 800/800 places, 800/800 transitions.
Applied a total of 0 rules in 23 ms. Remains 800 /800 variables (removed 0) and now considering 800/800 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 800/800 places, 800/800 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 5) seen :0
Finished probabilistic random walk after 4337 steps, run visited all 5 properties in 93 ms. (steps per millisecond=46 )
Probabilistic random walk after 4337 steps, saw 4190 distinct states, run finished after 94 ms. (steps per millisecond=46 ) properties seen :5
Found 5 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p2) p0 (NOT p3)), (X (NOT (AND p0 p1 p3))), (X (NOT (AND p0 (NOT p1) p3))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) p1 p2))), (X (AND p0 (NOT p3))), (X (NOT (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p3)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 p1 p2)))), true, (X (X (NOT (AND p0 (NOT p1) p3)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND p0 (NOT p3)))), (X (X p1)), (G (NOT (AND p0 p1 p3))), (G (NOT (AND p2 p0 p1))), (G (NOT (AND p2 p1))), (G (NOT (AND p2 p0 (NOT p1)))), (G (NOT (AND p2 (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F (NOT p1)), (F (AND p0 (NOT p1) p3)), (F (AND p2 (NOT p0) (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT p0)), (F (NOT (AND p0 (NOT p3)))), (F (AND p2 (NOT p1)))]
Knowledge based reduction with 34 factoid took 1455 ms. Reduced automaton from 6 states, 17 edges and 4 AP (stutter sensitive) to 5 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p0) p2), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (NOT p2) (NOT p0)), (OR (NOT p1) (AND (NOT p0) p2))]
Stuttering acceptance computed with spot in 231 ms :[(AND (NOT p0) p2), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (NOT p2) (NOT p0)), (OR (NOT p1) (AND (NOT p0) p2))]
Support contains 2 out of 800 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 800/800 places, 800/800 transitions.
Applied a total of 0 rules in 22 ms. Remains 800 /800 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2023-03-20 11:18:30] [INFO ] Invariant cache hit.
[2023-03-20 11:18:30] [INFO ] Implicit Places using invariants in 356 ms returned []
[2023-03-20 11:18:30] [INFO ] Invariant cache hit.
[2023-03-20 11:18:31] [INFO ] Implicit Places using invariants and state equation in 661 ms returned []
Implicit Place search using SMT with State Equation took 1018 ms to find 0 implicit places.
[2023-03-20 11:18:31] [INFO ] Invariant cache hit.
[2023-03-20 11:18:31] [INFO ] Dead Transitions using invariants and state equation in 390 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1433 ms. Remains : 800/800 places, 800/800 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p3) p1), (X (OR (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (AND p0 (NOT p2) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p3))), (X p1), (X (X (OR (NOT p0) (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (OR (AND p0 p1) (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (AND p0 (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 562 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 5 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p1) (AND (NOT p0) p2)), (AND (NOT p0) p2), (OR (NOT p2) (NOT p0)), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 10) seen :6
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) 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 4) 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 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-20 11:18:32] [INFO ] Invariant cache hit.
[2023-03-20 11:18:32] [INFO ] [Real]Absence check using 400 positive place invariants in 50 ms returned sat
[2023-03-20 11:18:33] [INFO ] After 613ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2023-03-20 11:18:33] [INFO ] [Nat]Absence check using 400 positive place invariants in 44 ms returned sat
[2023-03-20 11:18:33] [INFO ] After 284ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-20 11:18:33] [INFO ] After 395ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 65 ms.
[2023-03-20 11:18:33] [INFO ] After 679ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 104 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=34 )
Parikh walk visited 3 properties in 4 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p3) p1), (X (OR (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (AND p0 (NOT p2) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p3))), (X p1), (X (X (OR (NOT p0) (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (OR (AND p0 p1) (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (AND p0 (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X p1)), (G (OR (NOT p0) (NOT p2)))]
False Knowledge obtained : [(F (NOT p0)), (F (AND p0 (NOT p2) p3)), (F (NOT (AND p0 (NOT p2) (NOT p3)))), (F (OR (AND (NOT p0) p2) (NOT p1))), (F (AND (NOT p0) p2)), (F (NOT (OR (AND p0 p1) (AND (NOT p2) p1)))), (F (NOT p1)), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 19 factoid took 855 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 5 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[p2, (OR (NOT p0) (AND p1 p2 p3)), (OR (AND (NOT p0) (NOT p1)) (AND p1 p2)), true, (OR (NOT p1) p2)]
Stuttering acceptance computed with spot in 145 ms :[p2, (OR (NOT p0) (AND p1 p2 p3)), (OR (AND (NOT p0) (NOT p1)) (AND p1 p2)), true, (OR (NOT p1) p2)]
Stuttering acceptance computed with spot in 154 ms :[p2, (OR (NOT p0) (AND p1 p2 p3)), (OR (AND (NOT p0) (NOT p1)) (AND p1 p2)), true, (OR (NOT p1) p2)]
Product exploration explored 100000 steps with 120 reset in 625 ms.
Product exploration explored 100000 steps with 125 reset in 771 ms.
Support contains 2 out of 800 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 800/800 places, 800/800 transitions.
Applied a total of 0 rules in 11 ms. Remains 800 /800 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2023-03-20 11:18:36] [INFO ] Invariant cache hit.
[2023-03-20 11:18:37] [INFO ] Implicit Places using invariants in 341 ms returned []
[2023-03-20 11:18:37] [INFO ] Invariant cache hit.
[2023-03-20 11:18:37] [INFO ] Implicit Places using invariants and state equation in 743 ms returned []
Implicit Place search using SMT with State Equation took 1085 ms to find 0 implicit places.
[2023-03-20 11:18:37] [INFO ] Invariant cache hit.
[2023-03-20 11:18:38] [INFO ] Dead Transitions using invariants and state equation in 390 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1488 ms. Remains : 800/800 places, 800/800 transitions.
Treatment of property ShieldRVt-PT-100A-LTLFireability-05 finished in 21761 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)))'
Found a Shortening insensitive property : ShieldRVt-PT-100A-LTLFireability-09
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 803 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 803/803 places, 802/802 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 802 transition count 801
Applied a total of 2 rules in 45 ms. Remains 802 /803 variables (removed 1) and now considering 801/802 (removed 1) transitions.
// Phase 1: matrix 801 rows 802 cols
[2023-03-20 11:18:38] [INFO ] Computed 401 place invariants in 2 ms
[2023-03-20 11:18:38] [INFO ] Implicit Places using invariants in 344 ms returned [795]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 346 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 801/803 places, 801/802 transitions.
Applied a total of 0 rules in 19 ms. Remains 801 /801 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 410 ms. Remains : 801/803 places, 801/802 transitions.
Running random walk in product with property : ShieldRVt-PT-100A-LTLFireability-09 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 s216 1) (EQ s218 1) (EQ s223 1)), p1:(OR (EQ s196 0) (EQ s197 0) (EQ s200 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]]
Product exploration explored 100000 steps with 0 reset in 720 ms.
Product exploration explored 100000 steps with 0 reset in 809 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND p1 (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 325 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 130 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 322 ms. (steps per millisecond=31 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 3) seen :0
Finished probabilistic random walk after 28452 steps, run visited all 3 properties in 439 ms. (steps per millisecond=64 )
Probabilistic random walk after 28452 steps, saw 27582 distinct states, run finished after 441 ms. (steps per millisecond=64 ) properties seen :3
Knowledge obtained : [(AND (NOT p0) p1), (X (AND p1 (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT 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 276 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 88 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 801 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 801/801 places, 801/801 transitions.
Applied a total of 0 rules in 12 ms. Remains 801 /801 variables (removed 0) and now considering 801/801 (removed 0) transitions.
// Phase 1: matrix 801 rows 801 cols
[2023-03-20 11:18:42] [INFO ] Computed 400 place invariants in 3 ms
[2023-03-20 11:18:42] [INFO ] Implicit Places using invariants in 323 ms returned []
[2023-03-20 11:18:42] [INFO ] Invariant cache hit.
[2023-03-20 11:18:43] [INFO ] Implicit Places using invariants and state equation in 769 ms returned []
Implicit Place search using SMT with State Equation took 1094 ms to find 0 implicit places.
[2023-03-20 11:18:43] [INFO ] Invariant cache hit.
[2023-03-20 11:18:43] [INFO ] Dead Transitions using invariants and state equation in 426 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1533 ms. Remains : 801/801 places, 801/801 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 172 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 89 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 297 ms. (steps per millisecond=33 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 3) seen :0
Finished probabilistic random walk after 28452 steps, run visited all 3 properties in 666 ms. (steps per millisecond=42 )
Probabilistic random walk after 28452 steps, saw 27582 distinct states, run finished after 669 ms. (steps per millisecond=42 ) properties seen :3
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) 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 275 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 116 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 817 ms.
Product exploration explored 100000 steps with 0 reset in 814 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 801 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 801/801 places, 801/801 transitions.
Applied a total of 0 rules in 21 ms. Remains 801 /801 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-20 11:18:47] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-20 11:18:47] [INFO ] Invariant cache hit.
[2023-03-20 11:18:48] [INFO ] Dead Transitions using invariants and state equation in 523 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 562 ms. Remains : 801/801 places, 801/801 transitions.
Support contains 6 out of 801 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 801/801 places, 801/801 transitions.
Applied a total of 0 rules in 13 ms. Remains 801 /801 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2023-03-20 11:18:48] [INFO ] Invariant cache hit.
[2023-03-20 11:18:48] [INFO ] Implicit Places using invariants in 347 ms returned []
[2023-03-20 11:18:48] [INFO ] Invariant cache hit.
[2023-03-20 11:18:49] [INFO ] Implicit Places using invariants and state equation in 663 ms returned []
Implicit Place search using SMT with State Equation took 1011 ms to find 0 implicit places.
[2023-03-20 11:18:49] [INFO ] Invariant cache hit.
[2023-03-20 11:18:49] [INFO ] Dead Transitions using invariants and state equation in 403 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1428 ms. Remains : 801/801 places, 801/801 transitions.
Treatment of property ShieldRVt-PT-100A-LTLFireability-09 finished in 11548 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Found a Shortening insensitive property : ShieldRVt-PT-100A-LTLFireability-14
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 803 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 803/803 places, 802/802 transitions.
Reduce places removed 1 places and 1 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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 800 transition count 800
Applied a total of 3 rules in 29 ms. Remains 800 /803 variables (removed 3) and now considering 800/802 (removed 2) transitions.
// Phase 1: matrix 800 rows 800 cols
[2023-03-20 11:18:49] [INFO ] Computed 400 place invariants in 5 ms
[2023-03-20 11:18:50] [INFO ] Implicit Places using invariants in 298 ms returned []
[2023-03-20 11:18:50] [INFO ] Invariant cache hit.
[2023-03-20 11:18:50] [INFO ] Implicit Places using invariants and state equation in 607 ms returned []
Implicit Place search using SMT with State Equation took 907 ms to find 0 implicit places.
[2023-03-20 11:18:50] [INFO ] Invariant cache hit.
[2023-03-20 11:18:51] [INFO ] Dead Transitions using invariants and state equation in 394 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 800/803 places, 800/802 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1332 ms. Remains : 800/803 places, 800/802 transitions.
Running random walk in product with property : ShieldRVt-PT-100A-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(EQ s36 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, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 663 ms.
Product exploration explored 100000 steps with 25000 reset in 811 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 92 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 1) 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 1) seen :0
Finished probabilistic random walk after 38780 steps, run visited all 1 properties in 309 ms. (steps per millisecond=125 )
Probabilistic random walk after 38780 steps, saw 37832 distinct states, run finished after 311 ms. (steps per millisecond=124 ) properties seen :1
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 117 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 800 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 800/800 places, 800/800 transitions.
Applied a total of 0 rules in 13 ms. Remains 800 /800 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2023-03-20 11:18:53] [INFO ] Invariant cache hit.
[2023-03-20 11:18:54] [INFO ] Implicit Places using invariants in 337 ms returned []
[2023-03-20 11:18:54] [INFO ] Invariant cache hit.
[2023-03-20 11:18:54] [INFO ] Implicit Places using invariants and state equation in 650 ms returned []
Implicit Place search using SMT with State Equation took 989 ms to find 0 implicit places.
[2023-03-20 11:18:54] [INFO ] Invariant cache hit.
[2023-03-20 11:18:55] [INFO ] Dead Transitions using invariants and state equation in 393 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1396 ms. Remains : 800/800 places, 800/800 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 62 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Finished probabilistic random walk after 38780 steps, run visited all 1 properties in 324 ms. (steps per millisecond=119 )
Probabilistic random walk after 38780 steps, saw 37832 distinct states, run finished after 326 ms. (steps per millisecond=118 ) properties seen :1
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 111 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 666 ms.
Product exploration explored 100000 steps with 25000 reset in 808 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 800 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 800/800 places, 800/800 transitions.
Applied a total of 0 rules in 16 ms. Remains 800 /800 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2023-03-20 11:18:58] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-20 11:18:58] [INFO ] Invariant cache hit.
[2023-03-20 11:18:58] [INFO ] Dead Transitions using invariants and state equation in 424 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 452 ms. Remains : 800/800 places, 800/800 transitions.
Support contains 1 out of 800 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 800/800 places, 800/800 transitions.
Applied a total of 0 rules in 11 ms. Remains 800 /800 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2023-03-20 11:18:58] [INFO ] Invariant cache hit.
[2023-03-20 11:18:58] [INFO ] Implicit Places using invariants in 300 ms returned []
[2023-03-20 11:18:58] [INFO ] Invariant cache hit.
[2023-03-20 11:18:59] [INFO ] Implicit Places using invariants and state equation in 629 ms returned []
Implicit Place search using SMT with State Equation took 931 ms to find 0 implicit places.
[2023-03-20 11:18:59] [INFO ] Invariant cache hit.
[2023-03-20 11:18:59] [INFO ] Dead Transitions using invariants and state equation in 380 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1323 ms. Remains : 800/800 places, 800/800 transitions.
Treatment of property ShieldRVt-PT-100A-LTLFireability-14 finished in 9990 ms.
[2023-03-20 11:18:59] [INFO ] Flatten gal took : 47 ms
[2023-03-20 11:18:59] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-20 11:18:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 803 places, 802 transitions and 3404 arcs took 6 ms.
Total runtime 152074 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2984/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2984/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2984/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldRVt-PT-100A-LTLFireability-05
Could not compute solution for formula : ShieldRVt-PT-100A-LTLFireability-09
Could not compute solution for formula : ShieldRVt-PT-100A-LTLFireability-14

BK_STOP 1679311140650

--------------------
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:
++ sed s/.jar//
++ 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
+ 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 ShieldRVt-PT-100A-LTLFireability-05
ltl formula formula --ltl=/tmp/2984/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 803 places, 802 transitions and 3404 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.060 real 0.010 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2984/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2984/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2984/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2984/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name ShieldRVt-PT-100A-LTLFireability-09
ltl formula formula --ltl=/tmp/2984/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: =============================================================================
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 803 places, 802 transitions and 3404 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.060 real 0.020 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2984/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2984/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2984/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2984/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 ShieldRVt-PT-100A-LTLFireability-14
ltl formula formula --ltl=/tmp/2984/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 803 places, 802 transitions and 3404 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.070 real 0.010 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2984/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2984/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2984/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2984/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 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:
0: pnml2lts-mc(+0xa23f4) [0x561787cfe3f4]
1: pnml2lts-mc(+0xa2496) [0x561787cfe496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f5901394140]
3: pnml2lts-mc(+0x405be5) [0x561788061be5]
4: pnml2lts-mc(+0x16b3f9) [0x561787dc73f9]
5: pnml2lts-mc(+0x164ac4) [0x561787dc0ac4]
6: pnml2lts-mc(+0x272e0a) [0x561787ecee0a]
7: pnml2lts-mc(+0xb61f0) [0x561787d121f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f59011e74d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f59011e767a]
10: pnml2lts-mc(+0xa1581) [0x561787cfd581]
11: pnml2lts-mc(+0xa1910) [0x561787cfd910]
12: pnml2lts-mc(+0xa32a2) [0x561787cff2a2]
13: pnml2lts-mc(+0xa50f4) [0x561787d010f4]
14: pnml2lts-mc(+0xa516b) [0x561787d0116b]
15: pnml2lts-mc(+0x3f34b3) [0x56178804f4b3]
16: pnml2lts-mc(+0x7c63d) [0x561787cd863d]
17: pnml2lts-mc(+0x67d86) [0x561787cc3d86]
18: pnml2lts-mc(+0x60a8a) [0x561787cbca8a]
19: pnml2lts-mc(+0x5eb15) [0x561787cbab15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f59011cfd0a]
21: pnml2lts-mc(+0x6075e) [0x561787cbc75e]

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="ShieldRVt-PT-100A"
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 ShieldRVt-PT-100A, 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 r425-tajo-167905978100340"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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