Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r222-tall-165286026100996.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldRVt-PT-030A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286026100996
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 320K
-rw-r--r-- 1 mcc users 6.5K Apr 30 00:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 30 00:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 30 00:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 30 00:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 9 09:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 09:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 09:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 09:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 09:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 09:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 82K May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldRVt-PT-030A-LTLFireability-00
FORMULA_NAME ShieldRVt-PT-030A-LTLFireability-01
FORMULA_NAME ShieldRVt-PT-030A-LTLFireability-02
FORMULA_NAME ShieldRVt-PT-030A-LTLFireability-03
FORMULA_NAME ShieldRVt-PT-030A-LTLFireability-04
FORMULA_NAME ShieldRVt-PT-030A-LTLFireability-05
FORMULA_NAME ShieldRVt-PT-030A-LTLFireability-06
FORMULA_NAME ShieldRVt-PT-030A-LTLFireability-07
FORMULA_NAME ShieldRVt-PT-030A-LTLFireability-08
FORMULA_NAME ShieldRVt-PT-030A-LTLFireability-09
FORMULA_NAME ShieldRVt-PT-030A-LTLFireability-10
FORMULA_NAME ShieldRVt-PT-030A-LTLFireability-11
FORMULA_NAME ShieldRVt-PT-030A-LTLFireability-12
FORMULA_NAME ShieldRVt-PT-030A-LTLFireability-13
FORMULA_NAME ShieldRVt-PT-030A-LTLFireability-14
FORMULA_NAME ShieldRVt-PT-030A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653077543661

