fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r222-tall-165286026101012
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for ShieldRVt-PT-040A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
510.487 43897.00 67078.00 204.10 FFFFFFFFTTFFFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r222-tall-165286026101012.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-040A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286026101012
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 340K
-rw-r--r-- 1 mcc users 6.3K Apr 30 02:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Apr 30 02:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 30 01:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 30 01:45 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.7K May 9 09:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 109K 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-040A-LTLFireability-00
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-01
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-02
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-03
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-04
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-05
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-06
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-07
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-08
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-09
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-10
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-11
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-12
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-13
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-14
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653079725569

Running Version 202205111006
[2022-05-20 20:48:46] [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:48:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 20:48:46] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2022-05-20 20:48:46] [INFO ] Transformed 323 places.
[2022-05-20 20:48:47] [INFO ] Transformed 323 transitions.
[2022-05-20 20:48:47] [INFO ] Found NUPN structural information;
[2022-05-20 20:48:47] [INFO ] Parsed PT model containing 323 places and 323 transitions in 200 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldRVt-PT-040A-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040A-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040A-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 44 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
// Phase 1: matrix 322 rows 323 cols
[2022-05-20 20:48:47] [INFO ] Computed 161 place invariants in 15 ms
[2022-05-20 20:48:47] [INFO ] Implicit Places using invariants in 298 ms returned []
// Phase 1: matrix 322 rows 323 cols
[2022-05-20 20:48:47] [INFO ] Computed 161 place invariants in 9 ms
[2022-05-20 20:48:47] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 610 ms to find 0 implicit places.
// Phase 1: matrix 322 rows 323 cols
[2022-05-20 20:48:47] [INFO ] Computed 161 place invariants in 5 ms
[2022-05-20 20:48:47] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 323/323 places, 322/322 transitions.
Support contains 45 out of 323 places after structural reductions.
[2022-05-20 20:48:48] [INFO ] Flatten gal took : 71 ms
[2022-05-20 20:48:48] [INFO ] Flatten gal took : 30 ms
[2022-05-20 20:48:48] [INFO ] Input system was already deterministic with 322 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 852 ms. (steps per millisecond=11 ) properties (out of 31) seen :13
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) 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 18) 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 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) 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 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 18) 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 18) 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 18) 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 18) seen :0
Running SMT prover for 18 properties.
// Phase 1: matrix 322 rows 323 cols
[2022-05-20 20:48:49] [INFO ] Computed 161 place invariants in 2 ms
[2022-05-20 20:48:49] [INFO ] [Real]Absence check using 161 positive place invariants in 29 ms returned sat
[2022-05-20 20:48:50] [INFO ] After 903ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2022-05-20 20:48:50] [INFO ] [Nat]Absence check using 161 positive place invariants in 21 ms returned sat
[2022-05-20 20:48:51] [INFO ] After 543ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2022-05-20 20:48:51] [INFO ] After 1236ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :18
Attempting to minimize the solution found.
Minimization took 432 ms.
[2022-05-20 20:48:52] [INFO ] After 1981ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :18
Parikh walk visited 0 properties in 521 ms.
Support contains 29 out of 323 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 323/323 places, 322/322 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 322 transition count 321
Partial Free-agglomeration rule applied 35 times.
Drop transitions removed 35 transitions
Iterating global reduction 0 with 35 rules applied. Total rules applied 37 place count 322 transition count 321
Drop transitions removed 35 transitions
Redundant transition composition rules discarded 35 transitions
Iterating global reduction 0 with 35 rules applied. Total rules applied 72 place count 322 transition count 286
Applied a total of 72 rules in 62 ms. Remains 322 /323 variables (removed 1) and now considering 286/322 (removed 36) transitions.
Finished structural reductions, in 1 iterations. Remains : 322/323 places, 286/322 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 291 ms. (steps per millisecond=34 ) properties (out of 18) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 12) 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 12) 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 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 286 rows 322 cols
[2022-05-20 20:48:53] [INFO ] Computed 161 place invariants in 1 ms
[2022-05-20 20:48:53] [INFO ] [Real]Absence check using 161 positive place invariants in 20 ms returned sat
[2022-05-20 20:48:54] [INFO ] After 539ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2022-05-20 20:48:54] [INFO ] [Nat]Absence check using 161 positive place invariants in 20 ms returned sat
[2022-05-20 20:48:54] [INFO ] After 379ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2022-05-20 20:48:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 20:48:55] [INFO ] After 257ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2022-05-20 20:48:55] [INFO ] After 742ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 219 ms.
[2022-05-20 20:48:55] [INFO ] After 1530ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Parikh walk visited 0 properties in 300 ms.
Support contains 22 out of 322 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 322/322 places, 286/286 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 322 transition count 286
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 322 transition count 285
Applied a total of 2 rules in 39 ms. Remains 322 /322 variables (removed 0) and now considering 285/286 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 322/322 places, 285/286 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 316 ms. (steps per millisecond=31 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 11) 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 11) 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 11) 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 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 11) seen :0
Finished probabilistic random walk after 5111 steps, run visited all 11 properties in 96 ms. (steps per millisecond=53 )
Probabilistic random walk after 5111 steps, saw 4985 distinct states, run finished after 96 ms. (steps per millisecond=53 ) properties seen :11
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' '!((!(X(p0)||p1) U (G((p2 U G(X(!p2))))&&p3)))'
Support contains 7 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 3 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
// Phase 1: matrix 322 rows 323 cols
[2022-05-20 20:48:57] [INFO ] Computed 161 place invariants in 5 ms
[2022-05-20 20:48:57] [INFO ] Implicit Places using invariants in 159 ms returned []
// Phase 1: matrix 322 rows 323 cols
[2022-05-20 20:48:57] [INFO ] Computed 161 place invariants in 2 ms
[2022-05-20 20:48:57] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
// Phase 1: matrix 322 rows 323 cols
[2022-05-20 20:48:57] [INFO ] Computed 161 place invariants in 2 ms
[2022-05-20 20:48:57] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 323/323 places, 322/322 transitions.
Stuttering acceptance computed with spot in 453 ms :[(OR (NOT p3) p2), true, (OR (AND p0 (NOT p1)) (AND p0 p3)), p2, p2, p2, p2]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p3 (NOT p2) p1), acceptance={} source=0 dest: 3}, { cond=(AND p3 (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 4}, { cond=(AND p3 p2 (NOT p1)), acceptance={0} source=0 dest: 5}, { cond=(AND p3 p2 p1), acceptance={} source=0 dest: 6}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND p3 p0) (AND (NOT p1) p0)), acceptance={} source=2 dest: 1}], [{ cond=p2, acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p3) p2 (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 0}, { cond=(OR (AND (NOT p3) p2 p1) (AND p2 p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p3) p2 (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 4}, { cond=(AND p3 p2 (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 5}, { cond=(AND p3 p2 p1 (NOT p0)), acceptance={} source=4 dest: 6}], [{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 5}, { cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={} source=6 dest: 3}, { cond=p2, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p3:(EQ s191 1), p1:(AND (EQ s22 1) (EQ s25 1)), p2:(NEQ s233 1), p0:(AND (EQ s96 1) (EQ s98 1) (EQ s103 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33287 reset in 1135 ms.
Stack based approach found an accepted trace after 287 steps with 98 reset with depth 4 and stack size 4 in 5 ms.
FORMULA ShieldRVt-PT-040A-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-040A-LTLFireability-00 finished in 2228 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X(!X(G(X(G(p0))))) U p1)||X(G(p2))))'
Support contains 6 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 6 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
// Phase 1: matrix 322 rows 323 cols
[2022-05-20 20:48:59] [INFO ] Computed 161 place invariants in 4 ms
[2022-05-20 20:48:59] [INFO ] Implicit Places using invariants in 145 ms returned []
// Phase 1: matrix 322 rows 323 cols
[2022-05-20 20:48:59] [INFO ] Computed 161 place invariants in 9 ms
[2022-05-20 20:48:59] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
// Phase 1: matrix 322 rows 323 cols
[2022-05-20 20:49:00] [INFO ] Computed 161 place invariants in 1 ms
[2022-05-20 20:49:00] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 323/323 places, 322/322 transitions.
Stuttering acceptance computed with spot in 299 ms :[p0, (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2)), p0, (OR (NOT p1) p0), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (AND p0 (NOT p2))]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 0}, { cond=(AND p2 p0), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=p1, acceptance={0} source=4 dest: 3}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 5}, { cond=(AND p1 p2), acceptance={} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={} source=6 dest: 0}, { cond=p2, acceptance={} source=6 dest: 2}]], initial=1, aps=[p0:(EQ s309 1), p1:(OR (EQ s83 1) (AND (EQ s96 1) (EQ s98 1) (EQ s103 1))), p2:(EQ s51 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 402 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 13 in 0 ms.
FORMULA ShieldRVt-PT-040A-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-040A-LTLFireability-01 finished in 1313 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(G((p0 U (G(p1)&&X(p2)))))))'
Support contains 4 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 6 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
// Phase 1: matrix 322 rows 323 cols
[2022-05-20 20:49:00] [INFO ] Computed 161 place invariants in 1 ms
[2022-05-20 20:49:01] [INFO ] Implicit Places using invariants in 137 ms returned []
// Phase 1: matrix 322 rows 323 cols
[2022-05-20 20:49:01] [INFO ] Computed 161 place invariants in 1 ms
[2022-05-20 20:49:01] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
// Phase 1: matrix 322 rows 323 cols
[2022-05-20 20:49:01] [INFO ] Computed 161 place invariants in 2 ms
[2022-05-20 20:49:01] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 323/323 places, 322/322 transitions.
Stuttering acceptance computed with spot in 271 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={1} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=0 dest: 3}, { cond=(AND p1 p0), acceptance={1} source=0 dest: 4}, { cond=(AND p1 p0), acceptance={0, 1} source=0 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={1} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=1 dest: 3}, { cond=(AND p1 p0), acceptance={1} source=1 dest: 4}, { cond=(AND p1 p0), acceptance={0, 1} source=1 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={1} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={1} source=2 dest: 4}], [{ cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=3 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p1 p0 (NOT p2)), acceptance={1} source=3 dest: 4}, { cond=(AND p1 p0 (NOT p2)), acceptance={0, 1} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={1} source=4 dest: 2}, { cond=(AND p1 p0), acceptance={1} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=5 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1} source=5 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=5 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0, 1} source=5 dest: 3}, { cond=(AND p1 p0 (NOT p2)), acceptance={1} source=5 dest: 4}, { cond=(AND p1 p0 (NOT p2)), acceptance={0, 1} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s174 1) (EQ s177 1)), p0:(EQ s151 1), p2:(EQ s169 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 0 reset in 467 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 0 ms.
FORMULA ShieldRVt-PT-040A-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-040A-LTLFireability-02 finished in 1335 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!F(X(!G(p0)))) U p1)))'
Support contains 4 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 4 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
// Phase 1: matrix 322 rows 323 cols
[2022-05-20 20:49:02] [INFO ] Computed 161 place invariants in 2 ms
[2022-05-20 20:49:02] [INFO ] Implicit Places using invariants in 134 ms returned []
// Phase 1: matrix 322 rows 323 cols
[2022-05-20 20:49:02] [INFO ] Computed 161 place invariants in 3 ms
[2022-05-20 20:49:02] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
// Phase 1: matrix 322 rows 323 cols
[2022-05-20 20:49:02] [INFO ] Computed 161 place invariants in 3 ms
[2022-05-20 20:49:02] [INFO ] Dead Transitions using invariants and state equation in 163 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 323/323 places, 322/322 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p1), true, (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND p1 p0), acceptance={0} source=4 dest: 0}, { cond=(NOT p0), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(NEQ s69 1), p1:(AND (EQ s163 1) (EQ s172 1) (EQ s178 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 410 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 0 ms.
FORMULA ShieldRVt-PT-040A-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-040A-LTLFireability-03 finished in 1150 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(!F(p0) U X(p1))||X(G(p2))))'
Support contains 3 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 6 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
// Phase 1: matrix 322 rows 323 cols
[2022-05-20 20:49:03] [INFO ] Computed 161 place invariants in 1 ms
[2022-05-20 20:49:03] [INFO ] Implicit Places using invariants in 146 ms returned []
// Phase 1: matrix 322 rows 323 cols
[2022-05-20 20:49:03] [INFO ] Computed 161 place invariants in 3 ms
[2022-05-20 20:49:03] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
// Phase 1: matrix 322 rows 323 cols
[2022-05-20 20:49:03] [INFO ] Computed 161 place invariants in 1 ms
[2022-05-20 20:49:03] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 323/323 places, 322/322 transitions.
Stuttering acceptance computed with spot in 290 ms :[true, (NOT p0), (AND p1 (NOT p2)), (AND (NOT p2) p1), (AND p1 (NOT p2)), (AND (NOT p0) p1), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 0}, { cond=(AND p2 p1), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=4 dest: 6}, { cond=(AND p2 p1), acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 7}], [{ cond=(NOT p2), acceptance={} source=8 dest: 0}, { cond=p2, acceptance={} source=8 dest: 8}]], initial=2, aps=[p0:(OR (EQ s277 1) (EQ s49 1)), p2:(EQ s277 1), p1:(NEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-040A-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040A-LTLFireability-05 finished in 906 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(X(p0))||G(p1))))'
Support contains 2 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 7 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
// Phase 1: matrix 322 rows 323 cols
[2022-05-20 20:49:04] [INFO ] Computed 161 place invariants in 2 ms
[2022-05-20 20:49:04] [INFO ] Implicit Places using invariants in 144 ms returned []
// Phase 1: matrix 322 rows 323 cols
[2022-05-20 20:49:04] [INFO ] Computed 161 place invariants in 1 ms
[2022-05-20 20:49:04] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
// Phase 1: matrix 322 rows 323 cols
[2022-05-20 20:49:04] [INFO ] Computed 161 place invariants in 1 ms
[2022-05-20 20:49:04] [INFO ] Dead Transitions using invariants and state equation in 172 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 323/323 places, 322/322 transitions.
Stuttering acceptance computed with spot in 152 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(EQ s315 1), p0:(EQ s119 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-040A-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040A-LTLFireability-07 finished in 756 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(F(p1) U X(X(p2)))))'
Support contains 5 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 5 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
// Phase 1: matrix 322 rows 323 cols
[2022-05-20 20:49:05] [INFO ] Computed 161 place invariants in 1 ms
[2022-05-20 20:49:05] [INFO ] Implicit Places using invariants in 148 ms returned []
// Phase 1: matrix 322 rows 323 cols
[2022-05-20 20:49:05] [INFO ] Computed 161 place invariants in 1 ms
[2022-05-20 20:49:05] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
// Phase 1: matrix 322 rows 323 cols
[2022-05-20 20:49:05] [INFO ] Computed 161 place invariants in 1 ms
[2022-05-20 20:49:05] [INFO ] Dead Transitions using invariants and state equation in 183 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 323/323 places, 322/322 transitions.
Stuttering acceptance computed with spot in 270 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(NOT p2), acceptance={} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(NEQ s293 1), p0:(EQ s99 0), p2:(AND (EQ s240 1) (EQ s242 1) (EQ s247 1))], nbAcceptance=0, 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 50000 reset in 973 ms.
Product exploration explored 100000 steps with 50000 reset in 1039 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p2)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 96 ms. Reduced automaton from 7 states, 10 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldRVt-PT-040A-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-040A-LTLFireability-08 finished in 2989 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X(X(p0)))))'
Support contains 1 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 5 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
// Phase 1: matrix 322 rows 323 cols
[2022-05-20 20:49:08] [INFO ] Computed 161 place invariants in 1 ms
[2022-05-20 20:49:08] [INFO ] Implicit Places using invariants in 139 ms returned []
// Phase 1: matrix 322 rows 323 cols
[2022-05-20 20:49:08] [INFO ] Computed 161 place invariants in 3 ms
[2022-05-20 20:49:08] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
// Phase 1: matrix 322 rows 323 cols
[2022-05-20 20:49:08] [INFO ] Computed 161 place invariants in 4 ms
[2022-05-20 20:49:08] [INFO ] Dead Transitions using invariants and state equation in 172 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 323/323 places, 322/322 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(EQ s175 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 702 ms.
Product exploration explored 100000 steps with 25000 reset in 771 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1105 steps, run visited all 1 properties in 10 ms. (steps per millisecond=110 )
Probabilistic random walk after 1105 steps, saw 1038 distinct states, run finished after 10 ms. (steps per millisecond=110 ) properties seen :1
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 107 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 8 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
// Phase 1: matrix 322 rows 323 cols
[2022-05-20 20:49:10] [INFO ] Computed 161 place invariants in 3 ms
[2022-05-20 20:49:11] [INFO ] Implicit Places using invariants in 138 ms returned []
// Phase 1: matrix 322 rows 323 cols
[2022-05-20 20:49:11] [INFO ] Computed 161 place invariants in 2 ms
[2022-05-20 20:49:11] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
// Phase 1: matrix 322 rows 323 cols
[2022-05-20 20:49:11] [INFO ] Computed 161 place invariants in 1 ms
[2022-05-20 20:49:11] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 323/323 places, 322/322 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 89 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1105 steps, run visited all 1 properties in 8 ms. (steps per millisecond=138 )
Probabilistic random walk after 1105 steps, saw 1038 distinct states, run finished after 8 ms. (steps per millisecond=138 ) properties seen :1
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 688 ms.
Product exploration explored 100000 steps with 25000 reset in 751 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 322/322 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 323 transition count 322
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 45 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
[2022-05-20 20:49:14] [INFO ] Redundant transitions in 16 ms returned []
// Phase 1: matrix 322 rows 323 cols
[2022-05-20 20:49:14] [INFO ] Computed 161 place invariants in 1 ms
[2022-05-20 20:49:14] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 323/323 places, 322/322 transitions.
Finished structural reductions, in 1 iterations. Remains : 323/323 places, 322/322 transitions.
Product exploration explored 100000 steps with 25000 reset in 2068 ms.
Product exploration explored 100000 steps with 25000 reset in 2103 ms.
Built C files in :
/tmp/ltsmin114253047085327207
[2022-05-20 20:49:18] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin114253047085327207
Running compilation step : cd /tmp/ltsmin114253047085327207;'/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 571 ms.
Running link step : cd /tmp/ltsmin114253047085327207;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin114253047085327207;'/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/stateBased11670422381999210553.hoa' '--buchi-type=spotba'
LTSmin run took 237 ms.
FORMULA ShieldRVt-PT-040A-LTLFireability-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVt-PT-040A-LTLFireability-09 finished in 11428 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 16 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
// Phase 1: matrix 322 rows 323 cols
[2022-05-20 20:49:19] [INFO ] Computed 161 place invariants in 2 ms
[2022-05-20 20:49:19] [INFO ] Implicit Places using invariants in 146 ms returned []
// Phase 1: matrix 322 rows 323 cols
[2022-05-20 20:49:19] [INFO ] Computed 161 place invariants in 4 ms
[2022-05-20 20:49:19] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
// Phase 1: matrix 322 rows 323 cols
[2022-05-20 20:49:19] [INFO ] Computed 161 place invariants in 1 ms
[2022-05-20 20:49:20] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 323/323 places, 322/322 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s301 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 2307 reset in 430 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 0 ms.
FORMULA ShieldRVt-PT-040A-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-040A-LTLFireability-10 finished in 1086 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(!(p0 U (p1 U !X(p2)))))))'
Support contains 6 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 8 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
// Phase 1: matrix 322 rows 323 cols
[2022-05-20 20:49:20] [INFO ] Computed 161 place invariants in 1 ms
[2022-05-20 20:49:20] [INFO ] Implicit Places using invariants in 134 ms returned []
// Phase 1: matrix 322 rows 323 cols
[2022-05-20 20:49:20] [INFO ] Computed 161 place invariants in 4 ms
[2022-05-20 20:49:20] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
// Phase 1: matrix 322 rows 323 cols
[2022-05-20 20:49:20] [INFO ] Computed 161 place invariants in 0 ms
[2022-05-20 20:49:21] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 323/323 places, 322/322 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p2), false, (NOT p2), false]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p2), acceptance={} source=1 dest: 1}, { cond=p2, acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=p2, acceptance={0} source=3 dest: 2}, { cond=(OR (AND p0 p1) (AND p1 p2)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s241 1), p2:(AND (EQ s38 1) (EQ s41 1)), p1:(AND (EQ s84 1) (EQ s85 1) (EQ s88 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 45 reset in 427 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-040A-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-040A-LTLFireability-11 finished in 1169 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((X(((X(p1)&&p0) U p2))&&X(p1)) U p3)))'
Support contains 8 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 3 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
// Phase 1: matrix 322 rows 323 cols
[2022-05-20 20:49:21] [INFO ] Computed 161 place invariants in 2 ms
[2022-05-20 20:49:21] [INFO ] Implicit Places using invariants in 134 ms returned []
// Phase 1: matrix 322 rows 323 cols
[2022-05-20 20:49:21] [INFO ] Computed 161 place invariants in 1 ms
[2022-05-20 20:49:22] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
// Phase 1: matrix 322 rows 323 cols
[2022-05-20 20:49:22] [INFO ] Computed 161 place invariants in 0 ms
[2022-05-20 20:49:22] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 323/323 places, 322/322 transitions.
Stuttering acceptance computed with spot in 170 ms :[(NOT p3), (OR (NOT p1) (NOT p2) (NOT p3)), true, (OR (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p3), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p3) p1 p2) (AND (NOT p3) p1 p0)), acceptance={0} source=1 dest: 1}, { cond=(OR (NOT p1) (AND (NOT p2) (NOT p0))), acceptance={0} source=1 dest: 2}, { cond=(AND p3 p1 (NOT p2) p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(OR (NOT p1) (AND (NOT p2) (NOT p0))), acceptance={0} source=3 dest: 2}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p3:(OR (EQ s293 1) (AND (EQ s11 1) (EQ s20 1) (EQ s26 1))), p1:(EQ s229 1), p2:(AND (EQ s299 1) (EQ s308 1) (EQ s314 1)), p0:(AND (EQ s11 1) (EQ s20 1) (E...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-040A-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040A-LTLFireability-12 finished in 745 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 322/322 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 320 transition count 320
Applied a total of 3 rules in 21 ms. Remains 320 /323 variables (removed 3) and now considering 320/322 (removed 2) transitions.
// Phase 1: matrix 320 rows 320 cols
[2022-05-20 20:49:22] [INFO ] Computed 160 place invariants in 1 ms
[2022-05-20 20:49:22] [INFO ] Implicit Places using invariants in 131 ms returned []
// Phase 1: matrix 320 rows 320 cols
[2022-05-20 20:49:22] [INFO ] Computed 160 place invariants in 1 ms
[2022-05-20 20:49:22] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
[2022-05-20 20:49:22] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 320 rows 320 cols
[2022-05-20 20:49:22] [INFO ] Computed 160 place invariants in 1 ms
[2022-05-20 20:49:23] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 320/323 places, 320/322 transitions.
Finished structural reductions, in 1 iterations. Remains : 320/323 places, 320/322 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s230 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 391 ms.
Stack based approach found an accepted trace after 16 steps with 0 reset with depth 17 and stack size 17 in 0 ms.
FORMULA ShieldRVt-PT-040A-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-040A-LTLFireability-13 finished in 1010 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 322/322 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 320 transition count 320
Applied a total of 3 rules in 14 ms. Remains 320 /323 variables (removed 3) and now considering 320/322 (removed 2) transitions.
// Phase 1: matrix 320 rows 320 cols
[2022-05-20 20:49:23] [INFO ] Computed 160 place invariants in 0 ms
[2022-05-20 20:49:23] [INFO ] Implicit Places using invariants in 178 ms returned []
// Phase 1: matrix 320 rows 320 cols
[2022-05-20 20:49:23] [INFO ] Computed 160 place invariants in 1 ms
[2022-05-20 20:49:23] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
[2022-05-20 20:49:23] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 320 rows 320 cols
[2022-05-20 20:49:23] [INFO ] Computed 160 place invariants in 2 ms
[2022-05-20 20:49:24] [INFO ] Dead Transitions using invariants and state equation in 172 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 320/323 places, 320/322 transitions.
Finished structural reductions, in 1 iterations. Remains : 320/323 places, 320/322 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s178 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 430 ms.
Product exploration explored 100000 steps with 0 reset in 553 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 195 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1232 steps, run visited all 1 properties in 9 ms. (steps per millisecond=136 )
Probabilistic random walk after 1232 steps, saw 1157 distinct states, run finished after 9 ms. (steps per millisecond=136 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 145 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 320/320 places, 320/320 transitions.
Applied a total of 0 rules in 13 ms. Remains 320 /320 variables (removed 0) and now considering 320/320 (removed 0) transitions.
// Phase 1: matrix 320 rows 320 cols
[2022-05-20 20:49:25] [INFO ] Computed 160 place invariants in 2 ms
[2022-05-20 20:49:26] [INFO ] Implicit Places using invariants in 195 ms returned []
// Phase 1: matrix 320 rows 320 cols
[2022-05-20 20:49:26] [INFO ] Computed 160 place invariants in 1 ms
[2022-05-20 20:49:26] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
[2022-05-20 20:49:26] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 320 rows 320 cols
[2022-05-20 20:49:26] [INFO ] Computed 160 place invariants in 0 ms
[2022-05-20 20:49:26] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 320/320 places, 320/320 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 128 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1232 steps, run visited all 1 properties in 9 ms. (steps per millisecond=136 )
Probabilistic random walk after 1232 steps, saw 1157 distinct states, run finished after 9 ms. (steps per millisecond=136 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 386 ms.
Product exploration explored 100000 steps with 0 reset in 469 ms.
Built C files in :
/tmp/ltsmin4988782825121432279
[2022-05-20 20:49:28] [INFO ] Computing symmetric may disable matrix : 320 transitions.
[2022-05-20 20:49:28] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 20:49:28] [INFO ] Computing symmetric may enable matrix : 320 transitions.
[2022-05-20 20:49:28] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 20:49:28] [INFO ] Computing Do-Not-Accords matrix : 320 transitions.
[2022-05-20 20:49:28] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 20:49:28] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4988782825121432279
Running compilation step : cd /tmp/ltsmin4988782825121432279;'/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 613 ms.
Running link step : cd /tmp/ltsmin4988782825121432279;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin4988782825121432279;'/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/stateBased17500583448423267255.hoa' '--buchi-type=spotba'
LTSmin run took 592 ms.
FORMULA ShieldRVt-PT-040A-LTLFireability-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVt-PT-040A-LTLFireability-15 finished in 5914 ms.
All properties solved by simple procedures.
Total runtime 42598 ms.

BK_STOP 1653079769466

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-040A"
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-040A, 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-165286026101012"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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