Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 7.7K Feb 25 23:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 25 23:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 23:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 23:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Feb 25 23:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 25 23:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 25 23:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 23:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 54K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679306334488

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-020A
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 09:58:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 09:58:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 09:58:56] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2023-03-20 09:58:56] [INFO ] Transformed 163 places.
[2023-03-20 09:58:56] [INFO ] Transformed 163 transitions.
[2023-03-20 09:58:56] [INFO ] Found NUPN structural information;
[2023-03-20 09:58:56] [INFO ] Parsed PT model containing 163 places and 163 transitions and 686 arcs in 139 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldRVt-PT-020A-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-020A-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-020A-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-020A-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 53 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 162/162 transitions.
Applied a total of 0 rules in 19 ms. Remains 163 /163 variables (removed 0) and now considering 162/162 (removed 0) transitions.
// Phase 1: matrix 162 rows 163 cols
[2023-03-20 09:58:56] [INFO ] Computed 81 place invariants in 10 ms
[2023-03-20 09:58:56] [INFO ] Implicit Places using invariants in 238 ms returned []
[2023-03-20 09:58:56] [INFO ] Invariant cache hit.
[2023-03-20 09:58:56] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
[2023-03-20 09:58:56] [INFO ] Invariant cache hit.
[2023-03-20 09:58:57] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 600 ms. Remains : 163/163 places, 162/162 transitions.
Support contains 53 out of 163 places after structural reductions.
[2023-03-20 09:58:57] [INFO ] Flatten gal took : 51 ms
[2023-03-20 09:58:57] [INFO ] Flatten gal took : 22 ms
[2023-03-20 09:58:57] [INFO ] Input system was already deterministic with 162 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 618 ms. (steps per millisecond=16 ) properties (out of 32) seen :15
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) seen :0
Running SMT prover for 17 properties.
[2023-03-20 09:58:58] [INFO ] Invariant cache hit.
[2023-03-20 09:58:58] [INFO ] [Real]Absence check using 81 positive place invariants in 10 ms returned sat
[2023-03-20 09:58:58] [INFO ] After 412ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-20 09:58:58] [INFO ] [Nat]Absence check using 81 positive place invariants in 9 ms returned sat
[2023-03-20 09:58:59] [INFO ] After 194ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-03-20 09:58:59] [INFO ] After 433ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 147 ms.
[2023-03-20 09:58:59] [INFO ] After 742ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Parikh walk visited 7 properties in 238 ms.
Support contains 18 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 162/162 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 162 transition count 161
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 0 with 15 rules applied. Total rules applied 17 place count 162 transition count 161
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 0 with 15 rules applied. Total rules applied 32 place count 162 transition count 146
Applied a total of 32 rules in 66 ms. Remains 162 /163 variables (removed 1) and now considering 146/162 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 162/163 places, 146/162 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 10) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 146 rows 162 cols
[2023-03-20 09:59:00] [INFO ] Computed 81 place invariants in 2 ms
[2023-03-20 09:59:00] [INFO ] [Real]Absence check using 81 positive place invariants in 11 ms returned sat
[2023-03-20 09:59:00] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 09:59:00] [INFO ] [Nat]Absence check using 81 positive place invariants in 20 ms returned sat
[2023-03-20 09:59:00] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 09:59:00] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 09:59:00] [INFO ] After 39ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-20 09:59:00] [INFO ] After 96ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-20 09:59:00] [INFO ] After 292ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 26 ms.
Support contains 7 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 146/146 transitions.
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 162 transition count 146
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 162 transition count 143
Applied a total of 6 rules in 17 ms. Remains 162 /162 variables (removed 0) and now considering 143/146 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 162/162 places, 143/146 transitions.
Finished random walk after 4591 steps, including 1 resets, run visited all 3 properties in 85 ms. (steps per millisecond=54 )
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((p0||(p1 U p2)))&&X(G(p3)))))'
Support contains 6 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 162/162 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 162 transition count 161
Applied a total of 2 rules in 9 ms. Remains 162 /163 variables (removed 1) and now considering 161/162 (removed 1) transitions.
// Phase 1: matrix 161 rows 162 cols
[2023-03-20 09:59:01] [INFO ] Computed 81 place invariants in 2 ms
[2023-03-20 09:59:01] [INFO ] Implicit Places using invariants in 108 ms returned [155]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 111 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 161/163 places, 161/162 transitions.
Applied a total of 0 rules in 5 ms. Remains 161 /161 variables (removed 0) and now considering 161/161 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 125 ms. Remains : 161/163 places, 161/162 transitions.
Stuttering acceptance computed with spot in 590 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2)), (NOT p3), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : ShieldRVt-PT-020A-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=0 dest: 1}, { cond=(OR p0 p2 p1), acceptance={1} source=0 dest: 2}, { cond=(OR p0 p2 p1), acceptance={0, 1} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=1 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=1 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={0, 1} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=2 dest: 1}, { cond=(OR p0 p2 p1), acceptance={1} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1 (NOT p3)), acceptance={0, 1} source=3 dest: 1}, { cond=(OR (AND p0 (NOT p3)) (AND p2 (NOT p3)) (AND p1 (NOT p3))), acceptance={1} source=3 dest: 2}, { cond=p3, acceptance={0} source=3 dest: 3}, { cond=(OR (AND p0 (NOT p3)) (AND p2 (NOT p3)) (AND p1 (NOT p3))), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=4 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), acceptance={0, 1} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1 (NOT p3)), acceptance={0, 1} source=5 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1) (NOT p3)), acceptance={1} source=5 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p3), acceptance={0} source=5 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1) (NOT p3)), acceptance={0, 1} source=5 dest: 3}, { cond=(AND p0 (NOT p2) p1 (NOT p3)), acceptance={1} source=5 dest: 4}, { cond=(AND (NOT p2) p1 p3), acceptance={0} source=5 dest: 5}, { cond=(AND p0 (NOT p2) p1 (NOT p3)), acceptance={0, 1} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s145 1), p2:(EQ s0 1), p1:(AND (EQ s12 1) (EQ s13 1) (EQ s16 1)), p3:(EQ s65 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 593 ms.
Stack based approach found an accepted trace after 67 steps with 0 reset with depth 68 and stack size 68 in 1 ms.
FORMULA ShieldRVt-PT-020A-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-020A-LTLFireability-00 finished in 1383 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0 U (p1||G(!p0)))&&(p2||(F(p4)&&p3)))))'
Support contains 7 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 162/162 transitions.
Applied a total of 0 rules in 2 ms. Remains 163 /163 variables (removed 0) and now considering 162/162 (removed 0) transitions.
// Phase 1: matrix 162 rows 163 cols
[2023-03-20 09:59:02] [INFO ] Computed 81 place invariants in 4 ms
[2023-03-20 09:59:02] [INFO ] Implicit Places using invariants in 123 ms returned []
[2023-03-20 09:59:02] [INFO ] Invariant cache hit.
[2023-03-20 09:59:02] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
[2023-03-20 09:59:02] [INFO ] Invariant cache hit.
[2023-03-20 09:59:03] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 423 ms. Remains : 163/163 places, 162/162 transitions.
Stuttering acceptance computed with spot in 243 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p4)) (AND p0 (NOT p1))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p4)) (AND p0 (NOT p1))), true, (NOT p4), (AND (NOT p1) p0)]
Running random walk in product with property : ShieldRVt-PT-020A-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) p0)), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p2) p3 (NOT p4) p1) (AND (NOT p2) p3 (NOT p4) (NOT p0))), acceptance={} source=1 dest: 3}, { cond=(OR (AND p2 (NOT p1) (NOT p0)) (AND p3 (NOT p1) (NOT p0))), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p4), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s78 1) (EQ s81 1)), p3:(AND (EQ s123 1) (EQ s132 1) (EQ s138 1)), p1:(NEQ s57 1), p0:(AND (EQ s123 1) (EQ s132 1) (EQ s138 1)), p4:(EQ s77 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-020A-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020A-LTLFireability-01 finished in 710 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (G(F(p1))||G(p0))))'
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 162/162 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 162 transition count 161
Applied a total of 2 rules in 8 ms. Remains 162 /163 variables (removed 1) and now considering 161/162 (removed 1) transitions.
// Phase 1: matrix 161 rows 162 cols
[2023-03-20 09:59:03] [INFO ] Computed 81 place invariants in 3 ms
[2023-03-20 09:59:03] [INFO ] Implicit Places using invariants in 94 ms returned [155]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 97 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 161/163 places, 161/162 transitions.
Applied a total of 0 rules in 5 ms. Remains 161 /161 variables (removed 0) and now considering 161/161 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 112 ms. Remains : 161/163 places, 161/162 transitions.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-020A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s5 1), p0:(AND (EQ s158 1) (EQ s160 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 317 ms.
Stack based approach found an accepted trace after 36 steps with 0 reset with depth 37 and stack size 37 in 0 ms.
FORMULA ShieldRVt-PT-020A-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-020A-LTLFireability-03 finished in 538 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(X(p1))))))'
Support contains 5 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 162/162 transitions.
Applied a total of 0 rules in 3 ms. Remains 163 /163 variables (removed 0) and now considering 162/162 (removed 0) transitions.
// Phase 1: matrix 162 rows 163 cols
[2023-03-20 09:59:03] [INFO ] Computed 81 place invariants in 4 ms
[2023-03-20 09:59:03] [INFO ] Implicit Places using invariants in 118 ms returned []
[2023-03-20 09:59:03] [INFO ] Invariant cache hit.
[2023-03-20 09:59:04] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
[2023-03-20 09:59:04] [INFO ] Invariant cache hit.
[2023-03-20 09:59:04] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 419 ms. Remains : 163/163 places, 162/162 transitions.
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-020A-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}]], initial=0, aps=[p0:(AND (EQ s56 1) (EQ s58 1) (EQ s63 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 14 reset in 454 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 1 ms.
FORMULA ShieldRVt-PT-020A-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-020A-LTLFireability-05 finished in 1092 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&X(p1)))))'
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 162/162 transitions.
Applied a total of 0 rules in 2 ms. Remains 163 /163 variables (removed 0) and now considering 162/162 (removed 0) transitions.
[2023-03-20 09:59:04] [INFO ] Invariant cache hit.
[2023-03-20 09:59:05] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-20 09:59:05] [INFO ] Invariant cache hit.
[2023-03-20 09:59:05] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
[2023-03-20 09:59:05] [INFO ] Invariant cache hit.
[2023-03-20 09:59:05] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 439 ms. Remains : 163/163 places, 162/162 transitions.
Stuttering acceptance computed with spot in 149 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-020A-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (EQ s116 0) (EQ s117 0) (EQ s120 0)), p1:(OR (AND (EQ s116 1) (EQ s117 1) (EQ s120 1)) (EQ s69 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-020A-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020A-LTLFireability-08 finished in 616 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(((p1||X(p0)) U (p2||F(G(!p3))))))))'
Support contains 6 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 162/162 transitions.
Applied a total of 0 rules in 2 ms. Remains 163 /163 variables (removed 0) and now considering 162/162 (removed 0) transitions.
[2023-03-20 09:59:05] [INFO ] Invariant cache hit.
[2023-03-20 09:59:05] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-20 09:59:05] [INFO ] Invariant cache hit.
[2023-03-20 09:59:05] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
[2023-03-20 09:59:05] [INFO ] Invariant cache hit.
[2023-03-20 09:59:05] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 406 ms. Remains : 163/163 places, 162/162 transitions.
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p0) (NOT p2) p3), (AND (NOT p0) (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p0) p3), p3]
Running random walk in product with property : ShieldRVt-PT-020A-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p3), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p3), acceptance={} source=4 dest: 4}, { cond=p3, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s45 1), p2:(EQ s37 1), p3:(EQ s5 1), p1:(AND (EQ s60 1) (EQ s61 1) (EQ s64 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 277 ms.
Product exploration explored 100000 steps with 0 reset in 400 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 p2) (NOT p3) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) p3))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 274 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 5 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p0) p3), p3]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 259 ms. (steps per millisecond=38 ) properties (out of 5) 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 5) 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 5) 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 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-20 09:59:07] [INFO ] Invariant cache hit.
[2023-03-20 09:59:07] [INFO ] [Real]Absence check using 81 positive place invariants in 9 ms returned sat
[2023-03-20 09:59:07] [INFO ] After 134ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 09:59:08] [INFO ] [Nat]Absence check using 81 positive place invariants in 10 ms returned sat
[2023-03-20 09:59:08] [INFO ] After 69ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 09:59:08] [INFO ] After 121ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-20 09:59:08] [INFO ] After 213ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 118 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=39 )
Parikh walk visited 4 properties in 2 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) p3))))]
False Knowledge obtained : [(F p3), (F p0), (F (NOT (AND (NOT p2) (NOT p3)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND (NOT p2) p3))]
Knowledge based reduction with 5 factoid took 356 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 5 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p0) p3), p3]
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p0) p3), p3]
Support contains 6 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 162/162 transitions.
Applied a total of 0 rules in 2 ms. Remains 163 /163 variables (removed 0) and now considering 162/162 (removed 0) transitions.
[2023-03-20 09:59:09] [INFO ] Invariant cache hit.
[2023-03-20 09:59:09] [INFO ] Implicit Places using invariants in 104 ms returned []
[2023-03-20 09:59:09] [INFO ] Invariant cache hit.
[2023-03-20 09:59:09] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
[2023-03-20 09:59:09] [INFO ] Invariant cache hit.
[2023-03-20 09:59:09] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 362 ms. Remains : 163/163 places, 162/162 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 p2) (NOT p3) (NOT p1) (NOT p0)), (X (X (AND (NOT p2) (NOT p3)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p2) p3))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 225 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 5 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[(AND (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p0) p3), p3]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-20 09:59:10] [INFO ] Invariant cache hit.
[2023-03-20 09:59:10] [INFO ] [Real]Absence check using 81 positive place invariants in 10 ms returned sat
[2023-03-20 09:59:10] [INFO ] After 138ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 09:59:10] [INFO ] [Nat]Absence check using 81 positive place invariants in 11 ms returned sat
[2023-03-20 09:59:10] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 09:59:10] [INFO ] After 112ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-20 09:59:10] [INFO ] After 220ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 85 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=28 )
Parikh walk visited 4 properties in 2 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (X (X (AND (NOT p2) (NOT p3)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p2) p3))))]
False Knowledge obtained : [(F p3), (F p0), (F (NOT (AND (NOT p2) (NOT p3)))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND (NOT p2) p3))]
Knowledge based reduction with 4 factoid took 291 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 5 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[(AND (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p0) p3), p3]
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p0) p3), p3]
Stuttering acceptance computed with spot in 258 ms :[(AND (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p0) p3), p3]
Product exploration explored 100000 steps with 0 reset in 346 ms.
Product exploration explored 100000 steps with 0 reset in 411 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 228 ms :[(AND (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p2) p3), (AND (NOT p0) p3), p3]
Support contains 6 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 162/162 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 163 transition count 162
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 35 ms. Remains 163 /163 variables (removed 0) and now considering 162/162 (removed 0) transitions.
[2023-03-20 09:59:12] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 162 rows 163 cols
[2023-03-20 09:59:12] [INFO ] Computed 81 place invariants in 2 ms
[2023-03-20 09:59:12] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 163/163 places, 162/162 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 176 ms. Remains : 163/163 places, 162/162 transitions.
Support contains 6 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 162/162 transitions.
Applied a total of 0 rules in 4 ms. Remains 163 /163 variables (removed 0) and now considering 162/162 (removed 0) transitions.
// Phase 1: matrix 162 rows 163 cols
[2023-03-20 09:59:13] [INFO ] Computed 81 place invariants in 1 ms
[2023-03-20 09:59:13] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-20 09:59:13] [INFO ] Invariant cache hit.
[2023-03-20 09:59:13] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
[2023-03-20 09:59:13] [INFO ] Invariant cache hit.
[2023-03-20 09:59:13] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 399 ms. Remains : 163/163 places, 162/162 transitions.
Treatment of property ShieldRVt-PT-020A-LTLFireability-09 finished in 7912 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))&&(G((p1||X(p1))) U G(p2)))))'
Support contains 7 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 162/162 transitions.
Applied a total of 0 rules in 1 ms. Remains 163 /163 variables (removed 0) and now considering 162/162 (removed 0) transitions.
[2023-03-20 09:59:13] [INFO ] Invariant cache hit.
[2023-03-20 09:59:13] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-20 09:59:13] [INFO ] Invariant cache hit.
[2023-03-20 09:59:13] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
[2023-03-20 09:59:13] [INFO ] Invariant cache hit.
[2023-03-20 09:59:13] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 332 ms. Remains : 163/163 places, 162/162 transitions.
Stuttering acceptance computed with spot in 340 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p1), (AND p2 (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : ShieldRVt-PT-020A-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}, { cond=true, acceptance={} source=1 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 6}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 7}], [{ cond=(NOT p1), acceptance={} source=3 dest: 7}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}, { cond=(NOT p2), acceptance={0} source=5 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 7}, { cond=(AND p2 (NOT p1)), acceptance={} source=6 dest: 8}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(NOT p2), acceptance={} source=8 dest: 7}, { cond=p2, acceptance={} source=8 dest: 8}]], initial=0, aps=[p2:(AND (EQ s100 1) (EQ s101 1) (EQ s104 1)), p1:(AND (EQ s75 1) (EQ s84 1) (EQ s90 1)), p0:(EQ s79 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][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-020A-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020A-LTLFireability-10 finished in 696 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((!((F((F(p0)&&F(p1)))||p0) U p2)||p3))))'
Support contains 8 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 162/162 transitions.
Applied a total of 0 rules in 1 ms. Remains 163 /163 variables (removed 0) and now considering 162/162 (removed 0) transitions.
[2023-03-20 09:59:14] [INFO ] Invariant cache hit.
[2023-03-20 09:59:14] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-20 09:59:14] [INFO ] Invariant cache hit.
[2023-03-20 09:59:14] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
[2023-03-20 09:59:14] [INFO ] Invariant cache hit.
[2023-03-20 09:59:14] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 354 ms. Remains : 163/163 places, 162/162 transitions.
Stuttering acceptance computed with spot in 380 ms :[(AND p2 (NOT p3)), (AND p2 (NOT p3)), true, (AND p2 p3), (AND p3 p2 p0 p1), (AND p0 p2 p3), p0, p1, (AND p0 p1), (AND p1 p2 p3)]
Running random walk in product with property : ShieldRVt-PT-020A-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p3 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) p0 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p3) (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p3 p2), acceptance={} source=3 dest: 2}, { cond=(AND p3 p0 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p3 (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p3 (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND p3 p0 p1 p2), acceptance={} source=4 dest: 2}, { cond=(AND p3 p0 p1 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p3 (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p3 (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=4 dest: 6}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 7}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 8}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 9}], [{ cond=(AND p3 p0 p2), acceptance={} source=5 dest: 2}, { cond=(AND p3 p0 (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND p3 (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p3 (NOT p0) p1 (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 6}], [{ cond=p0, acceptance={} source=6 dest: 2}, { cond=(NOT p0), acceptance={} source=6 dest: 6}], [{ cond=p1, acceptance={} source=7 dest: 2}, { cond=(NOT p1), acceptance={} source=7 dest: 7}], [{ cond=(AND p0 p1), acceptance={} source=8 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 8}], [{ cond=(AND p3 p1 p2), acceptance={} source=9 dest: 2}, { cond=(AND p3 p0 p1 (NOT p2)), acceptance={} source=9 dest: 3}, { cond=(AND p3 (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=9 dest: 4}, { cond=(AND p3 (NOT p0) p1 (NOT p2)), acceptance={} source=9 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={} source=9 dest: 7}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=9 dest: 9}]], initial=0, aps=[p3:(AND (EQ s142 1) (EQ s145 1)), p2:(EQ s65 1), p0:(AND (EQ s22 1) (EQ s25 1)), p1:(AND (EQ s56 1) (EQ s58 1) (EQ s63 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 24424 reset in 483 ms.
Product exploration explored 100000 steps with 24469 reset in 642 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 p3) (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND (NOT p3) (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p3) p0 (NOT p2)))), (X (OR p3 (NOT p2))), (X (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p3 (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p3 (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p3 p2)))), (X (X (NOT (AND (NOT p3) p2)))), true, (X (X (NOT (AND p3 p0 p1 p2)))), (X (X (NOT (AND p3 p0 p2)))), (X (X (NOT (AND (NOT p3) p0 (NOT p2))))), (X (X (OR p3 (NOT p2)))), (X (X (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p3 p0 p1 (NOT p2))))), (X (X (NOT (AND p3 p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 24 factoid took 1412 ms. Reduced automaton from 10 states, 38 edges and 4 AP (stutter sensitive) to 10 states, 38 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 527 ms :[true, (OR (AND p0 p1 p2) (AND p2 (NOT p3))), p2, (OR (AND p2 (NOT p3)) (AND p0 p2)), (OR (AND p2 (NOT p3)) (AND p1 p2)), (OR (AND p0 p1 p2) (AND p2 (NOT p3))), (OR p1 (AND p2 (NOT p3))), (OR p0 (AND p2 (NOT p3))), (OR (AND p2 (NOT p3)) (AND p0 p1)), (OR p2 p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 346 ms. (steps per millisecond=28 ) properties (out of 25) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-20 09:59:19] [INFO ] Invariant cache hit.
[2023-03-20 09:59:19] [INFO ] [Real]Absence check using 81 positive place invariants in 11 ms returned sat
[2023-03-20 09:59:19] [INFO ] After 199ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-20 09:59:19] [INFO ] [Nat]Absence check using 81 positive place invariants in 12 ms returned sat
[2023-03-20 09:59:19] [INFO ] After 156ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-20 09:59:19] [INFO ] After 292ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 97 ms.
[2023-03-20 09:59:19] [INFO ] After 495ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 148 ms.
Support contains 8 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 162/162 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 162 transition count 161
Partial Free-agglomeration rule applied 18 times.
Drop transitions removed 18 transitions
Iterating global reduction 0 with 18 rules applied. Total rules applied 20 place count 162 transition count 161
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 0 with 18 rules applied. Total rules applied 38 place count 162 transition count 143
Applied a total of 38 rules in 43 ms. Remains 162 /163 variables (removed 1) and now considering 143/162 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 162/163 places, 143/162 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 11) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 143 rows 162 cols
[2023-03-20 09:59:20] [INFO ] Computed 81 place invariants in 3 ms
[2023-03-20 09:59:20] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 09:59:20] [INFO ] [Nat]Absence check using 81 positive place invariants in 13 ms returned sat
[2023-03-20 09:59:20] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 09:59:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 09:59:20] [INFO ] After 10ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 09:59:20] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-20 09:59:20] [INFO ] After 178ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 8 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 143/143 transitions.
Applied a total of 0 rules in 5 ms. Remains 162 /162 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 162/162 places, 143/143 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Finished probabilistic random walk after 19981 steps, run visited all 1 properties in 97 ms. (steps per millisecond=205 )
Probabilistic random walk after 19981 steps, saw 19084 distinct states, run finished after 97 ms. (steps per millisecond=205 ) properties seen :1
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND (NOT p3) (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p3) p0 (NOT p2)))), (X (OR p3 (NOT p2))), (X (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p3 (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p3 (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p3 p2)))), (X (X (NOT (AND (NOT p3) p2)))), true, (X (X (NOT (AND p3 p0 p1 p2)))), (X (X (NOT (AND p3 p0 p2)))), (X (X (NOT (AND (NOT p3) p0 (NOT p2))))), (X (X (OR p3 (NOT p2)))), (X (X (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p3 p0 p1 (NOT p2))))), (X (X (NOT (AND p3 p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(F (OR (AND (NOT p3) p2) (AND p0 p2))), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (F (AND (NOT p1) p0 (NOT p2))), (F (OR (AND p1 p2) (AND (NOT p3) p2))), (F (OR p1 p2)), (F (AND p3 (NOT p0) p2)), (F p2), (F (AND p1 (NOT p0) (NOT p2))), (F (AND p0 (NOT p2))), (F (NOT (OR (AND (NOT p1) p3 (NOT p0)) (AND (NOT p1) (NOT p0) (NOT p2))))), (F (OR (AND p1 p3 (NOT p0)) (AND p1 (NOT p0) (NOT p2)))), (F (AND (NOT p1) p3 p0)), (F (AND (NOT p1) p3 p0 (NOT p2))), (F (OR (AND p1 p0 (NOT p2)) (AND (NOT p3) p0 (NOT p2)))), (F (AND (NOT p1) p3 p2)), (F (NOT (OR (AND (NOT p1) p3) (AND (NOT p1) (NOT p0) (NOT p2))))), (F (OR p1 (AND (NOT p3) p2))), (F (AND (NOT p1) p3 (NOT p0) p2)), (F (AND p1 p3 (NOT p0) p2)), (F (OR (AND p1 p0) (AND (NOT p3) p2))), (F (NOT (OR (AND p3 (NOT p0)) (AND (NOT p0) (NOT p2))))), (F (OR (AND (NOT p3) p2) p0)), (F (AND (NOT p1) (NOT p3) p0 (NOT p2))), (F (AND (NOT p1) p3 p0 p2)), (F (OR (AND p1 p0 p2) (AND (NOT p3) p2)))]
Knowledge based reduction with 24 factoid took 1941 ms. Reduced automaton from 10 states, 38 edges and 4 AP (stutter sensitive) to 10 states, 38 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 524 ms :[true, (OR (AND p0 p1 p2) (AND p2 (NOT p3))), p2, (OR (AND p2 (NOT p3)) (AND p0 p2)), (OR (AND p2 (NOT p3)) (AND p1 p2)), (OR (AND p0 p1 p2) (AND p2 (NOT p3))), (OR p1 p2), (OR p1 (AND p2 (NOT p3))), (OR p0 (AND p2 (NOT p3))), (OR (AND p2 (NOT p3)) (AND p0 p1))]
Stuttering acceptance computed with spot in 525 ms :[true, (OR (AND p0 p1 p2) (AND p2 (NOT p3))), p2, (OR (AND p2 (NOT p3)) (AND p0 p2)), (OR (AND p2 (NOT p3)) (AND p1 p2)), (OR (AND p0 p1 p2) (AND p2 (NOT p3))), (OR p1 p2), (OR p1 (AND p2 (NOT p3))), (OR p0 (AND p2 (NOT p3))), (OR (AND p2 (NOT p3)) (AND p0 p1))]
Support contains 8 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 162/162 transitions.
Applied a total of 0 rules in 3 ms. Remains 163 /163 variables (removed 0) and now considering 162/162 (removed 0) transitions.
// Phase 1: matrix 162 rows 163 cols
[2023-03-20 09:59:23] [INFO ] Computed 81 place invariants in 1 ms
[2023-03-20 09:59:23] [INFO ] Implicit Places using invariants in 142 ms returned []
[2023-03-20 09:59:23] [INFO ] Invariant cache hit.
[2023-03-20 09:59:23] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
[2023-03-20 09:59:23] [INFO ] Invariant cache hit.
[2023-03-20 09:59:24] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 442 ms. Remains : 163/163 places, 162/162 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 p2) (NOT p0) (NOT p1) (NOT p3)), (X (NOT (AND (NOT p1) p3 (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (OR (AND p1 p0 (NOT p2)) (AND (NOT p3) p0 (NOT p2))))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) p3 p0 (NOT p2)))), (X (NOT (AND (NOT p1) p3 p0 p2))), (X (NOT (AND p1 p3 (NOT p0) p2))), (X (NOT (OR (AND p1 p0 p2) (AND (NOT p3) p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p3 p0)))), (X (X (NOT (AND (NOT p1) p3 (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (OR p1 (AND (NOT p3) p2))))), (X (X (NOT (OR (AND (NOT p3) p2) p0)))), (X (X (OR (AND p3 (NOT p0)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p3 p0 (NOT p2))))), (X (X (NOT (OR (AND p1 p0) (AND (NOT p3) p2))))), (X (X (OR (AND (NOT p1) p3) (AND (NOT p1) (NOT p0) (NOT p2))))), true, (X (X (NOT (OR (AND p1 p2) (AND (NOT p3) p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND p1 p0 (NOT p2)) (AND (NOT p3) p0 (NOT p2)))))), (X (X (NOT (OR (AND p1 p3 (NOT p0)) (AND p1 (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p1) p3 p2)))), (X (X (NOT (AND p3 (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (OR (AND (NOT p3) p2) (AND p0 p2))))), (X (X (NOT (AND (NOT p1) (NOT p3) p0 (NOT p2))))), (X (X (OR (AND (NOT p1) p3 (NOT p0)) (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p3 p0 p2)))), (X (X (NOT (AND p1 p3 (NOT p0) p2)))), (X (X (NOT (OR (AND p1 p0 p2) (AND (NOT p3) p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 33 factoid took 1715 ms. Reduced automaton from 10 states, 38 edges and 4 AP (stutter sensitive) to 10 states, 38 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 471 ms :[true, (OR (AND p0 p1 p2) (AND p2 (NOT p3))), p2, (OR (AND p2 (NOT p3)) (AND p0 p2)), (OR (AND p2 (NOT p3)) (AND p1 p2)), (OR (AND p0 p1 p2) (AND p2 (NOT p3))), (OR p1 p2), (OR p1 (AND p2 (NOT p3))), (OR p0 (AND p2 (NOT p3))), (OR (AND p2 (NOT p3)) (AND p0 p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 411 ms. (steps per millisecond=24 ) properties (out of 25) 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 25) 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 25) 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 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) 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 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) 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 25) 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 25) 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 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 25) 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 25) 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 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Interrupted probabilistic random walk after 239971 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :{0=1, 1=1, 2=1, 3=1, 4=1, 5=1, 6=1, 7=1, 9=1, 10=1, 11=1, 13=1, 14=1, 15=1, 16=1, 17=1, 18=1, 19=1, 20=1, 21=1, 22=1, 23=1, 24=1}
Probabilistic random walk after 239971 steps, saw 227673 distinct states, run finished after 3003 ms. (steps per millisecond=79 ) properties seen :23
Running SMT prover for 2 properties.
[2023-03-20 09:59:29] [INFO ] Invariant cache hit.
[2023-03-20 09:59:29] [INFO ] [Real]Absence check using 81 positive place invariants in 10 ms returned sat
[2023-03-20 09:59:30] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 09:59:30] [INFO ] [Nat]Absence check using 81 positive place invariants in 9 ms returned sat
[2023-03-20 09:59:30] [INFO ] After 83ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 09:59:30] [INFO ] After 114ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-03-20 09:59:30] [INFO ] After 209ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 12 ms.
Support contains 8 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 162/162 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 162 transition count 161
Partial Free-agglomeration rule applied 18 times.
Drop transitions removed 18 transitions
Iterating global reduction 0 with 18 rules applied. Total rules applied 20 place count 162 transition count 161
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 0 with 18 rules applied. Total rules applied 38 place count 162 transition count 143
Applied a total of 38 rules in 15 ms. Remains 162 /163 variables (removed 1) and now considering 143/162 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 162/163 places, 143/162 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :1
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
Running SMT prover for 1 properties.
// Phase 1: matrix 143 rows 162 cols
[2023-03-20 09:59:30] [INFO ] Computed 81 place invariants in 1 ms
[2023-03-20 09:59:30] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 09:59:30] [INFO ] [Nat]Absence check using 81 positive place invariants in 18 ms returned sat
[2023-03-20 09:59:30] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 09:59:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 09:59:30] [INFO ] After 11ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 09:59:30] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-20 09:59:30] [INFO ] After 173ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 8 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 143/143 transitions.
Applied a total of 0 rules in 8 ms. Remains 162 /162 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 162/162 places, 143/143 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 831974 steps, run timeout after 3001 ms. (steps per millisecond=277 ) properties seen :{}
Probabilistic random walk after 831974 steps, saw 767492 distinct states, run finished after 3002 ms. (steps per millisecond=277 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 09:59:33] [INFO ] Invariant cache hit.
[2023-03-20 09:59:33] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 09:59:33] [INFO ] [Nat]Absence check using 81 positive place invariants in 12 ms returned sat
[2023-03-20 09:59:33] [INFO ] After 62ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 09:59:33] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 09:59:33] [INFO ] After 12ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 09:59:33] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-20 09:59:33] [INFO ] After 163ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 8 out of 162 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 143/143 transitions.
Applied a total of 0 rules in 4 ms. Remains 162 /162 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 162/162 places, 143/143 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 162/162 places, 143/143 transitions.
Applied a total of 0 rules in 4 ms. Remains 162 /162 variables (removed 0) and now considering 143/143 (removed 0) transitions.
[2023-03-20 09:59:33] [INFO ] Invariant cache hit.
[2023-03-20 09:59:34] [INFO ] Implicit Places using invariants in 97 ms returned [155]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 98 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 161/162 places, 143/143 transitions.
Applied a total of 0 rules in 5 ms. Remains 161 /161 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 107 ms. Remains : 161/162 places, 143/143 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 910525 steps, run timeout after 3025 ms. (steps per millisecond=301 ) properties seen :{}
Probabilistic random walk after 910525 steps, saw 838873 distinct states, run finished after 3025 ms. (steps per millisecond=301 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 143 rows 161 cols
[2023-03-20 09:59:37] [INFO ] Computed 80 place invariants in 2 ms
[2023-03-20 09:59:37] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 09:59:37] [INFO ] [Nat]Absence check using 80 positive place invariants in 40 ms returned sat
[2023-03-20 09:59:37] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 09:59:37] [INFO ] After 94ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-20 09:59:37] [INFO ] After 238ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 8 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 143/143 transitions.
Applied a total of 0 rules in 4 ms. Remains 161 /161 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 161/161 places, 143/143 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 143/143 transitions.
Applied a total of 0 rules in 5 ms. Remains 161 /161 variables (removed 0) and now considering 143/143 (removed 0) transitions.
[2023-03-20 09:59:37] [INFO ] Invariant cache hit.
[2023-03-20 09:59:37] [INFO ] Implicit Places using invariants in 140 ms returned []
[2023-03-20 09:59:37] [INFO ] Invariant cache hit.
[2023-03-20 09:59:37] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
[2023-03-20 09:59:37] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-20 09:59:37] [INFO ] Invariant cache hit.
[2023-03-20 09:59:37] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 437 ms. Remains : 161/161 places, 143/143 transitions.
Applied a total of 0 rules in 5 ms. Remains 161 /161 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-20 09:59:37] [INFO ] Invariant cache hit.
[2023-03-20 09:59:37] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 09:59:37] [INFO ] [Nat]Absence check using 80 positive place invariants in 11 ms returned sat
[2023-03-20 09:59:38] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 09:59:38] [INFO ] After 76ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-20 09:59:38] [INFO ] After 144ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), (X (NOT (AND (NOT p1) p3 (NOT p0) p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (OR (AND p1 p0 (NOT p2)) (AND (NOT p3) p0 (NOT p2))))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) p3 p0 (NOT p2)))), (X (NOT (AND (NOT p1) p3 p0 p2))), (X (NOT (AND p1 p3 (NOT p0) p2))), (X (NOT (OR (AND p1 p0 p2) (AND (NOT p3) p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p3 p0)))), (X (X (NOT (AND (NOT p1) p3 (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (OR p1 (AND (NOT p3) p2))))), (X (X (NOT (OR (AND (NOT p3) p2) p0)))), (X (X (OR (AND p3 (NOT p0)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p3 p0 (NOT p2))))), (X (X (NOT (OR (AND p1 p0) (AND (NOT p3) p2))))), (X (X (OR (AND (NOT p1) p3) (AND (NOT p1) (NOT p0) (NOT p2))))), true, (X (X (NOT (OR (AND p1 p2) (AND (NOT p3) p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND p1 p0 (NOT p2)) (AND (NOT p3) p0 (NOT p2)))))), (X (X (NOT (OR (AND p1 p3 (NOT p0)) (AND p1 (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p1) p3 p2)))), (X (X (NOT (AND p3 (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (OR (AND (NOT p3) p2) (AND p0 p2))))), (X (X (NOT (AND (NOT p1) (NOT p3) p0 (NOT p2))))), (X (X (OR (AND (NOT p1) p3 (NOT p0)) (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p3 p0 p2)))), (X (X (NOT (AND p1 p3 (NOT p0) p2)))), (X (X (NOT (OR (AND p1 p0 p2) (AND (NOT p3) p2)))))]
False Knowledge obtained : [(F (OR (AND p2 p0) (AND p2 (NOT p3)))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (F (NOT (OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p0) p3)))), (F (OR (AND p1 p2) (AND p2 (NOT p3)))), (F (AND p2 (NOT p0) p3)), (F (OR (AND p1 (NOT p2) (NOT p0)) (AND p1 (NOT p0) p3))), (F p2), (F (AND p1 (NOT p2) (NOT p0))), (F (AND (NOT p2) p0)), (F (AND (NOT p1) p0 p3)), (F (OR (AND p1 p0) (AND p2 (NOT p3)))), (F (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) p3)))), (F (OR (AND p1 (NOT p2) p0) (AND (NOT p2) p0 (NOT p3)))), (F (AND (NOT p1) p2 p3)), (F (AND (NOT p1) (NOT p2) p0)), (F (OR p1 p2)), (F (AND (NOT p1) p2 (NOT p0) p3)), (F (AND p1 p2 (NOT p0) p3)), (F (OR (AND p2 (NOT p3)) p0)), (F (NOT (OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p1) p3)))), (F (AND (NOT p1) (NOT p2) p0 (NOT p3))), (F (OR p1 (AND p2 (NOT p3)))), (F (AND (NOT p1) p2 p0 p3)), (F (OR (AND p1 p2 p0) (AND p2 (NOT p3))))]
Knowledge based reduction with 33 factoid took 2595 ms. Reduced automaton from 10 states, 38 edges and 4 AP (stutter sensitive) to 10 states, 38 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 606 ms :[true, (OR (AND p0 p1 p2) (AND p2 (NOT p3))), p2, (OR (AND p2 (NOT p3)) (AND p0 p2)), (OR (AND p2 (NOT p3)) (AND p1 p2)), (OR (AND p0 p1 p2) (AND p2 (NOT p3))), (OR p1 p2), (OR p1 (AND p2 (NOT p3))), (OR p0 (AND p2 (NOT p3))), (OR (AND p2 (NOT p3)) (AND p0 p1))]
Stuttering acceptance computed with spot in 524 ms :[true, (OR (AND p0 p1 p2) (AND p2 (NOT p3))), p2, (OR (AND p2 (NOT p3)) (AND p0 p2)), (OR (AND p2 (NOT p3)) (AND p1 p2)), (OR (AND p0 p1 p2) (AND p2 (NOT p3))), (OR p1 p2), (OR p1 (AND p2 (NOT p3))), (OR p0 (AND p2 (NOT p3))), (OR (AND p2 (NOT p3)) (AND p0 p1))]
Stuttering acceptance computed with spot in 940 ms :[true, (OR (AND p0 p1 p2) (AND p2 (NOT p3))), p2, (OR (AND p2 (NOT p3)) (AND p0 p2)), (OR (AND p2 (NOT p3)) (AND p1 p2)), (OR (AND p0 p1 p2) (AND p2 (NOT p3))), (OR p1 p2), (OR p1 (AND p2 (NOT p3))), (OR p0 (AND p2 (NOT p3))), (OR (AND p2 (NOT p3)) (AND p0 p1))]
Entered a terminal (fully accepting) state of product in 10592 steps with 0 reset in 65 ms.
FORMULA ShieldRVt-PT-020A-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020A-LTLFireability-11 finished in 28662 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p0)||X(X(F(!p1))))) U p2))'
Support contains 9 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 162/162 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 162 transition count 161
Applied a total of 2 rules in 9 ms. Remains 162 /163 variables (removed 1) and now considering 161/162 (removed 1) transitions.
// Phase 1: matrix 161 rows 162 cols
[2023-03-20 09:59:42] [INFO ] Computed 81 place invariants in 1 ms
[2023-03-20 09:59:42] [INFO ] Implicit Places using invariants in 134 ms returned [155]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 149 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 161/163 places, 161/162 transitions.
Applied a total of 0 rules in 5 ms. Remains 161 /161 variables (removed 0) and now considering 161/161 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 165 ms. Remains : 161/163 places, 161/162 transitions.
Stuttering acceptance computed with spot in 272 ms :[(NOT p2), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : ShieldRVt-PT-020A-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s88 1) (EQ s90 1) (EQ s95 1)), p0:(AND (EQ s144 1) (EQ s146 1) (EQ s151 1)), p1:(AND (EQ s20 1) (EQ s21 1) (EQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 21528 reset in 528 ms.
Stack based approach found an accepted trace after 675 steps with 142 reset with depth 5 and stack size 5 in 3 ms.
FORMULA ShieldRVt-PT-020A-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-020A-LTLFireability-12 finished in 1004 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||G(F(p1)))))))'
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 162/162 transitions.
Applied a total of 0 rules in 1 ms. Remains 163 /163 variables (removed 0) and now considering 162/162 (removed 0) transitions.
// Phase 1: matrix 162 rows 163 cols
[2023-03-20 09:59:43] [INFO ] Computed 81 place invariants in 2 ms
[2023-03-20 09:59:43] [INFO ] Implicit Places using invariants in 119 ms returned []
[2023-03-20 09:59:43] [INFO ] Invariant cache hit.
[2023-03-20 09:59:44] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
[2023-03-20 09:59:44] [INFO ] Invariant cache hit.
[2023-03-20 09:59:44] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 384 ms. Remains : 163/163 places, 162/162 transitions.
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-020A-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s155 0), p1:(EQ s59 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 33333 reset in 465 ms.
Product exploration explored 100000 steps with 33333 reset in 417 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 p0 (NOT p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-020A-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-020A-LTLFireability-13 finished in 1548 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G((p0||X(p0)))) U p1))'
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 162/162 transitions.
Applied a total of 0 rules in 1 ms. Remains 163 /163 variables (removed 0) and now considering 162/162 (removed 0) transitions.
[2023-03-20 09:59:45] [INFO ] Invariant cache hit.
[2023-03-20 09:59:45] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-20 09:59:45] [INFO ] Invariant cache hit.
[2023-03-20 09:59:45] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
[2023-03-20 09:59:45] [INFO ] Invariant cache hit.
[2023-03-20 09:59:45] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 405 ms. Remains : 163/163 places, 162/162 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-020A-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s155 1), p0:(EQ s61 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 5 reset in 281 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA ShieldRVt-PT-020A-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-020A-LTLFireability-14 finished in 867 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&F(p1))))'
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 162/162 transitions.
Applied a total of 0 rules in 1 ms. Remains 163 /163 variables (removed 0) and now considering 162/162 (removed 0) transitions.
[2023-03-20 09:59:46] [INFO ] Invariant cache hit.
[2023-03-20 09:59:46] [INFO ] Implicit Places using invariants in 120 ms returned []
[2023-03-20 09:59:46] [INFO ] Invariant cache hit.
[2023-03-20 09:59:46] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
[2023-03-20 09:59:46] [INFO ] Invariant cache hit.
[2023-03-20 09:59:46] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 460 ms. Remains : 163/163 places, 162/162 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-020A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(AND (EQ s11 1) (EQ s20 1) (EQ s26 1)), p1:(EQ s33 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-020A-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-020A-LTLFireability-15 finished in 656 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(((p1||X(p0)) U (p2||F(G(!p3))))))))'
[2023-03-20 09:59:47] [INFO ] Flatten gal took : 28 ms
[2023-03-20 09:59:47] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-20 09:59:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 163 places, 162 transitions and 684 arcs took 3 ms.
Total runtime 50859 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1974/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldRVt-PT-020A-LTLFireability-09

BK_STOP 1679306387747

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

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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