Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r373-tall-171683789700598.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is ShieldRVt-PT-005B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683789700598
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Apr 11 21:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 11 21:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 11 21:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 11 21:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 60K May 18 16:43 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-005B-LTLFireability-00
FORMULA_NAME ShieldRVt-PT-005B-LTLFireability-01
FORMULA_NAME ShieldRVt-PT-005B-LTLFireability-02
FORMULA_NAME ShieldRVt-PT-005B-LTLFireability-03
FORMULA_NAME ShieldRVt-PT-005B-LTLFireability-04
FORMULA_NAME ShieldRVt-PT-005B-LTLFireability-05
FORMULA_NAME ShieldRVt-PT-005B-LTLFireability-06
FORMULA_NAME ShieldRVt-PT-005B-LTLFireability-07
FORMULA_NAME ShieldRVt-PT-005B-LTLFireability-08
FORMULA_NAME ShieldRVt-PT-005B-LTLFireability-09
FORMULA_NAME ShieldRVt-PT-005B-LTLFireability-10
FORMULA_NAME ShieldRVt-PT-005B-LTLFireability-11
FORMULA_NAME ShieldRVt-PT-005B-LTLFireability-12
FORMULA_NAME ShieldRVt-PT-005B-LTLFireability-13
FORMULA_NAME ShieldRVt-PT-005B-LTLFireability-14
FORMULA_NAME ShieldRVt-PT-005B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717013091248

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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-005B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-29 20:04:53] [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]
[2024-05-29 20:04:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 20:04:53] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2024-05-29 20:04:53] [INFO ] Transformed 253 places.
[2024-05-29 20:04:53] [INFO ] Transformed 253 transitions.
[2024-05-29 20:04:53] [INFO ] Found NUPN structural information;
[2024-05-29 20:04:53] [INFO ] Parsed PT model containing 253 places and 253 transitions and 596 arcs in 130 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 5 formulas.
FORMULA ShieldRVt-PT-005B-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-005B-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-005B-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-005B-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-005B-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 253/253 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 210 transition count 210
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 210 transition count 210
Applied a total of 86 rules in 38 ms. Remains 210 /253 variables (removed 43) and now considering 210/253 (removed 43) transitions.
// Phase 1: matrix 210 rows 210 cols
[2024-05-29 20:04:53] [INFO ] Computed 21 invariants in 13 ms
[2024-05-29 20:04:53] [INFO ] Implicit Places using invariants in 217 ms returned []
[2024-05-29 20:04:53] [INFO ] Invariant cache hit.
[2024-05-29 20:04:53] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
[2024-05-29 20:04:53] [INFO ] Invariant cache hit.
[2024-05-29 20:04:54] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 210/253 places, 210/253 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 587 ms. Remains : 210/253 places, 210/253 transitions.
Support contains 30 out of 210 places after structural reductions.
[2024-05-29 20:04:54] [INFO ] Flatten gal took : 38 ms
[2024-05-29 20:04:54] [INFO ] Flatten gal took : 16 ms
[2024-05-29 20:04:54] [INFO ] Input system was already deterministic with 210 transitions.
Finished random walk after 964 steps, including 0 resets, run visited all 30 properties in 66 ms. (steps per millisecond=14 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 64 stabilizing places and 64 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&F(((p2 U p3)||p1)))))'
Support contains 6 out of 210 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 210/210 places, 210/210 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 198 transition count 198
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 198 transition count 198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 197 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 197 transition count 197
Applied a total of 26 rules in 16 ms. Remains 197 /210 variables (removed 13) and now considering 197/210 (removed 13) transitions.
// Phase 1: matrix 197 rows 197 cols
[2024-05-29 20:04:54] [INFO ] Computed 21 invariants in 3 ms
[2024-05-29 20:04:54] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-29 20:04:54] [INFO ] Invariant cache hit.
[2024-05-29 20:04:54] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2024-05-29 20:04:54] [INFO ] Invariant cache hit.
[2024-05-29 20:04:55] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 197/210 places, 197/210 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 289 ms. Remains : 197/210 places, 197/210 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 273 ms :[(NOT p0), (OR (NOT p0) (AND (NOT p1) (NOT p3))), true, (OR (NOT p0) (AND (NOT p1) (NOT p3)))]
Running random walk in product with property : ShieldRVt-PT-005B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(OR (AND p0 p1) (AND p0 p3)), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(OR (EQ s91 0) (EQ s134 0) (EQ s160 0)), p1:(OR (NEQ s65 1) (NEQ s79 1)), p3:(EQ s119 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 649 steps with 0 reset in 10 ms.
FORMULA ShieldRVt-PT-005B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-005B-LTLFireability-00 finished in 638 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (G(p0)||p1)) U (G((p0 U (p1||G(p0))))||(X(p2)&&(p0 U (p1||G(p0)))))))'
Support contains 3 out of 210 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 210/210 places, 210/210 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 199 transition count 199
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 199 transition count 199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 198 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 198 transition count 198
Applied a total of 24 rules in 16 ms. Remains 198 /210 variables (removed 12) and now considering 198/210 (removed 12) transitions.
// Phase 1: matrix 198 rows 198 cols
[2024-05-29 20:04:55] [INFO ] Computed 21 invariants in 2 ms
[2024-05-29 20:04:55] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-29 20:04:55] [INFO ] Invariant cache hit.
[2024-05-29 20:04:55] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2024-05-29 20:04:55] [INFO ] Invariant cache hit.
[2024-05-29 20:04:55] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 198/210 places, 198/210 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 290 ms. Remains : 198/210 places, 198/210 transitions.
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-005B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR p0 p1), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(NEQ s15 1), p1:(AND (NEQ s176 1) (NEQ s15 1)), p2:(NEQ s76 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 262 ms.
Product exploration explored 100000 steps with 50000 reset in 211 ms.
Computed a total of 59 stabilizing places and 59 stable transitions
Computed a total of 59 stabilizing places and 59 stable transitions
Detected a total of 59/198 stabilizing places and 59/198 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p0 (NOT p1)))), (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 25 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-005B-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-005B-LTLFireability-03 finished in 956 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0||F(p1)) U p2)||X(G(p3))))'
Support contains 3 out of 210 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 210/210 places, 210/210 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 199 transition count 199
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 199 transition count 199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 198 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 198 transition count 198
Applied a total of 24 rules in 12 ms. Remains 198 /210 variables (removed 12) and now considering 198/210 (removed 12) transitions.
// Phase 1: matrix 198 rows 198 cols
[2024-05-29 20:04:56] [INFO ] Computed 21 invariants in 1 ms
[2024-05-29 20:04:56] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-29 20:04:56] [INFO ] Invariant cache hit.
[2024-05-29 20:04:56] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2024-05-29 20:04:56] [INFO ] Invariant cache hit.
[2024-05-29 20:04:56] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 198/210 places, 198/210 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 313 ms. Remains : 198/210 places, 198/210 transitions.
Stuttering acceptance computed with spot in 230 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldRVt-PT-005B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p3), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1) p3), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p3), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s125 1), p0:(EQ s99 1), p1:(NEQ s138 1), p3:(EQ s138 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 6497 reset in 194 ms.
Product exploration explored 100000 steps with 6606 reset in 190 ms.
Computed a total of 58 stabilizing places and 58 stable transitions
Computed a total of 58 stabilizing places and 58 stable transitions
Detected a total of 58/198 stabilizing places and 58/198 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1 p3), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) p3))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (AND (NOT p2) p3)), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) p3)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p1) p3)))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 146 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter sensitive) to 13 states, 37 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 616 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1), (NOT p2), false, false, false, false, false, false, false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 347 ms. (steps per millisecond=28 ) properties (out of 18) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2024-05-29 20:04:58] [INFO ] Invariant cache hit.
[2024-05-29 20:04:58] [INFO ] [Real]Absence check using 21 positive place invariants in 4 ms returned sat
[2024-05-29 20:04:58] [INFO ] After 54ms SMT Verify possible using state equation in real domain returned unsat :6 sat :1 real:2
[2024-05-29 20:04:58] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 4 ms to minimize.
[2024-05-29 20:04:59] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 0 ms to minimize.
[2024-05-29 20:04:59] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-29 20:04:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 183 ms
[2024-05-29 20:04:59] [INFO ] After 249ms SMT Verify possible using trap constraints in real domain returned unsat :6 sat :0 real:3
[2024-05-29 20:04:59] [INFO ] After 344ms SMT Verify possible using all constraints in real domain returned unsat :6 sat :0 real:3
[2024-05-29 20:04:59] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2024-05-29 20:04:59] [INFO ] After 60ms SMT Verify possible using state equation in natural domain returned unsat :8 sat :1
[2024-05-29 20:04:59] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-29 20:04:59] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 0 ms to minimize.
[2024-05-29 20:04:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 126 ms
[2024-05-29 20:04:59] [INFO ] After 198ms SMT Verify possible using trap constraints in natural domain returned unsat :8 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2024-05-29 20:04:59] [INFO ] After 267ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :1
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 198/198 transitions.
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 198 transition count 145
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 1 with 53 rules applied. Total rules applied 106 place count 145 transition count 145
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 106 place count 145 transition count 106
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 184 place count 106 transition count 106
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 274 place count 61 transition count 61
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 275 place count 61 transition count 60
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 277 place count 60 transition count 59
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 305 place count 46 transition count 72
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 306 place count 46 transition count 71
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 307 place count 45 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 308 place count 44 transition count 70
Applied a total of 308 rules in 33 ms. Remains 44 /198 variables (removed 154) and now considering 70/198 (removed 128) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 44/198 places, 70/198 transitions.
Incomplete random walk after 10000 steps, including 9 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2424344 steps, run timeout after 3001 ms. (steps per millisecond=807 ) properties seen :{}
Probabilistic random walk after 2424344 steps, saw 529152 distinct states, run finished after 3002 ms. (steps per millisecond=807 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 70 rows 44 cols
[2024-05-29 20:05:02] [INFO ] Computed 20 invariants in 2 ms
[2024-05-29 20:05:02] [INFO ] [Real]Absence check using 20 positive place invariants in 3 ms returned sat
[2024-05-29 20:05:02] [INFO ] After 18ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-29 20:05:02] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-29 20:05:02] [INFO ] After 4ms SMT Verify possible using 10 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 20:05:02] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 20:05:02] [INFO ] [Nat]Absence check using 20 positive place invariants in 2 ms returned sat
[2024-05-29 20:05:02] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 20:05:02] [INFO ] After 5ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 20:05:02] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-29 20:05:02] [INFO ] After 64ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 44 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 44/44 places, 70/70 transitions.
Applied a total of 0 rules in 3 ms. Remains 44 /44 variables (removed 0) and now considering 70/70 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 44/44 places, 70/70 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 44/44 places, 70/70 transitions.
Applied a total of 0 rules in 2 ms. Remains 44 /44 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2024-05-29 20:05:02] [INFO ] Invariant cache hit.
[2024-05-29 20:05:02] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-29 20:05:02] [INFO ] Invariant cache hit.
[2024-05-29 20:05:02] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-29 20:05:02] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2024-05-29 20:05:02] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 20:05:02] [INFO ] Invariant cache hit.
[2024-05-29 20:05:02] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 44/44 places, 70/70 transitions.
Graph (trivial) has 19 edges and 44 vertex of which 4 / 44 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 126 edges and 42 vertex of which 40 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 16 edges and 38 vertex of which 4 / 38 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 36 transition count 61
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 36 transition count 56
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 2 with 2 rules applied. Total rules applied 15 place count 35 transition count 55
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 21 place count 35 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 34 transition count 49
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 25 place count 32 transition count 48
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 29 place count 32 transition count 44
Applied a total of 29 rules in 12 ms. Remains 32 /44 variables (removed 12) and now considering 44/70 (removed 26) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 44 rows 32 cols
[2024-05-29 20:05:02] [INFO ] Computed 15 invariants in 0 ms
[2024-05-29 20:05:02] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2024-05-29 20:05:02] [INFO ] After 12ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-29 20:05:02] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 20:05:02] [INFO ] After 3ms SMT Verify possible using 4 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 20:05:02] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 20:05:02] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2024-05-29 20:05:02] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 20:05:02] [INFO ] After 3ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 20:05:02] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-29 20:05:02] [INFO ] After 49ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 8 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1 p3), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) p3))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (AND (NOT p2) p3)), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) p3)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p1) p3)))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3))))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (G (NOT (AND p0 (NOT p1) p2 p3))), (G (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (G (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (G (NOT (AND (NOT p1) p3))), (G (NOT (AND (NOT p0) (NOT p1) p2 p3))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2) p3))), (G (NOT (AND p0 p1 p2 (NOT p3))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 p2 p3)), (F (NOT p1)), (F (NOT (AND (NOT p2) p3))), (F (AND (NOT p2) (NOT p3))), (F (AND (NOT p1) (NOT p3))), (F p2), (F (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT (OR p2 p3)))]
Knowledge based reduction with 25 factoid took 530 ms. Reduced automaton from 13 states, 37 edges and 4 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 273 ms :[(NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), false, false, false]
Stuttering acceptance computed with spot in 248 ms :[(NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), false, false, false]
Support contains 2 out of 198 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 198/198 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 197 transition count 144
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 1 with 53 rules applied. Total rules applied 106 place count 144 transition count 144
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 106 place count 144 transition count 105
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 184 place count 105 transition count 105
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 270 place count 62 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 271 place count 62 transition count 61
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 273 place count 61 transition count 60
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 301 place count 47 transition count 73
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 303 place count 45 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 304 place count 44 transition count 71
Applied a total of 304 rules in 28 ms. Remains 44 /198 variables (removed 154) and now considering 71/198 (removed 127) transitions.
// Phase 1: matrix 71 rows 44 cols
[2024-05-29 20:05:03] [INFO ] Computed 20 invariants in 0 ms
[2024-05-29 20:05:03] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-29 20:05:03] [INFO ] Invariant cache hit.
[2024-05-29 20:05:04] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-29 20:05:04] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2024-05-29 20:05:04] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 20:05:04] [INFO ] Invariant cache hit.
[2024-05-29 20:05:04] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/198 places, 71/198 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 187 ms. Remains : 44/198 places, 71/198 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/44 stabilizing places and 2/71 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p3), (X (NOT (AND (NOT p2) (NOT p3)))), (X p3), (X (NOT (AND p2 (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X p3)), (X (X (NOT (AND p2 (NOT p3))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (AND p2 p3)), (X (NOT (AND p2 p3))), (X (AND (NOT p2) p3)), (X (NOT (AND (NOT p2) p3))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p2 p3))), (X (X (NOT (AND p2 p3)))), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p2) p3))))]
Knowledge based reduction with 8 factoid took 518 ms. Reduced automaton from 7 states, 17 edges and 2 AP (stutter insensitive) to 7 states, 18 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 238 ms :[(NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p3)), false, false]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 20:05:04] [INFO ] Invariant cache hit.
[2024-05-29 20:05:04] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 20:05:04] [INFO ] [Nat]Absence check using 20 positive place invariants in 3 ms returned sat
[2024-05-29 20:05:05] [INFO ] After 35ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p3), (X (NOT (AND (NOT p2) (NOT p3)))), (X p3), (X (NOT (AND p2 (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X p3)), (X (X (NOT (AND p2 (NOT p3))))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND p2 (NOT p3))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (AND p2 p3)), (X (NOT (AND p2 p3))), (X (AND (NOT p2) p3)), (X (NOT (AND (NOT p2) p3))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p2 p3))), (X (X (NOT (AND p2 p3)))), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p2) p3)))), (F (NOT (AND (NOT p2) p3))), (F (AND p2 p3)), (F p2), (F (AND (NOT p2) (NOT p3)))]
Knowledge based reduction with 9 factoid took 842 ms. Reduced automaton from 7 states, 18 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 264 ms :[(NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), false, false, false]
Stuttering acceptance computed with spot in 267 ms :[(NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), false, false, false]
Stuttering acceptance computed with spot in 259 ms :[(NOT p2), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), false, false, false]
Product exploration explored 100000 steps with 27895 reset in 163 ms.
Product exploration explored 100000 steps with 27834 reset in 184 ms.
Built C files in :
/tmp/ltsmin1902369886230390019
[2024-05-29 20:05:07] [INFO ] Computing symmetric may disable matrix : 71 transitions.
[2024-05-29 20:05:07] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:05:07] [INFO ] Computing symmetric may enable matrix : 71 transitions.
[2024-05-29 20:05:07] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:05:07] [INFO ] Computing Do-Not-Accords matrix : 71 transitions.
[2024-05-29 20:05:07] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:05:07] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1902369886230390019
Running compilation step : cd /tmp/ltsmin1902369886230390019;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 319 ms.
Running link step : cd /tmp/ltsmin1902369886230390019;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin1902369886230390019;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1996468654694800707.hoa' '--buchi-type=spotba'
LTSmin run took 89 ms.
FORMULA ShieldRVt-PT-005B-LTLFireability-04 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVt-PT-005B-LTLFireability-04 finished in 11219 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(F(p1))))))'
Support contains 2 out of 210 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 210/210 places, 210/210 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 198 transition count 198
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 198 transition count 198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 197 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 197 transition count 197
Applied a total of 26 rules in 11 ms. Remains 197 /210 variables (removed 13) and now considering 197/210 (removed 13) transitions.
// Phase 1: matrix 197 rows 197 cols
[2024-05-29 20:05:07] [INFO ] Computed 21 invariants in 2 ms
[2024-05-29 20:05:07] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-29 20:05:07] [INFO ] Invariant cache hit.
[2024-05-29 20:05:07] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2024-05-29 20:05:07] [INFO ] Invariant cache hit.
[2024-05-29 20:05:07] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 197/210 places, 197/210 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 299 ms. Remains : 197/210 places, 197/210 transitions.
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-005B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s187 1), p1:(EQ s10 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3465 reset in 165 ms.
Product exploration explored 100000 steps with 3540 reset in 278 ms.
Computed a total of 59 stabilizing places and 59 stable transitions
Computed a total of 59 stabilizing places and 59 stable transitions
Detected a total of 59/197 stabilizing places and 59/197 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 143 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Finished random walk after 3384 steps, including 1 resets, run visited all 4 properties in 27 ms. (steps per millisecond=125 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p1) (NOT p0))), (F (AND p1 p0)), (F (AND (NOT p1) p0))]
Knowledge based reduction with 7 factoid took 287 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Stuttering acceptance computed with spot in 238 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Support contains 2 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 197/197 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 196 transition count 144
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 104 place count 144 transition count 144
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 41 Pre rules applied. Total rules applied 104 place count 144 transition count 103
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 186 place count 103 transition count 103
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 268 place count 62 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 269 place count 62 transition count 61
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 271 place count 61 transition count 60
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 299 place count 47 transition count 73
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 301 place count 45 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 302 place count 44 transition count 71
Applied a total of 302 rules in 24 ms. Remains 44 /197 variables (removed 153) and now considering 71/197 (removed 126) transitions.
// Phase 1: matrix 71 rows 44 cols
[2024-05-29 20:05:09] [INFO ] Computed 20 invariants in 1 ms
[2024-05-29 20:05:09] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-29 20:05:09] [INFO ] Invariant cache hit.
[2024-05-29 20:05:09] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-29 20:05:09] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2024-05-29 20:05:09] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 20:05:09] [INFO ] Invariant cache hit.
[2024-05-29 20:05:09] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/197 places, 71/197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 392 ms. Remains : 44/197 places, 71/197 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/44 stabilizing places and 4/71 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (NOT p0)), (X p0), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 6 factoid took 737 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 243 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Finished random walk after 2029 steps, including 1 resets, run visited all 4 properties in 8 ms. (steps per millisecond=253 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (NOT p0)), (X p0), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X p0)), (F p0), (F (AND (NOT p1) (NOT p0))), (F (AND p1 p0)), (F (AND (NOT p1) p0))]
Knowledge based reduction with 6 factoid took 729 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Product exploration explored 100000 steps with 38085 reset in 111 ms.
Product exploration explored 100000 steps with 38117 reset in 120 ms.
Built C files in :
/tmp/ltsmin12046228974865207735
[2024-05-29 20:05:12] [INFO ] Computing symmetric may disable matrix : 71 transitions.
[2024-05-29 20:05:12] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:05:12] [INFO ] Computing symmetric may enable matrix : 71 transitions.
[2024-05-29 20:05:12] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:05:12] [INFO ] Computing Do-Not-Accords matrix : 71 transitions.
[2024-05-29 20:05:12] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:05:12] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12046228974865207735
Running compilation step : cd /tmp/ltsmin12046228974865207735;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 153 ms.
Running link step : cd /tmp/ltsmin12046228974865207735;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin12046228974865207735;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6708300262534211057.hoa' '--buchi-type=spotba'
LTSmin run took 72 ms.
FORMULA ShieldRVt-PT-005B-LTLFireability-05 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVt-PT-005B-LTLFireability-05 finished in 5196 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 2 out of 210 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 210/210 places, 210/210 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 57 place count 209 transition count 152
Reduce places removed 57 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 59 rules applied. Total rules applied 116 place count 152 transition count 150
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 117 place count 151 transition count 150
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 117 place count 151 transition count 117
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 183 place count 118 transition count 117
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 193 place count 108 transition count 107
Iterating global reduction 3 with 10 rules applied. Total rules applied 203 place count 108 transition count 107
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 203 place count 108 transition count 100
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 217 place count 101 transition count 100
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 299 place count 60 transition count 59
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 325 place count 47 transition count 70
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 327 place count 45 transition count 68
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 328 place count 44 transition count 68
Applied a total of 328 rules in 27 ms. Remains 44 /210 variables (removed 166) and now considering 68/210 (removed 142) transitions.
// Phase 1: matrix 68 rows 44 cols
[2024-05-29 20:05:12] [INFO ] Computed 20 invariants in 1 ms
[2024-05-29 20:05:12] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-29 20:05:12] [INFO ] Invariant cache hit.
[2024-05-29 20:05:12] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 20:05:12] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2024-05-29 20:05:12] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 20:05:12] [INFO ] Invariant cache hit.
[2024-05-29 20:05:12] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/210 places, 68/210 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 185 ms. Remains : 44/210 places, 68/210 transitions.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-005B-LTLFireability-07 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=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s31 1), p1:(OR (EQ s23 1) (EQ s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-005B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-005B-LTLFireability-07 finished in 306 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 1 out of 210 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 210/210 places, 210/210 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 197 transition count 197
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 197 transition count 197
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 196 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 196 transition count 196
Applied a total of 28 rules in 11 ms. Remains 196 /210 variables (removed 14) and now considering 196/210 (removed 14) transitions.
// Phase 1: matrix 196 rows 196 cols
[2024-05-29 20:05:13] [INFO ] Computed 21 invariants in 2 ms
[2024-05-29 20:05:13] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-29 20:05:13] [INFO ] Invariant cache hit.
[2024-05-29 20:05:13] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2024-05-29 20:05:13] [INFO ] Invariant cache hit.
[2024-05-29 20:05:13] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 196/210 places, 196/210 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 298 ms. Remains : 196/210 places, 196/210 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-005B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(EQ s110 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 635 reset in 143 ms.
Stack based approach found an accepted trace after 680 steps with 4 reset with depth 90 and stack size 90 in 2 ms.
FORMULA ShieldRVt-PT-005B-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-005B-LTLFireability-08 finished in 590 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F((p1||(p2 U p3)))))'
Support contains 3 out of 210 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 210/210 places, 210/210 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 197 transition count 197
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 197 transition count 197
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 196 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 196 transition count 196
Applied a total of 28 rules in 9 ms. Remains 196 /210 variables (removed 14) and now considering 196/210 (removed 14) transitions.
[2024-05-29 20:05:13] [INFO ] Invariant cache hit.
[2024-05-29 20:05:13] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-29 20:05:13] [INFO ] Invariant cache hit.
[2024-05-29 20:05:13] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2024-05-29 20:05:13] [INFO ] Invariant cache hit.
[2024-05-29 20:05:13] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 196/210 places, 196/210 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 291 ms. Remains : 196/210 places, 196/210 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3)), true]
Running random walk in product with property : ShieldRVt-PT-005B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s84 1), p3:(EQ s183 1), p0:(EQ s97 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 10 steps with 1 reset in 0 ms.
FORMULA ShieldRVt-PT-005B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-005B-LTLFireability-09 finished in 431 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0||X((p1 U (p2||G(p1)))))) U ((p3&&X((p0||X((p1 U (p2||G(p1)))))))||X(G((p0||X((p1 U (p2||G(p1))))))))))'
Support contains 4 out of 210 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 210/210 places, 210/210 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 199 transition count 199
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 199 transition count 199
Applied a total of 22 rules in 6 ms. Remains 199 /210 variables (removed 11) and now considering 199/210 (removed 11) transitions.
// Phase 1: matrix 199 rows 199 cols
[2024-05-29 20:05:14] [INFO ] Computed 21 invariants in 1 ms
[2024-05-29 20:05:14] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-29 20:05:14] [INFO ] Invariant cache hit.
[2024-05-29 20:05:14] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
[2024-05-29 20:05:14] [INFO ] Invariant cache hit.
[2024-05-29 20:05:14] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 199/210 places, 199/210 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 282 ms. Remains : 199/210 places, 199/210 transitions.
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), true, (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVt-PT-005B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}, { cond=(NOT p3), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p0)), acceptance={0, 1} source=1 dest: 5}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={1} source=5 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p3) p0 (NOT p2) p1), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p3) (NOT p0) (NOT p2) p1), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=5 dest: 5}]], initial=1, aps=[p0:(NEQ s113 1), p3:(EQ s168 1), p2:(AND (OR (EQ s63 1) (EQ s113 1)) (NEQ s178 1)), p1:(NEQ s178 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33286 reset in 117 ms.
Product exploration explored 100000 steps with 33336 reset in 126 ms.
Computed a total of 61 stabilizing places and 61 stable transitions
Computed a total of 61 stabilizing places and 61 stable transitions
Detected a total of 61/199 stabilizing places and 61/199 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p3) (NOT p2) p1), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (AND (NOT p3) p0 (NOT p2) p1)), (X (NOT p3)), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)))), (X p0), (X (NOT (AND (NOT p2) (NOT p1)))), true, (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (AND (NOT p3) p0 (NOT p2) p1))), (X (X (NOT p3))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 160 ms. Reduced automaton from 6 states, 14 edges and 4 AP (stutter sensitive) to 6 states, 14 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 10) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) 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
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2024-05-29 20:05:15] [INFO ] Invariant cache hit.
[2024-05-29 20:05:15] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p3) (NOT p2) p1), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (AND (NOT p3) p0 (NOT p2) p1)), (X (NOT p3)), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)))), (X p0), (X (NOT (AND (NOT p2) (NOT p1)))), true, (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (AND (NOT p3) p0 (NOT p2) p1))), (X (X (NOT p3))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p1 (NOT p2) (NOT p3) (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F (NOT (AND p1 (NOT p2)))), (F (AND (NOT p1) (NOT p2) (NOT p3))), (F (AND (NOT p2) (NOT p0))), (F (NOT p0)), (F (AND (NOT p3) (NOT p0))), (F p3), (F (NOT (AND p1 (NOT p2) (NOT p3) p0))), (F (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)))]
Knowledge based reduction with 23 factoid took 598 ms. Reduced automaton from 6 states, 14 edges and 4 AP (stutter sensitive) to 6 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 231 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2)))]
Support contains 4 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 199/199 transitions.
Applied a total of 0 rules in 4 ms. Remains 199 /199 variables (removed 0) and now considering 199/199 (removed 0) transitions.
[2024-05-29 20:05:16] [INFO ] Invariant cache hit.
[2024-05-29 20:05:16] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-29 20:05:16] [INFO ] Invariant cache hit.
[2024-05-29 20:05:16] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2024-05-29 20:05:16] [INFO ] Invariant cache hit.
[2024-05-29 20:05:16] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 284 ms. Remains : 199/199 places, 199/199 transitions.
Computed a total of 61 stabilizing places and 61 stable transitions
Computed a total of 61 stabilizing places and 61 stable transitions
Detected a total of 61/199 stabilizing places and 61/199 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p3) p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p3)), (X p0), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (AND p1 (NOT p2))), (X (AND p0 p1 (NOT p2) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p3))), (X (X (AND p1 (NOT p2)))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (AND p0 p1 (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 148 ms. Reduced automaton from 6 states, 13 edges and 4 AP (stutter sensitive) to 6 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2)))]
Finished random walk after 555 steps, including 0 resets, run visited all 9 properties in 5 ms. (steps per millisecond=111 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p3) p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p3)), (X p0), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (AND p1 (NOT p2))), (X (AND p0 p1 (NOT p2) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p3))), (X (X (AND p1 (NOT p2)))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (AND p0 p1 (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F (NOT (AND p1 (NOT p2)))), (F (AND (NOT p3) (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (NOT p0)), (F (AND (NOT p0) (NOT p3))), (F p3), (F (AND (NOT p0) (NOT p3) (NOT p2))), (F (NOT (AND p0 (NOT p3) p1 (NOT p2))))]
Knowledge based reduction with 20 factoid took 478 ms. Reduced automaton from 6 states, 13 edges and 4 AP (stutter sensitive) to 6 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 33472 reset in 109 ms.
Product exploration explored 100000 steps with 33378 reset in 116 ms.
Applying partial POR strategy [false, false, true, true, false, false]
Stuttering acceptance computed with spot in 224 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2)))]
Support contains 4 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 199/199 transitions.
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 199 transition count 199
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 19 Pre rules applied. Total rules applied 53 place count 199 transition count 217
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 72 place count 199 transition count 217
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 131 places in 1 ms
Iterating global reduction 1 with 59 rules applied. Total rules applied 131 place count 199 transition count 217
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 169 place count 161 transition count 179
Deduced a syphon composed of 93 places in 0 ms
Iterating global reduction 1 with 38 rules applied. Total rules applied 207 place count 161 transition count 179
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -141
Deduced a syphon composed of 111 places in 1 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 225 place count 161 transition count 320
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 243 place count 143 transition count 284
Deduced a syphon composed of 93 places in 0 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 261 place count 143 transition count 284
Deduced a syphon composed of 93 places in 0 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 264 place count 143 transition count 281
Deduced a syphon composed of 93 places in 0 ms
Applied a total of 264 rules in 46 ms. Remains 143 /199 variables (removed 56) and now considering 281/199 (removed -82) transitions.
[2024-05-29 20:05:18] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 281 rows 143 cols
[2024-05-29 20:05:18] [INFO ] Computed 21 invariants in 1 ms
[2024-05-29 20:05:19] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 143/199 places, 281/199 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 206 ms. Remains : 143/199 places, 281/199 transitions.
Built C files in :
/tmp/ltsmin8357160557718061850
[2024-05-29 20:05:19] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8357160557718061850
Running compilation step : cd /tmp/ltsmin8357160557718061850;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 279 ms.
Running link step : cd /tmp/ltsmin8357160557718061850;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin8357160557718061850;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6913241553222650651.hoa' '--buchi-type=spotba'
LTSmin run took 166 ms.
FORMULA ShieldRVt-PT-005B-LTLFireability-11 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVt-PT-005B-LTLFireability-11 finished in 5550 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(((p2||X(p3))&&p1))))))'
Support contains 4 out of 210 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 210/210 places, 210/210 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 197 transition count 197
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 197 transition count 197
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 196 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 196 transition count 196
Applied a total of 28 rules in 16 ms. Remains 196 /210 variables (removed 14) and now considering 196/210 (removed 14) transitions.
// Phase 1: matrix 196 rows 196 cols
[2024-05-29 20:05:19] [INFO ] Computed 21 invariants in 2 ms
[2024-05-29 20:05:19] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-29 20:05:19] [INFO ] Invariant cache hit.
[2024-05-29 20:05:19] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
[2024-05-29 20:05:19] [INFO ] Invariant cache hit.
[2024-05-29 20:05:19] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 196/210 places, 196/210 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 283 ms. Remains : 196/210 places, 196/210 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3)))]
Running random walk in product with property : ShieldRVt-PT-005B-LTLFireability-12 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=(AND (NOT p2) p1), acceptance={} source=0 dest: 3}], [{ 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}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 3}], [{ cond=(AND p1 (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s124 1), p1:(AND (EQ s65 1) (EQ s79 1)), p2:(EQ s192 0), p3:(EQ s124 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 12260 steps with 11 reset in 24 ms.
FORMULA ShieldRVt-PT-005B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-005B-LTLFireability-12 finished in 488 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 210 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 210/210 places, 210/210 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 209 transition count 149
Reduce places removed 60 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 62 rules applied. Total rules applied 122 place count 149 transition count 147
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 123 place count 148 transition count 147
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 123 place count 148 transition count 115
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 187 place count 116 transition count 115
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 197 place count 106 transition count 105
Iterating global reduction 3 with 10 rules applied. Total rules applied 207 place count 106 transition count 105
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 207 place count 106 transition count 98
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 221 place count 99 transition count 98
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 303 place count 58 transition count 57
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 331 place count 44 transition count 70
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 333 place count 42 transition count 68
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 334 place count 41 transition count 68
Applied a total of 334 rules in 14 ms. Remains 41 /210 variables (removed 169) and now considering 68/210 (removed 142) transitions.
// Phase 1: matrix 68 rows 41 cols
[2024-05-29 20:05:20] [INFO ] Computed 20 invariants in 0 ms
[2024-05-29 20:05:20] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-29 20:05:20] [INFO ] Invariant cache hit.
[2024-05-29 20:05:20] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2024-05-29 20:05:20] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 20:05:20] [INFO ] Invariant cache hit.
[2024-05-29 20:05:20] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/210 places, 68/210 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 160 ms. Remains : 41/210 places, 68/210 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-005B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s38 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-005B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-005B-LTLFireability-13 finished in 217 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0)) U p1)))'
Support contains 2 out of 210 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 210/210 places, 210/210 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 199 transition count 199
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 199 transition count 199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 198 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 198 transition count 198
Applied a total of 24 rules in 12 ms. Remains 198 /210 variables (removed 12) and now considering 198/210 (removed 12) transitions.
// Phase 1: matrix 198 rows 198 cols
[2024-05-29 20:05:20] [INFO ] Computed 21 invariants in 2 ms
[2024-05-29 20:05:20] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-29 20:05:20] [INFO ] Invariant cache hit.
[2024-05-29 20:05:20] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2024-05-29 20:05:20] [INFO ] Invariant cache hit.
[2024-05-29 20:05:20] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 198/210 places, 198/210 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 288 ms. Remains : 198/210 places, 198/210 transitions.
Stuttering acceptance computed with spot in 436 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-005B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s128 1), p0:(EQ s52 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 22270 steps with 0 reset in 38 ms.
FORMULA ShieldRVt-PT-005B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-005B-LTLFireability-15 finished in 789 ms.
All properties solved by simple procedures.
Total runtime 27962 ms.

BK_STOP 1717013122064

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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-005B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is ShieldRVt-PT-005B, 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 r373-tall-171683789700598"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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