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.r421-tajo-167905974900220.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 itstools
Input is ShieldRVt-PT-003B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r421-tajo-167905974900220
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 6.5K Feb 25 22:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 22:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 22:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 25 22:49 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.3K Feb 25 17:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 17:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 22:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Feb 25 22:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 25 22:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Feb 25 22:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 36K 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-003B-LTLFireability-00
FORMULA_NAME ShieldRVt-PT-003B-LTLFireability-01
FORMULA_NAME ShieldRVt-PT-003B-LTLFireability-02
FORMULA_NAME ShieldRVt-PT-003B-LTLFireability-03
FORMULA_NAME ShieldRVt-PT-003B-LTLFireability-04
FORMULA_NAME ShieldRVt-PT-003B-LTLFireability-05
FORMULA_NAME ShieldRVt-PT-003B-LTLFireability-06
FORMULA_NAME ShieldRVt-PT-003B-LTLFireability-07
FORMULA_NAME ShieldRVt-PT-003B-LTLFireability-08
FORMULA_NAME ShieldRVt-PT-003B-LTLFireability-09
FORMULA_NAME ShieldRVt-PT-003B-LTLFireability-10
FORMULA_NAME ShieldRVt-PT-003B-LTLFireability-11
FORMULA_NAME ShieldRVt-PT-003B-LTLFireability-12
FORMULA_NAME ShieldRVt-PT-003B-LTLFireability-13
FORMULA_NAME ShieldRVt-PT-003B-LTLFireability-14
FORMULA_NAME ShieldRVt-PT-003B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679170887205

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-003B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-18 20:21:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-18 20:21:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 20:21:28] [INFO ] Load time of PNML (sax parser for PT used): 44 ms
[2023-03-18 20:21:28] [INFO ] Transformed 153 places.
[2023-03-18 20:21:28] [INFO ] Transformed 153 transitions.
[2023-03-18 20:21:28] [INFO ] Found NUPN structural information;
[2023-03-18 20:21:28] [INFO ] Parsed PT model containing 153 places and 153 transitions and 360 arcs in 118 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldRVt-PT-003B-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-003B-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 153/153 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 129 transition count 129
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 129 transition count 129
Applied a total of 48 rules in 21 ms. Remains 129 /153 variables (removed 24) and now considering 129/153 (removed 24) transitions.
// Phase 1: matrix 129 rows 129 cols
[2023-03-18 20:21:29] [INFO ] Computed 13 place invariants in 11 ms
[2023-03-18 20:21:29] [INFO ] Implicit Places using invariants in 154 ms returned []
[2023-03-18 20:21:29] [INFO ] Invariant cache hit.
[2023-03-18 20:21:29] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
[2023-03-18 20:21:29] [INFO ] Invariant cache hit.
[2023-03-18 20:21:29] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 129/153 places, 129/153 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 414 ms. Remains : 129/153 places, 129/153 transitions.
Support contains 37 out of 129 places after structural reductions.
[2023-03-18 20:21:29] [INFO ] Flatten gal took : 28 ms
[2023-03-18 20:21:29] [INFO ] Flatten gal took : 11 ms
[2023-03-18 20:21:29] [INFO ] Input system was already deterministic with 129 transitions.
Finished random walk after 2349 steps, including 0 resets, run visited all 35 properties in 73 ms. (steps per millisecond=32 )
FORMULA ShieldRVt-PT-003B-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 39 stabilizing places and 39 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((F(p0) U p1))))'
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 129/129 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 128 transition count 93
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 71 place count 93 transition count 92
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 92 transition count 92
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 72 place count 92 transition count 73
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 110 place count 73 transition count 73
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 115 place count 68 transition count 68
Iterating global reduction 3 with 5 rules applied. Total rules applied 120 place count 68 transition count 68
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 120 place count 68 transition count 64
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 128 place count 64 transition count 64
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 176 place count 40 transition count 40
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 177 place count 40 transition count 39
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 4 with 2 rules applied. Total rules applied 179 place count 39 transition count 38
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 193 place count 32 transition count 44
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 194 place count 32 transition count 44
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 195 place count 31 transition count 43
Applied a total of 195 rules in 55 ms. Remains 31 /129 variables (removed 98) and now considering 43/129 (removed 86) transitions.
// Phase 1: matrix 43 rows 31 cols
[2023-03-18 20:21:30] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-18 20:21:30] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-18 20:21:30] [INFO ] Invariant cache hit.
[2023-03-18 20:21:30] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-18 20:21:30] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2023-03-18 20:21:30] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 20:21:30] [INFO ] Invariant cache hit.
[2023-03-18 20:21:30] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 31/129 places, 43/129 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 230 ms. Remains : 31/129 places, 43/129 transitions.
Stuttering acceptance computed with spot in 215 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-003B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s28 1) (EQ s12 1)), p0:(EQ s21 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 8308 steps with 0 reset in 51 ms.
FORMULA ShieldRVt-PT-003B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-003B-LTLFireability-00 finished in 565 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(F(p0))||(p1&&F(p2))))))'
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 129/129 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 121 transition count 121
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 121 transition count 121
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 120 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 120 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 119 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 119 transition count 119
Applied a total of 20 rules in 26 ms. Remains 119 /129 variables (removed 10) and now considering 119/129 (removed 10) transitions.
// Phase 1: matrix 119 rows 119 cols
[2023-03-18 20:21:30] [INFO ] Computed 13 place invariants in 5 ms
[2023-03-18 20:21:30] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-18 20:21:30] [INFO ] Invariant cache hit.
[2023-03-18 20:21:31] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2023-03-18 20:21:31] [INFO ] Invariant cache hit.
[2023-03-18 20:21:31] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 119/129 places, 119/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 236 ms. Remains : 119/129 places, 119/129 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : ShieldRVt-PT-003B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s15 0), p2:(AND (EQ s20 0) (EQ s15 0)), p1:(EQ s20 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 263 ms.
Product exploration explored 100000 steps with 50000 reset in 245 ms.
Computed a total of 34 stabilizing places and 34 stable transitions
Computed a total of 34 stabilizing places and 34 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p0) (NOT p2)))))
Knowledge based reduction with 6 factoid took 190 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-003B-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-003B-LTLFireability-01 finished in 1087 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)))'
Support contains 1 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 129/129 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 120 transition count 120
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 120 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 119 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 119 transition count 119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 118 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 118 transition count 118
Applied a total of 22 rules in 13 ms. Remains 118 /129 variables (removed 11) and now considering 118/129 (removed 11) transitions.
// Phase 1: matrix 118 rows 118 cols
[2023-03-18 20:21:31] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-18 20:21:31] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-18 20:21:31] [INFO ] Invariant cache hit.
[2023-03-18 20:21:32] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2023-03-18 20:21:32] [INFO ] Invariant cache hit.
[2023-03-18 20:21:32] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 118/129 places, 118/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 222 ms. Remains : 118/129 places, 118/129 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-003B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s106 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 156 ms.
Product exploration explored 100000 steps with 50000 reset in 109 ms.
Computed a total of 34 stabilizing places and 34 stable transitions
Computed a total of 34 stabilizing places and 34 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-003B-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-003B-LTLFireability-02 finished in 691 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(((F(p0) U p1)&&X(X((p2&&F(!p1)))))))'
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 129/129 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 120 transition count 120
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 120 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 119 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 119 transition count 119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 118 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 118 transition count 118
Applied a total of 22 rules in 15 ms. Remains 118 /129 variables (removed 11) and now considering 118/129 (removed 11) transitions.
[2023-03-18 20:21:32] [INFO ] Invariant cache hit.
[2023-03-18 20:21:32] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-18 20:21:32] [INFO ] Invariant cache hit.
[2023-03-18 20:21:32] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2023-03-18 20:21:32] [INFO ] Invariant cache hit.
[2023-03-18 20:21:32] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 118/129 places, 118/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 238 ms. Remains : 118/129 places, 118/129 transitions.
Stuttering acceptance computed with spot in 603 ms :[true, (NOT p0), (NOT p1), (OR (NOT p2) p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p1) (NOT p2)), (OR (NOT p2) p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND p1 (NOT p0)), p1]
Running random walk in product with property : ShieldRVt-PT-003B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(NOT p1), acceptance={} source=3 dest: 6}, { cond=true, acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=5 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=7 dest: 6}, { cond=(NOT p2), acceptance={} source=7 dest: 7}, { cond=(AND p1 p2), acceptance={} source=7 dest: 10}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=8 dest: 5}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=8 dest: 8}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=8 dest: 9}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=9 dest: 9}], [{ cond=p1, acceptance={} source=10 dest: 10}]], initial=0, aps=[p1:(NEQ s78 1), p0:(EQ s9 1), p2:(EQ s32 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 32641 steps with 172 reset in 62 ms.
FORMULA ShieldRVt-PT-003B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-003B-LTLFireability-03 finished in 937 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 129/129 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 128 transition count 92
Reduce places removed 36 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 38 rules applied. Total rules applied 74 place count 92 transition count 90
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 76 place count 90 transition count 90
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 76 place count 90 transition count 73
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 110 place count 73 transition count 73
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 115 place count 68 transition count 68
Iterating global reduction 3 with 5 rules applied. Total rules applied 120 place count 68 transition count 68
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 120 place count 68 transition count 64
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 128 place count 64 transition count 64
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 178 place count 39 transition count 39
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 179 place count 39 transition count 38
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 4 with 2 rules applied. Total rules applied 181 place count 38 transition count 37
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 195 place count 31 transition count 42
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 197 place count 29 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 198 place count 28 transition count 40
Applied a total of 198 rules in 17 ms. Remains 28 /129 variables (removed 101) and now considering 40/129 (removed 89) transitions.
// Phase 1: matrix 40 rows 28 cols
[2023-03-18 20:21:33] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-18 20:21:33] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-18 20:21:33] [INFO ] Invariant cache hit.
[2023-03-18 20:21:33] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2023-03-18 20:21:33] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 20:21:33] [INFO ] Invariant cache hit.
[2023-03-18 20:21:33] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/129 places, 40/129 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 152 ms. Remains : 28/129 places, 40/129 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-003B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s5 0), p1:(AND (OR (EQ s19 0) (EQ s5 0)) (EQ s19 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-003B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-003B-LTLFireability-04 finished in 292 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)))'
Support contains 5 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 129/129 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 128 transition count 95
Reduce places removed 33 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 34 rules applied. Total rules applied 67 place count 95 transition count 94
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 94 transition count 94
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 68 place count 94 transition count 74
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 108 place count 74 transition count 74
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 113 place count 69 transition count 69
Iterating global reduction 3 with 5 rules applied. Total rules applied 118 place count 69 transition count 69
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 118 place count 69 transition count 66
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 124 place count 66 transition count 66
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 174 place count 41 transition count 41
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 175 place count 41 transition count 40
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 4 with 2 rules applied. Total rules applied 177 place count 40 transition count 39
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 191 place count 33 transition count 44
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 193 place count 31 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 194 place count 30 transition count 42
Applied a total of 194 rules in 14 ms. Remains 30 /129 variables (removed 99) and now considering 42/129 (removed 87) transitions.
// Phase 1: matrix 42 rows 30 cols
[2023-03-18 20:21:33] [INFO ] Computed 12 place invariants in 0 ms
[2023-03-18 20:21:33] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-18 20:21:33] [INFO ] Invariant cache hit.
[2023-03-18 20:21:33] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2023-03-18 20:21:33] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 20:21:33] [INFO ] Invariant cache hit.
[2023-03-18 20:21:33] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/129 places, 42/129 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 127 ms. Remains : 30/129 places, 42/129 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-003B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s12 1) (EQ s6 1) (AND (EQ s1 1) (EQ s5 1) (EQ s15 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-003B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-003B-LTLFireability-05 finished in 212 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||F(p1)) U G((p2&&X(!p1)))))'
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 129/129 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 128 transition count 93
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 71 place count 93 transition count 92
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 92 transition count 92
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 72 place count 92 transition count 74
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 108 place count 74 transition count 74
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 112 place count 70 transition count 70
Iterating global reduction 3 with 4 rules applied. Total rules applied 116 place count 70 transition count 70
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 116 place count 70 transition count 67
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 122 place count 67 transition count 67
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 176 place count 40 transition count 40
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 192 place count 32 transition count 47
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 194 place count 30 transition count 45
Applied a total of 194 rules in 13 ms. Remains 30 /129 variables (removed 99) and now considering 45/129 (removed 84) transitions.
// Phase 1: matrix 45 rows 30 cols
[2023-03-18 20:21:34] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-18 20:21:34] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-18 20:21:34] [INFO ] Invariant cache hit.
[2023-03-18 20:21:34] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2023-03-18 20:21:34] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 20:21:34] [INFO ] Invariant cache hit.
[2023-03-18 20:21:34] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/129 places, 45/129 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 138 ms. Remains : 30/129 places, 45/129 transitions.
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p2) p1), (NOT p1), p1, (AND (NOT p1) (NOT p2) p0)]
Running random walk in product with property : ShieldRVt-PT-003B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={0} source=0 dest: 2}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 0}, { cond=(AND p2 p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s16 1), p0:(EQ s20 1), p1:(EQ s21 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-003B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-003B-LTLFireability-06 finished in 345 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)||(F(p1)&&G(F(p2))))))'
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 129/129 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 120 transition count 120
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 120 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 119 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 119 transition count 119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 118 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 118 transition count 118
Applied a total of 22 rules in 4 ms. Remains 118 /129 variables (removed 11) and now considering 118/129 (removed 11) transitions.
// Phase 1: matrix 118 rows 118 cols
[2023-03-18 20:21:34] [INFO ] Computed 13 place invariants in 3 ms
[2023-03-18 20:21:34] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-18 20:21:34] [INFO ] Invariant cache hit.
[2023-03-18 20:21:34] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2023-03-18 20:21:34] [INFO ] Invariant cache hit.
[2023-03-18 20:21:34] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 118/129 places, 118/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 242 ms. Remains : 118/129 places, 118/129 transitions.
Stuttering acceptance computed with spot in 180 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldRVt-PT-003B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s73 1) (EQ s101 1)), p1:(EQ s73 1), p2:(EQ s97 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1836 reset in 171 ms.
Stack based approach found an accepted trace after 285 steps with 3 reset with depth 58 and stack size 58 in 1 ms.
FORMULA ShieldRVt-PT-003B-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-003B-LTLFireability-08 finished in 621 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&G(p1)) U X(X(G(!p0)))))'
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 129/129 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 120 transition count 120
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 120 transition count 120
Applied a total of 18 rules in 8 ms. Remains 120 /129 variables (removed 9) and now considering 120/129 (removed 9) transitions.
// Phase 1: matrix 120 rows 120 cols
[2023-03-18 20:21:35] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-18 20:21:35] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-18 20:21:35] [INFO ] Invariant cache hit.
[2023-03-18 20:21:35] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2023-03-18 20:21:35] [INFO ] Invariant cache hit.
[2023-03-18 20:21:35] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 120/129 places, 120/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 246 ms. Remains : 120/129 places, 120/129 transitions.
Stuttering acceptance computed with spot in 300 ms :[p0, (AND (NOT p1) p0), p0, p0, true, (AND p0 (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-003B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 5}, { cond=(AND p0 p1), acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=2, aps=[p1:(EQ s35 1), p0:(NEQ s94 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-003B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-003B-LTLFireability-09 finished in 581 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)||G((p1||(p2 U (G(p2)||(p2&&G(p3))))))))'
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 129/129 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 120 transition count 120
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 120 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 119 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 119 transition count 119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 118 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 118 transition count 118
Applied a total of 22 rules in 9 ms. Remains 118 /129 variables (removed 11) and now considering 118/129 (removed 11) transitions.
// Phase 1: matrix 118 rows 118 cols
[2023-03-18 20:21:35] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-18 20:21:35] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-18 20:21:35] [INFO ] Invariant cache hit.
[2023-03-18 20:21:35] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2023-03-18 20:21:35] [INFO ] Invariant cache hit.
[2023-03-18 20:21:35] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 118/129 places, 118/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 244 ms. Remains : 118/129 places, 118/129 transitions.
Stuttering acceptance computed with spot in 379 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (NOT p3) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldRVt-PT-003B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p3 p2), acceptance={} source=2 dest: 4}, { cond=p1, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=3 dest: 6}, { cond=(AND p3 p2 (NOT p0)), acceptance={} source=3 dest: 7}], [{ cond=(OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p0))), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=4 dest: 6}, { cond=(AND p3 p2 (NOT p0)), acceptance={} source=4 dest: 7}, { cond=(AND p1 p3 (NOT p2) (NOT p0)), acceptance={} source=4 dest: 9}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p1) (NOT p3) p2 (NOT p0)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p1) p3 p2 (NOT p0)), acceptance={} source=5 dest: 7}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 8}], [{ cond=(NOT p2), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={} source=6 dest: 6}, { cond=(AND p3 p2), acceptance={} source=6 dest: 7}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p3) (NOT p2))), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={} source=7 dest: 6}, { cond=(AND p3 p2), acceptance={} source=7 dest: 7}, { cond=(AND p1 p3 (NOT p2)), acceptance={} source=7 dest: 9}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=8 dest: 0}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p1) p3 p2), acceptance={} source=8 dest: 7}, { cond=p1, acceptance={} source=8 dest: 8}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (NOT p3)), acceptance={} source=9 dest: 0}, { cond=(OR (AND p1 p3) (AND p3 p2)), acceptance={} source=9 dest: 9}]], initial=2, aps=[p0:(EQ s19 1), p1:(EQ s110 0), p2:(NEQ s70 1), p3:(NEQ s110 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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 24 reset in 160 ms.
Product exploration explored 100000 steps with 12 reset in 231 ms.
Computed a total of 34 stabilizing places and 34 stable transitions
Computed a total of 34 stabilizing places and 34 stable transitions
Detected a total of 34/118 stabilizing places and 34/118 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 p2 p3), (X (NOT (AND (NOT p1) p3 p2 (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X (NOT (AND p1 p3 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3) p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (AND p3 p2 (NOT p0))), (X (NOT (AND (NOT p3) p2 (NOT p0)))), (X (NOT (OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p0))))), true, (X (X (NOT (AND (NOT p1) p3 p2)))), (X (X (OR (AND p1 p3) (AND p3 p2)))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 p3 (NOT p2))))), (X (X (AND p3 p2))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p3) (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (NOT p3))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 26 factoid took 1375 ms. Reduced automaton from 10 states, 30 edges and 4 AP (stutter sensitive) to 6 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[true, (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2)))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 11) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) 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 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-18 20:21:38] [INFO ] Invariant cache hit.
[2023-03-18 20:21:38] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-18 20:21:38] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 20:21:38] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-18 20:21:38] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-18 20:21:38] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 4 ms to minimize.
[2023-03-18 20:21:38] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2023-03-18 20:21:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 113 ms
[2023-03-18 20:21:38] [INFO ] After 162ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-18 20:21:38] [INFO ] After 228ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 118/118 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 118 transition count 89
Reduce places removed 29 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 30 rules applied. Total rules applied 59 place count 89 transition count 88
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 88 transition count 88
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 60 place count 88 transition count 63
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 110 place count 63 transition count 63
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 160 place count 38 transition count 38
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 161 place count 38 transition count 37
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 4 with 2 rules applied. Total rules applied 163 place count 37 transition count 36
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 177 place count 30 transition count 41
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 178 place count 30 transition count 40
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 179 place count 29 transition count 39
Applied a total of 179 rules in 11 ms. Remains 29 /118 variables (removed 89) and now considering 39/118 (removed 79) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 29/118 places, 39/118 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Probably explored full state space saw : 8194 states, properties seen :0
Probabilistic random walk after 59396 steps, saw 8194 distinct states, run finished after 139 ms. (steps per millisecond=427 ) properties seen :0
Explored full state space saw : 8194 states, properties seen :0
Exhaustive walk after 59396 steps, saw 8194 distinct states, run finished after 110 ms. (steps per millisecond=539 ) properties seen :0
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 p2 p3), (X (NOT (AND (NOT p1) p3 p2 (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X (NOT (AND p1 p3 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3) p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (AND p3 p2 (NOT p0))), (X (NOT (AND (NOT p3) p2 (NOT p0)))), (X (NOT (OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p0))))), true, (X (X (NOT (AND (NOT p1) p3 p2)))), (X (X (OR (AND p1 p3) (AND p3 p2)))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 p3 (NOT p2))))), (X (X (AND p3 p2))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p3) (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (NOT p3))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3)))), (G (NOT (AND (NOT p2) (NOT p1)))), (G (NOT (AND p2 p3 (NOT p1)))), (G (NOT (OR (AND (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(F (AND p2 (NOT p3) (NOT p1))), (F (NOT p1)), (F (NOT p2)), (F (NOT (AND p2 p3))), (F (AND p2 (NOT p3))), (F (AND (NOT p2) p3 p1)), (F (NOT (OR (AND p2 p3) (AND p3 p1)))), (F (OR (AND (NOT p2) (NOT p1)) (NOT p3)))]
Knowledge based reduction with 29 factoid took 1203 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[true, (AND (NOT p2) (NOT p3) (NOT p1)), (NOT p2), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1))]
Stuttering acceptance computed with spot in 241 ms :[true, (AND (NOT p2) (NOT p3) (NOT p1)), (NOT p2), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1))]
Support contains 2 out of 118 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 118/118 transitions.
Applied a total of 0 rules in 2 ms. Remains 118 /118 variables (removed 0) and now considering 118/118 (removed 0) transitions.
[2023-03-18 20:21:40] [INFO ] Invariant cache hit.
[2023-03-18 20:21:40] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-18 20:21:40] [INFO ] Invariant cache hit.
[2023-03-18 20:21:41] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
[2023-03-18 20:21:41] [INFO ] Invariant cache hit.
[2023-03-18 20:21:41] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 339 ms. Remains : 118/118 places, 118/118 transitions.
Computed a total of 34 stabilizing places and 34 stable transitions
Computed a total of 34 stabilizing places and 34 stable transitions
Detected a total of 34/118 stabilizing places and 34/118 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 p3 p1), (X (NOT (AND (NOT p3) (NOT p1)))), (X (OR p3 p1)), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (OR p3 p1))), (X (X p2)), (X (X (AND p2 p3))), (X (X (NOT (AND p2 (NOT p3))))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 525 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[true, (AND (NOT p2) (NOT p3) (NOT p1)), (NOT p2), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1))]
Finished random walk after 133 steps, including 0 resets, run visited all 7 properties in 2 ms. (steps per millisecond=66 )
Knowledge obtained : [(AND p2 p3 p1), (X (NOT (AND (NOT p3) (NOT p1)))), (X (OR p3 p1)), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (OR p3 p1))), (X (X p2)), (X (X (AND p2 p3))), (X (X (NOT (AND p2 (NOT p3))))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p1 p3))), (F (NOT p3)), (F (NOT (OR p1 p3))), (F (AND (NOT p1) (NOT p3))), (F (NOT p2)), (F (NOT (AND p2 p3))), (F (AND p2 (NOT p3)))]
Knowledge based reduction with 10 factoid took 496 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[true, (AND (NOT p2) (NOT p3) (NOT p1)), (NOT p2), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1))]
Stuttering acceptance computed with spot in 284 ms :[true, (AND (NOT p2) (NOT p3) (NOT p1)), (NOT p2), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1))]
Stuttering acceptance computed with spot in 286 ms :[true, (AND (NOT p2) (NOT p3) (NOT p1)), (NOT p2), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1))]
Product exploration explored 100000 steps with 22 reset in 180 ms.
Product exploration explored 100000 steps with 17 reset in 189 ms.
Applying partial POR strategy [true, false, false, true, false, false]
Stuttering acceptance computed with spot in 245 ms :[true, (AND (NOT p2) (NOT p3) (NOT p1)), (NOT p2), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1))]
Support contains 2 out of 118 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 118/118 places, 118/118 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 118 transition count 118
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 14 Pre rules applied. Total rules applied 30 place count 118 transition count 130
Deduced a syphon composed of 44 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 44 place count 118 transition count 130
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 77 places in 0 ms
Iterating global reduction 1 with 33 rules applied. Total rules applied 77 place count 118 transition count 130
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 78 place count 118 transition count 129
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 99 place count 97 transition count 108
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 120 place count 97 transition count 108
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 57 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 121 place count 97 transition count 108
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 123 place count 95 transition count 106
Deduced a syphon composed of 55 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 125 place count 95 transition count 106
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -61
Deduced a syphon composed of 65 places in 0 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 135 place count 95 transition count 167
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 145 place count 85 transition count 147
Deduced a syphon composed of 55 places in 0 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 155 place count 85 transition count 147
Deduced a syphon composed of 55 places in 0 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 158 place count 85 transition count 144
Deduced a syphon composed of 55 places in 1 ms
Applied a total of 158 rules in 32 ms. Remains 85 /118 variables (removed 33) and now considering 144/118 (removed -26) transitions.
[2023-03-18 20:21:44] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 144 rows 85 cols
[2023-03-18 20:21:44] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-18 20:21:44] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 85/118 places, 144/118 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 217 ms. Remains : 85/118 places, 144/118 transitions.
Built C files in :
/tmp/ltsmin7188317765255802611
[2023-03-18 20:21:44] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7188317765255802611
Running compilation step : cd /tmp/ltsmin7188317765255802611;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 391 ms.
Running link step : cd /tmp/ltsmin7188317765255802611;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin7188317765255802611;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11126914785442092844.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 118 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 118/118 transitions.
Applied a total of 0 rules in 2 ms. Remains 118 /118 variables (removed 0) and now considering 118/118 (removed 0) transitions.
// Phase 1: matrix 118 rows 118 cols
[2023-03-18 20:21:59] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-18 20:21:59] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-18 20:21:59] [INFO ] Invariant cache hit.
[2023-03-18 20:21:59] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2023-03-18 20:21:59] [INFO ] Invariant cache hit.
[2023-03-18 20:21:59] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 272 ms. Remains : 118/118 places, 118/118 transitions.
Built C files in :
/tmp/ltsmin11053176716171248918
[2023-03-18 20:21:59] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11053176716171248918
Running compilation step : cd /tmp/ltsmin11053176716171248918;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 196 ms.
Running link step : cd /tmp/ltsmin11053176716171248918;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin11053176716171248918;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13570098509453591780.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-18 20:22:14] [INFO ] Flatten gal took : 9 ms
[2023-03-18 20:22:14] [INFO ] Flatten gal took : 8 ms
[2023-03-18 20:22:14] [INFO ] Time to serialize gal into /tmp/LTL7027728583966892478.gal : 3 ms
[2023-03-18 20:22:14] [INFO ] Time to serialize properties into /tmp/LTL5498526693646529516.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7027728583966892478.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11118551377348867433.hoa' '-atoms' '/tmp/LTL5498526693646529516.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL5498526693646529516.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11118551377348867433.hoa
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t21, t25, t31, t34, t40, t44, t49, t55, t60, t65, t68, t72, t78, t84, t89, ...295
Computing Next relation with stutter on 53 deadlock states
Detected timeout of ITS tools.
[2023-03-18 20:22:30] [INFO ] Flatten gal took : 5 ms
[2023-03-18 20:22:30] [INFO ] Flatten gal took : 4 ms
[2023-03-18 20:22:30] [INFO ] Time to serialize gal into /tmp/LTL8526015486644366383.gal : 2 ms
[2023-03-18 20:22:30] [INFO ] Time to serialize properties into /tmp/LTL9941074802684291083.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8526015486644366383.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9941074802684291083.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((X("(p22==1)"))||(G(("(p142==0)")||(("(p87!=1)")U((G("(p87!=1)"))||(("(p87!=1)")&&(G("(p142!=1)")))))))))
Formula 0 simplified : X!"(p22==1)" & F(!"(p142==0)" & (F!"(p142!=1)" U !"(p87!=1)"))
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t21, t25, t31, t34, t40, t44, t49, t55, t60, t65, t68, t72, t78, t84, t89, ...295
Computing Next relation with stutter on 53 deadlock states
Detected timeout of ITS tools.
[2023-03-18 20:22:45] [INFO ] Flatten gal took : 5 ms
[2023-03-18 20:22:45] [INFO ] Applying decomposition
[2023-03-18 20:22:45] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph12494710317978592101.txt' '-o' '/tmp/graph12494710317978592101.bin' '-w' '/tmp/graph12494710317978592101.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12494710317978592101.bin' '-l' '-1' '-v' '-w' '/tmp/graph12494710317978592101.weights' '-q' '0' '-e' '0.001'
[2023-03-18 20:22:45] [INFO ] Decomposing Gal with order
[2023-03-18 20:22:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 20:22:45] [INFO ] Removed a total of 33 redundant transitions.
[2023-03-18 20:22:45] [INFO ] Flatten gal took : 48 ms
[2023-03-18 20:22:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2023-03-18 20:22:45] [INFO ] Time to serialize gal into /tmp/LTL8308701320526498564.gal : 2 ms
[2023-03-18 20:22:45] [INFO ] Time to serialize properties into /tmp/LTL15432155383965899677.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8308701320526498564.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15432155383965899677.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((X("(i1.u7.p22==1)"))||(G(("(i12.u44.p142==0)")||(("(i8.u27.p87!=1)")U((G("(i8.u27.p87!=1)"))||(("(i8.u27.p87!=1)")&&(G("(i12.u44.p...172
Formula 0 simplified : X!"(i1.u7.p22==1)" & F(!"(i12.u44.p142==0)" & (F!"(i12.u44.p142!=1)" U !"(i8.u27.p87!=1)"))
Reverse transition relation is NOT exact ! Due to transitions t118, t121, i0.i0.u1.t114, i1.t103, i2.t106, i2.u5.t111, i3.t89, i3.u12.t93, i4.t84, i4.u14.t...416
Computing Next relation with stutter on 53 deadlock states
5892 unique states visited
0 strongly connected components in search stack
11600 transitions explored
49 items max in DFS search stack
1459 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,14.6148,549276,1,0,1.20162e+06,356,1742,1.41396e+06,199,1059,1892296
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldRVt-PT-003B-LTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ShieldRVt-PT-003B-LTLFireability-11 finished in 84703 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)))'
Support contains 1 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 129/129 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 121 transition count 121
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 121 transition count 121
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 120 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 120 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 119 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 119 transition count 119
Applied a total of 20 rules in 5 ms. Remains 119 /129 variables (removed 10) and now considering 119/129 (removed 10) transitions.
// Phase 1: matrix 119 rows 119 cols
[2023-03-18 20:23:00] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-18 20:23:00] [INFO ] Implicit Places using invariants in 322 ms returned []
[2023-03-18 20:23:00] [INFO ] Invariant cache hit.
[2023-03-18 20:23:00] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
[2023-03-18 20:23:00] [INFO ] Invariant cache hit.
[2023-03-18 20:23:00] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 119/129 places, 119/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 557 ms. Remains : 119/129 places, 119/129 transitions.
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-003B-LTLFireability-12 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: 2}]], initial=1, aps=[p0:(EQ s38 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-003B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-003B-LTLFireability-12 finished in 703 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(X((X(X(!(G(p0) U !p1)))&&F(p2)))))'
Support contains 7 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 129/129 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 121 transition count 121
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 121 transition count 121
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 120 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 120 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 119 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 119 transition count 119
Applied a total of 20 rules in 7 ms. Remains 119 /129 variables (removed 10) and now considering 119/129 (removed 10) transitions.
// Phase 1: matrix 119 rows 119 cols
[2023-03-18 20:23:01] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-18 20:23:01] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-18 20:23:01] [INFO ] Invariant cache hit.
[2023-03-18 20:23:01] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
[2023-03-18 20:23:01] [INFO ] Invariant cache hit.
[2023-03-18 20:23:01] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 119/129 places, 119/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 380 ms. Remains : 119/129 places, 119/129 transitions.
Stuttering acceptance computed with spot in 335 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) p0)]
Running random walk in product with property : ShieldRVt-PT-003B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}, { cond=(NOT p2), acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND p0 p1), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=6 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p2) p0), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p2:(AND (EQ s52 1) (EQ s93 1) (EQ s118 1)), p1:(AND (EQ s17 1) (EQ s21 1) (EQ s34 1)), p0:(EQ s44 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]]
Stuttering criterion allowed to conclude after 35353 steps with 122 reset in 67 ms.
FORMULA ShieldRVt-PT-003B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-003B-LTLFireability-14 finished in 824 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(p0)||F(((F(p1) U p2)&&G(p3)))))'
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 129/129 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 128 transition count 91
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 74 place count 91 transition count 91
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 74 place count 91 transition count 73
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 110 place count 73 transition count 73
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 113 place count 70 transition count 70
Iterating global reduction 2 with 3 rules applied. Total rules applied 116 place count 70 transition count 70
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 116 place count 70 transition count 68
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 120 place count 68 transition count 68
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 174 place count 41 transition count 41
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 175 place count 41 transition count 40
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 3 with 2 rules applied. Total rules applied 177 place count 40 transition count 39
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 193 place count 32 transition count 46
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 195 place count 30 transition count 44
Applied a total of 195 rules in 20 ms. Remains 30 /129 variables (removed 99) and now considering 44/129 (removed 85) transitions.
// Phase 1: matrix 44 rows 30 cols
[2023-03-18 20:23:01] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-18 20:23:01] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-18 20:23:01] [INFO ] Invariant cache hit.
[2023-03-18 20:23:01] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-18 20:23:01] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2023-03-18 20:23:01] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 20:23:01] [INFO ] Invariant cache hit.
[2023-03-18 20:23:02] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/129 places, 44/129 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 172 ms. Remains : 30/129 places, 44/129 transitions.
Stuttering acceptance computed with spot in 402 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : ShieldRVt-PT-003B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p3)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1) p3), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p3), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) p3), acceptance={} source=0 dest: 4}, { cond=(AND p0 (NOT p2) (NOT p1) p3), acceptance={} source=0 dest: 5}, { cond=(AND p0 (NOT p2) p3), acceptance={} source=0 dest: 6}, { cond=(AND p0 p3), acceptance={} source=0 dest: 7}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p3), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p3), acceptance={} source=1 dest: 3}, { cond=p3, acceptance={} source=1 dest: 4}], [{ cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p1) (NOT p3))), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p1) p3), acceptance={} source=2 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 1}, { cond=p3, acceptance={} source=4 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p1) (NOT p3))), acceptance={} source=5 dest: 2}, { cond=(OR (AND p0 (NOT p2) (NOT p1)) (AND p0 (NOT p1) (NOT p3))), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) p2 (NOT p1) p3), acceptance={} source=5 dest: 8}, { cond=(AND p0 p2 (NOT p1) p3), acceptance={} source=5 dest: 9}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 6}], [{ cond=(AND p0 (NOT p3)), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p0) p3), acceptance={} source=7 dest: 4}, { cond=(AND p0 p3), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=8 dest: 2}, { cond=(AND (NOT p1) p3), acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=9 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=9 dest: 5}, { cond=(AND (NOT p0) (NOT p1) p3), acceptance={} source=9 dest: 8}, { cond=(AND p0 (NOT p1) p3), acceptance={} source=9 dest: 9}]], initial=0, aps=[p0:(EQ s18 0), p3:(EQ s18 1), p2:(EQ s15 1), p1:(EQ s22 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-003B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-003B-LTLFireability-15 finished in 596 ms.
All properties solved by simple procedures.
Total runtime 93603 ms.

BK_STOP 1679170982654

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-003B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is ShieldRVt-PT-003B, 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 r421-tajo-167905974900220"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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