Running Version 202205111006
[2022-05-20 20:12:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 20:12:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 20:12:25] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2022-05-20 20:12:25] [INFO ] Transformed 243 places.
[2022-05-20 20:12:25] [INFO ] Transformed 243 transitions.
[2022-05-20 20:12:25] [INFO ] Found NUPN structural information;
[2022-05-20 20:12:25] [INFO ] Parsed PT model containing 243 places and 243 transitions in 200 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldRVt-PT-030A-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030A-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 62 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 24 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 243 cols
[2022-05-20 20:12:25] [INFO ] Computed 121 place invariants in 20 ms
[2022-05-20 20:12:25] [INFO ] Implicit Places using invariants in 244 ms returned []
// Phase 1: matrix 242 rows 243 cols
[2022-05-20 20:12:25] [INFO ] Computed 121 place invariants in 11 ms
[2022-05-20 20:12:25] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
// Phase 1: matrix 242 rows 243 cols
[2022-05-20 20:12:25] [INFO ] Computed 121 place invariants in 6 ms
[2022-05-20 20:12:25] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 243/243 places, 242/242 transitions.
Support contains 62 out of 243 places after structural reductions.
[2022-05-20 20:12:26] [INFO ] Flatten gal took : 57 ms
[2022-05-20 20:12:26] [INFO ] Flatten gal took : 27 ms
[2022-05-20 20:12:26] [INFO ] Input system was already deterministic with 242 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 567 ms. (steps per millisecond=17 ) properties (out of 35) seen :14
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 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 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 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 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 7 ms. (steps per millisecond=143 ) 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 7 ms. (steps per millisecond=143 ) 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 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 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 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 6 ms. (steps per millisecond=166 ) 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
Running SMT prover for 21 properties.
// Phase 1: matrix 242 rows 243 cols
[2022-05-20 20:12:26] [INFO ] Computed 121 place invariants in 2 ms
[2022-05-20 20:12:27] [INFO ] [Real]Absence check using 121 positive place invariants in 22 ms returned sat
[2022-05-20 20:12:27] [INFO ] After 471ms SMT Verify possible using state equation in real domain returned unsat :2 sat :1 real:18
[2022-05-20 20:12:27] [INFO ] After 511ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :0 real:19
[2022-05-20 20:12:27] [INFO ] After 783ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:19
[2022-05-20 20:12:28] [INFO ] [Nat]Absence check using 121 positive place invariants in 32 ms returned sat
[2022-05-20 20:12:28] [INFO ] After 417ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :19
[2022-05-20 20:12:29] [INFO ] After 912ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :19
Attempting to minimize the solution found.
Minimization took 342 ms.
[2022-05-20 20:12:29] [INFO ] After 1737ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :19
Fused 21 Parikh solutions to 19 different solutions.
Parikh walk visited 0 properties in 368 ms.
Support contains 29 out of 243 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 243/243 places, 242/242 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 242 transition count 241
Partial Free-agglomeration rule applied 25 times.
Drop transitions removed 25 transitions
Iterating global reduction 0 with 25 rules applied. Total rules applied 27 place count 242 transition count 241
Drop transitions removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 0 with 25 rules applied. Total rules applied 52 place count 242 transition count 216
Applied a total of 52 rules in 78 ms. Remains 242 /243 variables (removed 1) and now considering 216/242 (removed 26) transitions.
Finished structural reductions, in 1 iterations. Remains : 242/243 places, 216/242 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 346 ms. (steps per millisecond=28 ) properties (out of 19) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 9) 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 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 216 rows 242 cols
[2022-05-20 20:12:30] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 20:12:30] [INFO ] [Real]Absence check using 121 positive place invariants in 15 ms returned sat
[2022-05-20 20:12:30] [INFO ] After 327ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-05-20 20:12:31] [INFO ] [Nat]Absence check using 121 positive place invariants in 15 ms returned sat
[2022-05-20 20:12:31] [INFO ] After 165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2022-05-20 20:12:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 20:12:31] [INFO ] After 115ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2022-05-20 20:12:31] [INFO ] After 317ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 140 ms.
[2022-05-20 20:12:31] [INFO ] After 750ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 136 ms.
Support contains 13 out of 242 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 242/242 places, 216/216 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 242 transition count 216
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 242 transition count 214
Applied a total of 4 rules in 25 ms. Remains 242 /242 variables (removed 0) and now considering 214/216 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 242/242 places, 214/216 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Finished probabilistic random walk after 362309 steps, run visited all 9 properties in 1559 ms. (steps per millisecond=232 )
Probabilistic random walk after 362309 steps, saw 346919 distinct states, run finished after 1560 ms. (steps per millisecond=232 ) properties seen :9
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(!(F(p0) U p1)))))'
Support contains 2 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 242/242 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 240 transition count 240
Applied a total of 3 rules in 20 ms. Remains 240 /243 variables (removed 3) and now considering 240/242 (removed 2) transitions.
// Phase 1: matrix 240 rows 240 cols
[2022-05-20 20:12:34] [INFO ] Computed 120 place invariants in 1 ms
[2022-05-20 20:12:34] [INFO ] Implicit Places using invariants in 121 ms returned []
// Phase 1: matrix 240 rows 240 cols
[2022-05-20 20:12:34] [INFO ] Computed 120 place invariants in 3 ms
[2022-05-20 20:12:34] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
[2022-05-20 20:12:34] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 240 rows 240 cols
[2022-05-20 20:12:34] [INFO ] Computed 120 place invariants in 6 ms
[2022-05-20 20:12:34] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 240/243 places, 240/242 transitions.
Finished structural reductions, in 1 iterations. Remains : 240/243 places, 240/242 transitions.
Stuttering acceptance computed with spot in 229 ms :[p1, p1, (AND p0 p1)]
Running random walk in product with property : ShieldRVt-PT-030A-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s108 1), p1:(EQ s16 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 466 ms.
Product exploration explored 100000 steps with 0 reset in 410 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 (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 350 ms. Reduced automaton from 3 states, 9 edges and 2 AP to 3 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 126 ms :[p1, p1, (AND p0 p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 288 ms. (steps per millisecond=34 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) 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 6) seen :0
Finished probabilistic random walk after 7290 steps, run visited all 6 properties in 78 ms. (steps per millisecond=93 )
Probabilistic random walk after 7290 steps, saw 7085 distinct states, run finished after 78 ms. (steps per millisecond=93 ) properties seen :6
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND p0 p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1)), (F (OR p0 p1)), (F p1), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 9 factoid took 420 ms. Reduced automaton from 3 states, 9 edges and 2 AP to 3 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 179 ms :[p1, p1, (AND p0 p1)]
Stuttering acceptance computed with spot in 118 ms :[p1, p1, (AND p0 p1)]
Support contains 2 out of 240 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 240/240 places, 240/240 transitions.
Applied a total of 0 rules in 13 ms. Remains 240 /240 variables (removed 0) and now considering 240/240 (removed 0) transitions.
// Phase 1: matrix 240 rows 240 cols
[2022-05-20 20:12:37] [INFO ] Computed 120 place invariants in 3 ms
[2022-05-20 20:12:38] [INFO ] Implicit Places using invariants in 119 ms returned []
// Phase 1: matrix 240 rows 240 cols
[2022-05-20 20:12:38] [INFO ] Computed 120 place invariants in 1 ms
[2022-05-20 20:12:38] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
[2022-05-20 20:12:38] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 240 rows 240 cols
[2022-05-20 20:12:38] [INFO ] Computed 120 place invariants in 1 ms
[2022-05-20 20:12:38] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 240/240 places, 240/240 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 (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 367 ms. Reduced automaton from 3 states, 9 edges and 2 AP to 3 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 89 ms :[p1, p1, (AND p0 p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Finished probabilistic random walk after 7290 steps, run visited all 6 properties in 71 ms. (steps per millisecond=102 )
Probabilistic random walk after 7290 steps, saw 7085 distinct states, run finished after 71 ms. (steps per millisecond=102 ) properties seen :6
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND p0 p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1)), (F (OR p0 p1)), (F p1), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 9 factoid took 461 ms. Reduced automaton from 3 states, 9 edges and 2 AP to 3 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 118 ms :[p1, p1, (AND p0 p1)]
Stuttering acceptance computed with spot in 106 ms :[p1, p1, (AND p0 p1)]
Stuttering acceptance computed with spot in 115 ms :[p1, p1, (AND p0 p1)]
Product exploration explored 100000 steps with 0 reset in 327 ms.
Product exploration explored 100000 steps with 0 reset in 348 ms.
Built C files in :
/tmp/ltsmin10991118180963913851
[2022-05-20 20:12:40] [INFO ] Computing symmetric may disable matrix : 240 transitions.
[2022-05-20 20:12:40] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 20:12:40] [INFO ] Computing symmetric may enable matrix : 240 transitions.
[2022-05-20 20:12:40] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 20:12:41] [INFO ] Computing Do-Not-Accords matrix : 240 transitions.
[2022-05-20 20:12:41] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 20:12:41] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10991118180963913851
Running compilation step : cd /tmp/ltsmin10991118180963913851;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 535 ms.
Running link step : cd /tmp/ltsmin10991118180963913851;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin10991118180963913851;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12967142410157615221.hoa' '--buchi-type=spotba'
LTSmin run took 321 ms.
FORMULA ShieldRVt-PT-030A-LTLFireability-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVt-PT-030A-LTLFireability-01 finished in 7544 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&X(X(F(F((p1 U p2))))))))'
Support contains 6 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 242/242 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 242 transition count 241
Applied a total of 2 rules in 15 ms. Remains 242 /243 variables (removed 1) and now considering 241/242 (removed 1) transitions.
// Phase 1: matrix 241 rows 242 cols
[2022-05-20 20:12:41] [INFO ] Computed 121 place invariants in 2 ms
[2022-05-20 20:12:42] [INFO ] Implicit Places using invariants in 115 ms returned [235]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 117 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 241/243 places, 241/242 transitions.
Applied a total of 0 rules in 8 ms. Remains 241 /241 variables (removed 0) and now considering 241/241 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 241/243 places, 241/242 transitions.
Stuttering acceptance computed with spot in 86 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Running random walk in product with property : ShieldRVt-PT-030A-LTLFireability-02 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=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s6 0) (EQ s9 0) (EQ s161 0)), p2:(AND (EQ s108 1) (EQ s109 1) (EQ s112 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 1 reset in 341 ms.
Stack based approach found an accepted trace after 33 steps with 0 reset with depth 34 and stack size 34 in 0 ms.
FORMULA ShieldRVt-PT-030A-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-030A-LTLFireability-02 finished in 586 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0) U (F(p2)||p1)))))'
Support contains 10 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 2 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 243 cols
[2022-05-20 20:12:42] [INFO ] Computed 121 place invariants in 4 ms
[2022-05-20 20:12:42] [INFO ] Implicit Places using invariants in 108 ms returned []
// Phase 1: matrix 242 rows 243 cols
[2022-05-20 20:12:42] [INFO ] Computed 121 place invariants in 2 ms
[2022-05-20 20:12:42] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
// Phase 1: matrix 242 rows 243 cols
[2022-05-20 20:12:42] [INFO ] Computed 121 place invariants in 2 ms
[2022-05-20 20:12:42] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 243/243 places, 242/242 transitions.
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-030A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (AND (EQ s115 1) (EQ s124 1) (EQ s130 1)) (AND (EQ s172 1) (EQ s173 1) (EQ s176 1))), p2:(AND (EQ s148 1) (EQ s149 1) (EQ s152 1)), p0:(EQ s35 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 14 reset in 332 ms.
Stack based approach found an accepted trace after 33 steps with 0 reset with depth 34 and stack size 34 in 2 ms.
FORMULA ShieldRVt-PT-030A-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-030A-LTLFireability-03 finished in 976 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(((p0 U p1) U (G(p2)||X(p3))))))'
Support contains 10 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 4 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 243 cols
[2022-05-20 20:12:43] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 20:12:43] [INFO ] Implicit Places using invariants in 103 ms returned []
// Phase 1: matrix 242 rows 243 cols
[2022-05-20 20:12:43] [INFO ] Computed 121 place invariants in 3 ms
[2022-05-20 20:12:43] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
// Phase 1: matrix 242 rows 243 cols
[2022-05-20 20:12:43] [INFO ] Computed 121 place invariants in 2 ms
[2022-05-20 20:12:43] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 243/243 places, 242/242 transitions.
Stuttering acceptance computed with spot in 396 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVt-PT-030A-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={} source=1 dest: 4}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 5}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=1 dest: 6}], [{ cond=(NOT p3), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=3 dest: 7}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0 (NOT p3)), acceptance={} source=4 dest: 3}, { cond=(OR (AND p2 p1 (NOT p3)) (AND p2 p0 (NOT p3))), acceptance={} source=4 dest: 4}, { cond=(OR (AND (NOT p2) p1 (NOT p3)) (AND (NOT p2) p0 (NOT p3))), acceptance={0} source=4 dest: 4}, { cond=(AND p2 (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=4 dest: 5}, { cond=(AND p2 (NOT p1) p0 (NOT p3)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=5 dest: 7}, { cond=(AND p2 (NOT p3)), acceptance={} source=5 dest: 9}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p2) (NOT p1) p0 (NOT p3)), acceptance={} source=6 dest: 8}, { cond=(AND p2 (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=6 dest: 9}, { cond=(AND p2 (NOT p1) p0 (NOT p3)), acceptance={} source=6 dest: 10}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p1) p0), acceptance={0} source=8 dest: 8}], [{ cond=(NOT p2), acceptance={} source=9 dest: 7}, { cond=p2, acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=10 dest: 7}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=10 dest: 8}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=10 dest: 9}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=10 dest: 10}]], initial=0, aps=[p2:(AND (EQ s102 1) (EQ s105 1)), p1:(OR (AND (EQ s35 1) (EQ s44 1) (EQ s50 1)) (AND (EQ s184 1) (EQ s186 1) (EQ s191 1))), p0:(AND (EQ s166 1) (EQ s169 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-030A-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030A-LTLFireability-04 finished in 853 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(F((X(p0)&&p0))))))'
Support contains 1 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 2 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 243 cols
[2022-05-20 20:12:44] [INFO ] Computed 121 place invariants in 0 ms
[2022-05-20 20:12:44] [INFO ] Implicit Places using invariants in 105 ms returned []
// Phase 1: matrix 242 rows 243 cols
[2022-05-20 20:12:44] [INFO ] Computed 121 place invariants in 0 ms
[2022-05-20 20:12:44] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
// Phase 1: matrix 242 rows 243 cols
[2022-05-20 20:12:44] [INFO ] Computed 121 place invariants in 0 ms
[2022-05-20 20:12:44] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 243/243 places, 242/242 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030A-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}]], initial=0, aps=[p0:(EQ s65 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 312 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 1 ms.
FORMULA ShieldRVt-PT-030A-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-030A-LTLFireability-05 finished in 856 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(G((G(p0)||X(p1)||p0))))))'
Support contains 3 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 2 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 243 cols
[2022-05-20 20:12:45] [INFO ] Computed 121 place invariants in 2 ms
[2022-05-20 20:12:45] [INFO ] Implicit Places using invariants in 115 ms returned []
// Phase 1: matrix 242 rows 243 cols
[2022-05-20 20:12:45] [INFO ] Computed 121 place invariants in 2 ms
[2022-05-20 20:12:45] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
// Phase 1: matrix 242 rows 243 cols
[2022-05-20 20:12:45] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 20:12:45] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 243/243 places, 242/242 transitions.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-030A-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(AND (EQ s6 1) (EQ s9 1)), p1:(EQ s211 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 346 ms.
Stack based approach found an accepted trace after 62 steps with 0 reset with depth 63 and stack size 63 in 1 ms.
FORMULA ShieldRVt-PT-030A-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-030A-LTLFireability-06 finished in 883 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 242/242 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 242 transition count 241
Applied a total of 2 rules in 14 ms. Remains 242 /243 variables (removed 1) and now considering 241/242 (removed 1) transitions.
// Phase 1: matrix 241 rows 242 cols
[2022-05-20 20:12:46] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 20:12:46] [INFO ] Implicit Places using invariants in 106 ms returned [235]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 107 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 241/243 places, 241/242 transitions.
Applied a total of 0 rules in 6 ms. Remains 241 /241 variables (removed 0) and now considering 241/241 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 241/243 places, 241/242 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030A-LTLFireability-07 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 s120 1) (EQ s122 1) (EQ s127 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 322 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 0 ms.
FORMULA ShieldRVt-PT-030A-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-030A-LTLFireability-07 finished in 496 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!F(X(X(p0))) U (F(!p2)&&X(p3)&&p1)))'
Support contains 7 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 5 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 243 cols
[2022-05-20 20:12:46] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 20:12:46] [INFO ] Implicit Places using invariants in 107 ms returned []
// Phase 1: matrix 242 rows 243 cols
[2022-05-20 20:12:46] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 20:12:46] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
// Phase 1: matrix 242 rows 243 cols
[2022-05-20 20:12:46] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 20:12:47] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 243/243 places, 242/242 transitions.
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p1) (NOT p3) p2), p0, (NOT p3), p2, p0, true]
Running random walk in product with property : ShieldRVt-PT-030A-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 1}, { cond=p1, acceptance={0} source=0 dest: 2}, { cond=(AND p1 p2), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=2 dest: 0}, { cond=(AND p1 (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p2 (NOT p3)), acceptance={0} source=2 dest: 3}, { cond=(NOT p3), acceptance={0} source=2 dest: 4}], [{ cond=p2, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s139 1) (EQ s148 1) (EQ s154 1)), p2:(EQ s17 1), p3:(AND (EQ s139 1) (EQ s148 1) (EQ s154 1)), p0:(AND (EQ s24 1) (EQ s26 1) (EQ s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 316 ms.
Product exploration explored 100000 steps with 0 reset in 408 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 p2) (NOT p3) (NOT p0)), (X (NOT p2)), (X (NOT p1)), (X (NOT (AND p1 p2 (NOT p3)))), (X (AND (NOT p1) (NOT p3))), (X (NOT p3)), (X (NOT (AND p1 p2))), (X (NOT (AND p1 (NOT p3)))), (X (X (NOT p2))), true, (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT p3))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 712 ms. Reduced automaton from 6 states, 13 edges and 4 AP to 6 states, 13 edges and 4 AP.
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p1) (NOT p3) p2), p0, (NOT p3), p2, p0, true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 346123 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :{0=1, 1=1, 2=1, 5=1, 6=1, 7=1}
Probabilistic random walk after 346123 steps, saw 334685 distinct states, run finished after 3002 ms. (steps per millisecond=115 ) properties seen :6
Running SMT prover for 2 properties.
// Phase 1: matrix 242 rows 243 cols
[2022-05-20 20:12:52] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 20:12:52] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), (X (NOT p2)), (X (NOT p1)), (X (NOT (AND p1 p2 (NOT p3)))), (X (AND (NOT p1) (NOT p3))), (X (NOT p3)), (X (NOT (AND p1 p2))), (X (NOT (AND p1 (NOT p3)))), (X (X (NOT p2))), true, (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT p3))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p3))))), (G (NOT (AND p2 p1 (NOT p3)))), (G (NOT (AND p1 (NOT p3))))]
False Knowledge obtained : [(F p2), (F p3), (F p1), (F (NOT (AND (NOT p1) (NOT p3)))), (F (AND p2 p1)), (F p0)]
Knowledge based reduction with 19 factoid took 1008 ms. Reduced automaton from 6 states, 13 edges and 4 AP to 6 states, 11 edges and 4 AP.
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p1) (NOT p3) p2), p0, (NOT p3), p2, p0, true]
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p1) (NOT p3) p2), p0, (NOT p3), p2, p0, true]
// Phase 1: matrix 242 rows 243 cols
[2022-05-20 20:12:53] [INFO ] Computed 121 place invariants in 2 ms
Proved EG (NOT p1)
// Phase 1: matrix 242 rows 243 cols
[2022-05-20 20:12:53] [INFO ] Computed 121 place invariants in 1 ms
Proved EG (NOT p3)
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), (X (NOT p2)), (X (NOT p1)), (X (NOT (AND p1 p2 (NOT p3)))), (X (AND (NOT p1) (NOT p3))), (X (NOT p3)), (X (NOT (AND p1 p2))), (X (NOT (AND p1 (NOT p3)))), (X (X (NOT p2))), true, (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT p3))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p3))))), (G (NOT (AND p2 p1 (NOT p3)))), (G (NOT (AND p1 (NOT p3))))]
False Knowledge obtained : [(F p2), (F p3), (F p1), (F (NOT (AND (NOT p1) (NOT p3)))), (F (AND p2 p1)), (F p0), (G (NOT p1)), (G (NOT p3))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 19 factoid took 379 ms. Reduced automaton from 6 states, 11 edges and 4 AP to 1 states, 1 edges and 0 AP.
FORMULA ShieldRVt-PT-030A-LTLFireability-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-030A-LTLFireability-08 finished in 7844 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(p0 U X(X(p1))))'
Support contains 6 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 4 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 243 cols
[2022-05-20 20:12:54] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 20:12:54] [INFO ] Implicit Places using invariants in 108 ms returned []
// Phase 1: matrix 242 rows 243 cols
[2022-05-20 20:12:54] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 20:12:54] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
// Phase 1: matrix 242 rows 243 cols
[2022-05-20 20:12:54] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 20:12:54] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 243/243 places, 242/242 transitions.
Stuttering acceptance computed with spot in 101 ms :[p1, p1, p1, true]
Running random walk in product with property : ShieldRVt-PT-030A-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s44 1) (EQ s45 1) (EQ s48 1) (EQ s14 1) (EQ s17 1)), p1:(EQ s27 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 480 ms.
Product exploration explored 100000 steps with 33333 reset in 510 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 p0)), true, (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT p1)))
Knowledge based reduction with 5 factoid took 126 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldRVt-PT-030A-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-030A-LTLFireability-09 finished in 1658 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(p0))))'
Support contains 1 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 2 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 243 cols
[2022-05-20 20:12:56] [INFO ] Computed 121 place invariants in 2 ms
[2022-05-20 20:12:56] [INFO ] Implicit Places using invariants in 104 ms returned []
// Phase 1: matrix 242 rows 243 cols
[2022-05-20 20:12:56] [INFO ] Computed 121 place invariants in 3 ms
[2022-05-20 20:12:56] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
// Phase 1: matrix 242 rows 243 cols
[2022-05-20 20:12:56] [INFO ] Computed 121 place invariants in 2 ms
[2022-05-20 20:12:56] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 243/243 places, 242/242 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030A-LTLFireability-10 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: 1}]], initial=2, aps=[p0:(EQ s101 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 33333 reset in 566 ms.
Product exploration explored 100000 steps with 33333 reset in 493 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 50 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldRVt-PT-030A-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-030A-LTLFireability-10 finished in 1621 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((G(X(p0))&&p1))))'
Support contains 4 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 6 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 243 cols
[2022-05-20 20:12:57] [INFO ] Computed 121 place invariants in 0 ms
[2022-05-20 20:12:57] [INFO ] Implicit Places using invariants in 124 ms returned []
// Phase 1: matrix 242 rows 243 cols
[2022-05-20 20:12:57] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 20:12:58] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
// Phase 1: matrix 242 rows 243 cols
[2022-05-20 20:12:58] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 20:12:58] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 243/243 places, 242/242 transitions.
Stuttering acceptance computed with spot in 348 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-030A-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(EQ s81 1), p0:(OR (EQ s48 0) (EQ s50 0) (EQ s55 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-030A-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030A-LTLFireability-11 finished in 796 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(X(p0))||G(X(p1)))))'
Support contains 5 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 4 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 243 cols
[2022-05-20 20:12:58] [INFO ] Computed 121 place invariants in 2 ms
[2022-05-20 20:12:58] [INFO ] Implicit Places using invariants in 107 ms returned []
// Phase 1: matrix 242 rows 243 cols
[2022-05-20 20:12:58] [INFO ] Computed 121 place invariants in 0 ms
[2022-05-20 20:12:58] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
// Phase 1: matrix 242 rows 243 cols
[2022-05-20 20:12:58] [INFO ] Computed 121 place invariants in 0 ms
[2022-05-20 20:12:58] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 243/243 places, 242/242 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-030A-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s126 1) (EQ s129 1)), p1:(AND (EQ s43 1) (EQ s52 1) (EQ s58 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 4 reset in 293 ms.
Stack based approach found an accepted trace after 15 steps with 0 reset with depth 16 and stack size 16 in 0 ms.
FORMULA ShieldRVt-PT-030A-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-030A-LTLFireability-13 finished in 851 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(!(X(p0) U G((p0 U (F(p2)&&p1)))))))'
Support contains 6 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 4 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 243 cols
[2022-05-20 20:12:59] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 20:12:59] [INFO ] Implicit Places using invariants in 112 ms returned []
// Phase 1: matrix 242 rows 243 cols
[2022-05-20 20:12:59] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 20:12:59] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
// Phase 1: matrix 242 rows 243 cols
[2022-05-20 20:12:59] [INFO ] Computed 121 place invariants in 2 ms
[2022-05-20 20:12:59] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 243/243 places, 242/242 transitions.
Stuttering acceptance computed with spot in 234 ms :[(AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p1 p2), (AND p0 p1 p2), (AND p1 p2)]
Running random walk in product with property : ShieldRVt-PT-030A-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR p0 (AND p1 p2)), acceptance={} source=2 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p2), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={1} source=3 dest: 5}], [{ cond=p0, acceptance={} source=4 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 (NOT p1) p2), acceptance={0} source=5 dest: 3}, { cond=(AND p1 p2), acceptance={0, 1} source=5 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={1} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s168 1) (EQ s170 1) (EQ s175 1)), p1:(AND (EQ s123 1) (EQ s132 1) (EQ s138 1)), p2:(AND (EQ s123 1) (EQ s132 1) (EQ s138 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 429 ms.
Product exploration explored 100000 steps with 25000 reset in 505 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) (NOT p2)), (X (X (NOT (OR p0 (AND p1 p2))))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 191 ms. Reduced automaton from 6 states, 14 edges and 3 AP to 6 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 227 ms :[false, false, false, (AND p1 p2), (AND p1 p0 p2), (AND p1 p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 242 rows 243 cols
[2022-05-20 20:13:01] [INFO ] Computed 121 place invariants in 0 ms
[2022-05-20 20:13:01] [INFO ] [Real]Absence check using 121 positive place invariants in 15 ms returned sat
[2022-05-20 20:13:02] [INFO ] After 184ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:2
[2022-05-20 20:13:02] [INFO ] [Nat]Absence check using 121 positive place invariants in 14 ms returned sat
[2022-05-20 20:13:02] [INFO ] After 122ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2022-05-20 20:13:02] [INFO ] After 187ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 29 ms.
[2022-05-20 20:13:02] [INFO ] After 294ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 60 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=20 )
Parikh walk visited 2 properties in 2 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (X (NOT (OR p0 (AND p1 p2))))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (G (NOT (AND p1 (NOT p2)))), (G (NOT (AND p0 (NOT p1) p2)))]
False Knowledge obtained : [(F p0), (F (AND p0 (NOT p1) (NOT p2))), (F p1), (F (AND p1 p2)), (F (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))]
Knowledge based reduction with 6 factoid took 390 ms. Reduced automaton from 6 states, 11 edges and 3 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 184 ms :[false, false, false, p1, (AND p1 p0)]
Stuttering acceptance computed with spot in 177 ms :[false, false, false, p1, (AND p1 p0)]
Support contains 6 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 4 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 243 cols
[2022-05-20 20:13:03] [INFO ] Computed 121 place invariants in 2 ms
[2022-05-20 20:13:03] [INFO ] Implicit Places using invariants in 108 ms returned []
// Phase 1: matrix 242 rows 243 cols
[2022-05-20 20:13:03] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 20:13:03] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
// Phase 1: matrix 242 rows 243 cols
[2022-05-20 20:13:03] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 20:13:03] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 243/243 places, 242/242 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 p1) (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 161 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), p1, (AND p0 p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 242 rows 243 cols
[2022-05-20 20:13:03] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 20:13:03] [INFO ] [Real]Absence check using 121 positive place invariants in 13 ms returned sat
[2022-05-20 20:13:04] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 20:13:04] [INFO ] [Nat]Absence check using 121 positive place invariants in 14 ms returned sat
[2022-05-20 20:13:04] [INFO ] After 97ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 20:13:04] [INFO ] After 130ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2022-05-20 20:13:04] [INFO ] After 220ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 243 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 243/243 places, 242/242 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 242 transition count 241
Partial Free-agglomeration rule applied 30 times.
Drop transitions removed 30 transitions
Iterating global reduction 0 with 30 rules applied. Total rules applied 32 place count 242 transition count 241
Drop transitions removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 0 with 30 rules applied. Total rules applied 62 place count 242 transition count 211
Applied a total of 62 rules in 21 ms. Remains 242 /243 variables (removed 1) and now considering 211/242 (removed 31) transitions.
Finished structural reductions, in 1 iterations. Remains : 242/243 places, 211/242 transitions.
Finished random walk after 245 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=245 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F p0), (F p1)]
Knowledge based reduction with 2 factoid took 140 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 147 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), p1, (AND p0 p1)]
Stuttering acceptance computed with spot in 160 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), p1, (AND p0 p1)]
Stuttering acceptance computed with spot in 169 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), p1, (AND p0 p1)]
Product exploration explored 100000 steps with 25000 reset in 413 ms.
Product exploration explored 100000 steps with 25000 reset in 455 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 153 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), p1, (AND p0 p1)]
Support contains 6 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 243 transition count 242
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 32 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2022-05-20 20:13:06] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 242 rows 243 cols
[2022-05-20 20:13:06] [INFO ] Computed 121 place invariants in 0 ms
[2022-05-20 20:13:06] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 243/243 places, 242/242 transitions.
Finished structural reductions, in 1 iterations. Remains : 243/243 places, 242/242 transitions.
Product exploration explored 100000 steps with 25000 reset in 1269 ms.
Product exploration explored 100000 steps with 25000 reset in 1265 ms.
Built C files in :
/tmp/ltsmin5106593765712564380
[2022-05-20 20:13:08] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5106593765712564380
Running compilation step : cd /tmp/ltsmin5106593765712564380;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 381 ms.
Running link step : cd /tmp/ltsmin5106593765712564380;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin5106593765712564380;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11873238408519588156.hoa' '--buchi-type=spotba'
LTSmin run took 321 ms.
FORMULA ShieldRVt-PT-030A-LTLFireability-14 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVt-PT-030A-LTLFireability-14 finished in 10214 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))||((F(p1) U p2)&&X(p2)))))'
Support contains 4 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 6 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 243 cols
[2022-05-20 20:13:09] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 20:13:09] [INFO ] Implicit Places using invariants in 122 ms returned []
// Phase 1: matrix 242 rows 243 cols
[2022-05-20 20:13:09] [INFO ] Computed 121 place invariants in 0 ms
[2022-05-20 20:13:09] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
// Phase 1: matrix 242 rows 243 cols
[2022-05-20 20:13:09] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 20:13:10] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 243/243 places, 242/242 transitions.
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1), true, (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(AND (EQ s155 1) (EQ s164 1) (EQ s170 1)), p1:(EQ s9 1), p0:(EQ s9 0)], 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, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 306 ms.
Product exploration explored 100000 steps with 0 reset in 363 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 p2) (NOT p1) p0), (X (AND (NOT p2) (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) p0))), (X (X (AND (NOT p1) p0)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 231 ms. Reduced automaton from 7 states, 11 edges and 3 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 149 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2743 steps, run visited all 1 properties in 12 ms. (steps per millisecond=228 )
Probabilistic random walk after 2743 steps, saw 2632 distinct states, run finished after 13 ms. (steps per millisecond=211 ) properties seen :1
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (AND (NOT p2) (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) p0))), (X (X (AND (NOT p1) p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 6 factoid took 208 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 243 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 6 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 243 cols
[2022-05-20 20:13:11] [INFO ] Computed 121 place invariants in 2 ms
[2022-05-20 20:13:11] [INFO ] Implicit Places using invariants in 111 ms returned []
// Phase 1: matrix 242 rows 243 cols
[2022-05-20 20:13:11] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 20:13:12] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
// Phase 1: matrix 242 rows 243 cols
[2022-05-20 20:13:12] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 20:13:12] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 243/243 places, 242/242 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 74 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2743 steps, run visited all 1 properties in 14 ms. (steps per millisecond=195 )
Probabilistic random walk after 2743 steps, saw 2632 distinct states, run finished after 14 ms. (steps per millisecond=195 ) properties seen :1
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 105 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 299 ms.
Product exploration explored 100000 steps with 0 reset in 342 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 243 transition count 242
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 25 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2022-05-20 20:13:13] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 242 rows 243 cols
[2022-05-20 20:13:13] [INFO ] Computed 121 place invariants in 0 ms
[2022-05-20 20:13:14] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 243/243 places, 242/242 transitions.
Finished structural reductions, in 1 iterations. Remains : 243/243 places, 242/242 transitions.
Product exploration explored 100000 steps with 0 reset in 286 ms.
Product exploration explored 100000 steps with 0 reset in 348 ms.
Built C files in :
/tmp/ltsmin8148829549934927978
[2022-05-20 20:13:14] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8148829549934927978
Running compilation step : cd /tmp/ltsmin8148829549934927978;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 377 ms.
Running link step : cd /tmp/ltsmin8148829549934927978;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin8148829549934927978;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18433749948921007842.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 4 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 243 cols
[2022-05-20 20:13:29] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 20:13:30] [INFO ] Implicit Places using invariants in 117 ms returned []
// Phase 1: matrix 242 rows 243 cols
[2022-05-20 20:13:30] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 20:13:30] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
// Phase 1: matrix 242 rows 243 cols
[2022-05-20 20:13:30] [INFO ] Computed 121 place invariants in 1 ms
[2022-05-20 20:13:30] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 243/243 places, 242/242 transitions.
Built C files in :
/tmp/ltsmin2608727131321104406
[2022-05-20 20:13:30] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2608727131321104406
Running compilation step : cd /tmp/ltsmin2608727131321104406;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 395 ms.
Running link step : cd /tmp/ltsmin2608727131321104406;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin2608727131321104406;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11041845006815945169.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 20:13:45] [INFO ] Flatten gal took : 18 ms
[2022-05-20 20:13:45] [INFO ] Flatten gal took : 18 ms
[2022-05-20 20:13:45] [INFO ] Time to serialize gal into /tmp/LTL9925004376324370229.gal : 4 ms
[2022-05-20 20:13:45] [INFO ] Time to serialize properties into /tmp/LTL7594332781666840642.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9925004376324370229.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7594332781666840642.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9925004...266
Read 1 LTL properties
Checking formula 0 : !((X((X(G("(p9==0)")))||(((F("(p9==1)"))U("(((p155==1)&&(p164==1))&&(p170==1))"))&&(X("(((p155==1)&&(p164==1))&&(p170==1))"))))))
Formula 0 simplified : !X(XG"(p9==0)" | ((F"(p9==1)" U "(((p155==1)&&(p164==1))&&(p170==1))") & X"(((p155==1)&&(p164==1))&&(p170==1))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2022-05-20 20:14:00] [INFO ] Flatten gal took : 18 ms
[2022-05-20 20:14:00] [INFO ] Applying decomposition
[2022-05-20 20:14:00] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15265159561353148148.txt' '-o' '/tmp/graph15265159561353148148.bin' '-w' '/tmp/graph15265159561353148148.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15265159561353148148.bin' '-l' '-1' '-v' '-w' '/tmp/graph15265159561353148148.weights' '-q' '0' '-e' '0.001'
[2022-05-20 20:14:00] [INFO ] Decomposing Gal with order
[2022-05-20 20:14:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 20:14:00] [INFO ] Removed a total of 90 redundant transitions.
[2022-05-20 20:14:00] [INFO ] Flatten gal took : 54 ms
[2022-05-20 20:14:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2022-05-20 20:14:00] [INFO ] Time to serialize gal into /tmp/LTL1120822831081515935.gal : 6 ms
[2022-05-20 20:14:00] [INFO ] Time to serialize properties into /tmp/LTL6501051888031753295.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1120822831081515935.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6501051888031753295.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1120822...245
Read 1 LTL properties
Checking formula 0 : !((X((X(G("(i0.u4.p9==0)")))||(((F("(i0.u4.p9==1)"))U("(((i11.i0.u77.p155==1)&&(i11.i1.u81.p164==1))&&(i11.i1.u84.p170==1))"))&&(X("((...228
Formula 0 simplified : !X(XG"(i0.u4.p9==0)" | ((F"(i0.u4.p9==1)" U "(((i11.i0.u77.p155==1)&&(i11.i1.u81.p164==1))&&(i11.i1.u84.p170==1))") & X"(((i11.i0.u7...214
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
7 unique states visited
6 strongly connected components in search stack
8 transitions explored
6 items max in DFS search stack
5 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.090276,20824,1,0,2860,80,1035,4008,71,122,6528
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldRVt-PT-030A-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ShieldRVt-PT-030A-LTLFireability-15 finished in 51362 ms.
All properties solved by simple procedures.
Total runtime 96118 ms.

BK_STOP 1653077641059

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVt-PT-030A"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ShieldRVt-PT-030A, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r222-tall-165286026100996"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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