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-171683789600578.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-003B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683789600578
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K 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 Apr 23 07:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 21:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Apr 11 21:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 11 21:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 11 21:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 36K 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-003B-LTLFireability-00
FORMULA_NAME ShieldRVt-PT-003B-LTLFireability-01
FORMULA_NAME ShieldRVt-PT-003B-LTLFireability-02
FORMULA_NAME ShieldRVt-PT-003B-LTLFireability-03
FORMULA_NAME ShieldRVt-PT-003B-LTLFireability-04
FORMULA_NAME ShieldRVt-PT-003B-LTLFireability-05
FORMULA_NAME ShieldRVt-PT-003B-LTLFireability-06
FORMULA_NAME ShieldRVt-PT-003B-LTLFireability-07
FORMULA_NAME ShieldRVt-PT-003B-LTLFireability-08
FORMULA_NAME ShieldRVt-PT-003B-LTLFireability-09
FORMULA_NAME ShieldRVt-PT-003B-LTLFireability-10
FORMULA_NAME ShieldRVt-PT-003B-LTLFireability-11
FORMULA_NAME ShieldRVt-PT-003B-LTLFireability-12
FORMULA_NAME ShieldRVt-PT-003B-LTLFireability-13
FORMULA_NAME ShieldRVt-PT-003B-LTLFireability-14
FORMULA_NAME ShieldRVt-PT-003B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717012776192

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-003B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-29 19:59:38] [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 19:59:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 19:59:38] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2024-05-29 19:59:38] [INFO ] Transformed 153 places.
[2024-05-29 19:59:38] [INFO ] Transformed 153 transitions.
[2024-05-29 19:59:38] [INFO ] Found NUPN structural information;
[2024-05-29 19:59:38] [INFO ] Parsed PT model containing 153 places and 153 transitions and 360 arcs in 137 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldRVt-PT-003B-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-003B-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-003B-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 153/153 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 124 transition count 124
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 124 transition count 124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 123 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 123 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 122 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 122 transition count 122
Applied a total of 62 rules in 32 ms. Remains 122 /153 variables (removed 31) and now considering 122/153 (removed 31) transitions.
// Phase 1: matrix 122 rows 122 cols
[2024-05-29 19:59:38] [INFO ] Computed 13 invariants in 21 ms
[2024-05-29 19:59:38] [INFO ] Implicit Places using invariants in 198 ms returned []
[2024-05-29 19:59:38] [INFO ] Invariant cache hit.
[2024-05-29 19:59:38] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2024-05-29 19:59:38] [INFO ] Invariant cache hit.
[2024-05-29 19:59:38] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 122/153 places, 122/153 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 449 ms. Remains : 122/153 places, 122/153 transitions.
Support contains 29 out of 122 places after structural reductions.
[2024-05-29 19:59:39] [INFO ] Flatten gal took : 31 ms
[2024-05-29 19:59:39] [INFO ] Flatten gal took : 12 ms
[2024-05-29 19:59:39] [INFO ] Input system was already deterministic with 122 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 31) seen :29
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2024-05-29 19:59:39] [INFO ] Invariant cache hit.
[2024-05-29 19:59:39] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-29 19:59:39] [INFO ] After 162ms 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 1 ms.
FORMULA ShieldRVt-PT-003B-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ShieldRVt-PT-003B-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 35 stabilizing places and 35 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' '!(G((F(p0)&&F(G(p1)))))'
Support contains 5 out of 122 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 122/122 places, 122/122 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 121 transition count 93
Reduce places removed 28 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 29 rules applied. Total rules applied 57 place count 93 transition count 92
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 58 place count 92 transition count 92
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 58 place count 92 transition count 69
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 104 place count 69 transition count 69
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 107 place count 66 transition count 66
Iterating global reduction 3 with 3 rules applied. Total rules applied 110 place count 66 transition count 66
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 110 place count 66 transition count 65
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 112 place count 65 transition count 65
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 158 place count 42 transition count 42
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 159 place count 42 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 161 place count 41 transition count 40
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 175 place count 34 transition count 45
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 177 place count 32 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 178 place count 31 transition count 43
Applied a total of 178 rules in 33 ms. Remains 31 /122 variables (removed 91) and now considering 43/122 (removed 79) transitions.
// Phase 1: matrix 43 rows 31 cols
[2024-05-29 19:59:40] [INFO ] Computed 12 invariants in 1 ms
[2024-05-29 19:59:40] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-29 19:59:40] [INFO ] Invariant cache hit.
[2024-05-29 19:59:40] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-29 19:59:40] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2024-05-29 19:59:40] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 19:59:40] [INFO ] Invariant cache hit.
[2024-05-29 19:59:40] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 31/122 places, 43/122 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 199 ms. Remains : 31/122 places, 43/122 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 272 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-003B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s15 0), p1:(AND (EQ s10 1) (EQ s13 1) (EQ s21 1) (EQ s5 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA ShieldRVt-PT-003B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-003B-LTLFireability-00 finished in 547 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((X(F(p0))||((G(F(p1)) U G(p2)) U p3))))'
Support contains 3 out of 122 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 122/122 places, 122/122 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 121 transition count 92
Reduce places removed 29 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 30 rules applied. Total rules applied 59 place count 92 transition count 91
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 91 transition count 91
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 60 place count 91 transition count 68
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 106 place count 68 transition count 68
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 109 place count 65 transition count 65
Iterating global reduction 3 with 3 rules applied. Total rules applied 112 place count 65 transition count 65
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 112 place count 65 transition count 62
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 118 place count 62 transition count 62
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 162 place count 40 transition count 40
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 163 place count 40 transition count 39
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 165 place count 39 transition count 38
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 7 places in 4 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 179 place count 32 transition count 43
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 180 place count 31 transition count 42
Applied a total of 180 rules in 38 ms. Remains 31 /122 variables (removed 91) and now considering 42/122 (removed 80) transitions.
// Phase 1: matrix 42 rows 31 cols
[2024-05-29 19:59:40] [INFO ] Computed 13 invariants in 0 ms
[2024-05-29 19:59:40] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-29 19:59:40] [INFO ] Invariant cache hit.
[2024-05-29 19:59:40] [INFO ] State equation strengthened by 16 read => feed constraints.
[2024-05-29 19:59:40] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2024-05-29 19:59:40] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 19:59:40] [INFO ] Invariant cache hit.
[2024-05-29 19:59:40] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 31/122 places, 42/122 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 201 ms. Remains : 31/122 places, 42/122 transitions.
Stuttering acceptance computed with spot in 259 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : ShieldRVt-PT-003B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(NOT p3), acceptance={} source=0 dest: 3}, { cond=(NOT p3), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p3:(EQ s23 1), p2:(EQ s9 1), p1:(EQ s17 1), p0:(EQ s17 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 17 steps with 6 reset in 2 ms.
FORMULA ShieldRVt-PT-003B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-003B-LTLFireability-01 finished in 497 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(G((F(p0)||(p1&&F((p2&&X(p2))))))))'
Support contains 2 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 122/122 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 119 transition count 119
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 119 transition count 119
Applied a total of 6 rules in 10 ms. Remains 119 /122 variables (removed 3) and now considering 119/122 (removed 3) transitions.
// Phase 1: matrix 119 rows 119 cols
[2024-05-29 19:59:41] [INFO ] Computed 13 invariants in 3 ms
[2024-05-29 19:59:41] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-29 19:59:41] [INFO ] Invariant cache hit.
[2024-05-29 19:59:41] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2024-05-29 19:59:41] [INFO ] Invariant cache hit.
[2024-05-29 19:59:41] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 119/122 places, 119/122 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 222 ms. Remains : 119/122 places, 119/122 transitions.
Stuttering acceptance computed with spot in 204 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldRVt-PT-003B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 3}]], initial=0, aps=[p0:(EQ s17 1), p1:(EQ s17 0), p2:(EQ s107 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 24858 reset in 281 ms.
Product exploration explored 100000 steps with 24981 reset in 196 ms.
Computed a total of 34 stabilizing places and 34 stable transitions
Computed a total of 34 stabilizing places and 34 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND (NOT p0) p1 p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), true, (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) p1 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 141 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 19:59:42] [INFO ] Invariant cache hit.
[2024-05-29 19:59:42] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 19:59:42] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-05-29 19:59:42] [INFO ] After 55ms 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 p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND (NOT p0) p1 p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), true, (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) p1 p2))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F p0), (F (NOT (AND (NOT p0) p2))), (F (NOT (AND (NOT p0) p1 p2))), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 12 factoid took 344 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 2 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 119/119 transitions.
Applied a total of 0 rules in 7 ms. Remains 119 /119 variables (removed 0) and now considering 119/119 (removed 0) transitions.
[2024-05-29 19:59:43] [INFO ] Invariant cache hit.
[2024-05-29 19:59:43] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-29 19:59:43] [INFO ] Invariant cache hit.
[2024-05-29 19:59:43] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
[2024-05-29 19:59:43] [INFO ] Invariant cache hit.
[2024-05-29 19:59:43] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 305 ms. Remains : 119/119 places, 119/119 transitions.
Computed a total of 34 stabilizing places and 34 stable transitions
Computed a total of 34 stabilizing places and 34 stable transitions
Knowledge obtained : [(AND (NOT p0) p2), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 96 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 48 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=24 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p2), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (NOT (AND (NOT p0) p2)))]
Knowledge based reduction with 5 factoid took 137 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 33449 reset in 139 ms.
Product exploration explored 100000 steps with 33510 reset in 130 ms.
Built C files in :
/tmp/ltsmin17047529609505713114
[2024-05-29 19:59:44] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17047529609505713114
Running compilation step : cd /tmp/ltsmin17047529609505713114;'/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 336 ms.
Running link step : cd /tmp/ltsmin17047529609505713114;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin17047529609505713114;'/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/stateBased10538942649610842884.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 119/119 transitions.
Applied a total of 0 rules in 4 ms. Remains 119 /119 variables (removed 0) and now considering 119/119 (removed 0) transitions.
[2024-05-29 19:59:59] [INFO ] Invariant cache hit.
[2024-05-29 20:00:00] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-29 20:00:00] [INFO ] Invariant cache hit.
[2024-05-29 20:00:00] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2024-05-29 20:00:00] [INFO ] Invariant cache hit.
[2024-05-29 20:00:00] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 223 ms. Remains : 119/119 places, 119/119 transitions.
Built C files in :
/tmp/ltsmin14792196584456058455
[2024-05-29 20:00:00] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14792196584456058455
Running compilation step : cd /tmp/ltsmin14792196584456058455;'/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 199 ms.
Running link step : cd /tmp/ltsmin14792196584456058455;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin14792196584456058455;'/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/stateBased11812749251647802112.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 20:00:15] [INFO ] Flatten gal took : 7 ms
[2024-05-29 20:00:15] [INFO ] Flatten gal took : 6 ms
[2024-05-29 20:00:15] [INFO ] Time to serialize gal into /tmp/LTL11155531446009278329.gal : 3 ms
[2024-05-29 20:00:15] [INFO ] Time to serialize properties into /tmp/LTL15431007603555503730.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11155531446009278329.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1824595704604504002.hoa' '-atoms' '/tmp/LTL15431007603555503730.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15431007603555503730.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1824595704604504002.hoa
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t13, t17, t22, t26, t31, t32, t38, t42, t47, t51, t56, t60, t63, t67, t73, t78, t83, ...304
Computing Next relation with stutter on 53 deadlock states
274 unique states visited
274 strongly connected components in search stack
275 transitions explored
274 items max in DFS search stack
821 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,8.2407,255752,1,0,1191,925605,271,896,3427,2.00095e+06,3120
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldRVt-PT-003B-LTLFireability-03 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ShieldRVt-PT-003B-LTLFireability-03 finished in 44577 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 122 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 122/122 places, 122/122 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 121 transition count 90
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 90 transition count 90
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 62 place count 90 transition count 68
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 106 place count 68 transition count 68
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 109 place count 65 transition count 65
Iterating global reduction 2 with 3 rules applied. Total rules applied 112 place count 65 transition count 65
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 112 place count 65 transition count 62
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 118 place count 62 transition count 62
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 168 place count 37 transition count 37
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 169 place count 37 transition count 36
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 171 place count 36 transition count 35
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 185 place count 29 transition count 41
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 187 place count 27 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 188 place count 26 transition count 39
Applied a total of 188 rules in 53 ms. Remains 26 /122 variables (removed 96) and now considering 39/122 (removed 83) transitions.
// Phase 1: matrix 39 rows 26 cols
[2024-05-29 20:00:25] [INFO ] Computed 12 invariants in 1 ms
[2024-05-29 20:00:25] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-29 20:00:25] [INFO ] Invariant cache hit.
[2024-05-29 20:00:26] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
[2024-05-29 20:00:26] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 20:00:26] [INFO ] Invariant cache hit.
[2024-05-29 20:00:26] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/122 places, 39/122 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 420 ms. Remains : 26/122 places, 39/122 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-003B-LTLFireability-04 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 s23 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 512 steps with 0 reset in 6 ms.
FORMULA ShieldRVt-PT-003B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-003B-LTLFireability-04 finished in 562 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 (p1||G(p0))) U p2))'
Support contains 5 out of 122 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 122/122 places, 122/122 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 121 transition count 92
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 58 place count 92 transition count 92
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 58 place count 92 transition count 71
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 100 place count 71 transition count 71
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 102 place count 69 transition count 69
Iterating global reduction 2 with 2 rules applied. Total rules applied 104 place count 69 transition count 69
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 104 place count 69 transition count 67
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 108 place count 67 transition count 67
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 156 place count 43 transition count 43
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 157 place count 43 transition count 42
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 159 place count 42 transition count 41
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 175 place count 34 transition count 48
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 177 place count 32 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 178 place count 31 transition count 46
Applied a total of 178 rules in 20 ms. Remains 31 /122 variables (removed 91) and now considering 46/122 (removed 76) transitions.
// Phase 1: matrix 46 rows 31 cols
[2024-05-29 20:00:26] [INFO ] Computed 12 invariants in 0 ms
[2024-05-29 20:00:26] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-29 20:00:26] [INFO ] Invariant cache hit.
[2024-05-29 20:00:26] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-29 20:00:26] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2024-05-29 20:00:26] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 20:00:26] [INFO ] Invariant cache hit.
[2024-05-29 20:00:26] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 31/122 places, 46/122 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 166 ms. Remains : 31/122 places, 46/122 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p2), true, (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-003B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(AND (EQ s10 1) (EQ s14 1) (EQ s21 1)), p1:(AND (NEQ s15 1) (NEQ s3 1)), p0:(NEQ s3 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 1 ms.
FORMULA ShieldRVt-PT-003B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-003B-LTLFireability-05 finished in 290 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((p0&&F(p1))))))'
Support contains 2 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 122/122 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 118 transition count 118
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 118 transition count 118
Applied a total of 8 rules in 2 ms. Remains 118 /122 variables (removed 4) and now considering 118/122 (removed 4) transitions.
// Phase 1: matrix 118 rows 118 cols
[2024-05-29 20:00:26] [INFO ] Computed 13 invariants in 4 ms
[2024-05-29 20:00:26] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-29 20:00:26] [INFO ] Invariant cache hit.
[2024-05-29 20:00:26] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2024-05-29 20:00:26] [INFO ] Invariant cache hit.
[2024-05-29 20:00:26] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 118/122 places, 118/122 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 225 ms. Remains : 118/122 places, 118/122 transitions.
Stuttering acceptance computed with spot in 236 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : ShieldRVt-PT-003B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p1:(EQ s65 1), p0:(EQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-003B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-003B-LTLFireability-08 finished in 480 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)||G((p1||(p2 U (G(p2)||(p2&&G(p3))))))))'
Support contains 3 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 122/122 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 118 transition count 118
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 118 transition count 118
Applied a total of 8 rules in 4 ms. Remains 118 /122 variables (removed 4) and now considering 118/122 (removed 4) transitions.
[2024-05-29 20:00:27] [INFO ] Invariant cache hit.
[2024-05-29 20:00:27] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-29 20:00:27] [INFO ] Invariant cache hit.
[2024-05-29 20:00:27] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2024-05-29 20:00:27] [INFO ] Invariant cache hit.
[2024-05-29 20:00:27] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 118/122 places, 118/122 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 206 ms. Remains : 118/122 places, 118/122 transitions.
Stuttering acceptance computed with spot in 505 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (NOT p3) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldRVt-PT-003B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p3 p2), acceptance={} source=2 dest: 4}, { cond=p1, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=3 dest: 6}, { cond=(AND p3 p2 (NOT p0)), acceptance={} source=3 dest: 7}], [{ cond=(OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p0))), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=4 dest: 6}, { cond=(AND p3 p2 (NOT p0)), acceptance={} source=4 dest: 7}, { cond=(AND p1 p3 (NOT p2) (NOT p0)), acceptance={} source=4 dest: 9}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p1) (NOT p3) p2 (NOT p0)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p1) p3 p2 (NOT p0)), acceptance={} source=5 dest: 7}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 8}], [{ cond=(NOT p2), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={} source=6 dest: 6}, { cond=(AND p3 p2), acceptance={} source=6 dest: 7}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p3) (NOT p2))), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={} source=7 dest: 6}, { cond=(AND p3 p2), acceptance={} source=7 dest: 7}, { cond=(AND p1 p3 (NOT p2)), acceptance={} source=7 dest: 9}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=8 dest: 0}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p1) p3 p2), acceptance={} source=8 dest: 7}, { cond=p1, acceptance={} source=8 dest: 8}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (NOT p3)), acceptance={} source=9 dest: 0}, { cond=(OR (AND p1 p3) (AND p3 p2)), acceptance={} source=9 dest: 9}]], initial=2, aps=[p0:(EQ s19 1), p1:(EQ s110 0), p2:(NEQ s70 1), p3:(NEQ s110 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 28 reset in 204 ms.
Product exploration explored 100000 steps with 25 reset in 211 ms.
Computed a total of 34 stabilizing places and 34 stable transitions
Computed a total of 34 stabilizing places and 34 stable transitions
Detected a total of 34/118 stabilizing places and 34/118 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 p2 p3), (X (NOT (AND p1 p3 (NOT p2) (NOT p0)))), (X (AND p3 p2 (NOT p0))), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3) p2 (NOT p0)))), (X (NOT (AND (NOT p1) p3 p2 (NOT p0)))), (X (NOT (OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p0))))), (X (NOT p0)), (X (NOT (AND (NOT p3) p2 (NOT p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p3) (NOT p2)))))), true, (X (X (AND p3 p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p3 p2)))), (X (X (NOT (AND p1 p3 (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (OR (AND p1 p3) (AND p3 p2)))), (X (X p2)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 26 factoid took 829 ms. Reduced automaton from 10 states, 30 edges and 4 AP (stutter sensitive) to 5 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 175 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2)))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 11) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-29 20:00:29] [INFO ] Invariant cache hit.
[2024-05-29 20:00:29] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 20:00:29] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-05-29 20:00:29] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-05-29 20:00:29] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 12 ms to minimize.
[2024-05-29 20:00:29] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2024-05-29 20:00:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 154 ms
[2024-05-29 20:00:29] [INFO ] After 243ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-29 20:00:29] [INFO ] After 315ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 118/118 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 118 transition count 89
Reduce places removed 29 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 30 rules applied. Total rules applied 59 place count 89 transition count 88
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 88 transition count 88
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 60 place count 88 transition count 63
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 110 place count 63 transition count 63
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 160 place count 38 transition count 38
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 161 place count 38 transition count 37
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 163 place count 37 transition count 36
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 177 place count 30 transition count 41
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 178 place count 30 transition count 40
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 179 place count 29 transition count 39
Applied a total of 179 rules in 11 ms. Remains 29 /118 variables (removed 89) and now considering 39/118 (removed 79) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 29/118 places, 39/118 transitions.
Incomplete random walk after 10000 steps, including 12 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Probably explored full state space saw : 8194 states, properties seen :0
Probabilistic random walk after 59396 steps, saw 8194 distinct states, run finished after 140 ms. (steps per millisecond=424 ) properties seen :0
Explored full state space saw : 8194 states, properties seen :0
Exhaustive walk after 59396 steps, saw 8194 distinct states, run finished after 113 ms. (steps per millisecond=525 ) properties seen :0
Parikh walk visited 0 properties in 1 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 p2 p3), (X (NOT (AND p1 p3 (NOT p2) (NOT p0)))), (X (AND p3 p2 (NOT p0))), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3) p2 (NOT p0)))), (X (NOT (AND (NOT p1) p3 p2 (NOT p0)))), (X (NOT (OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p0))))), (X (NOT p0)), (X (NOT (AND (NOT p3) p2 (NOT p0)))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p3) (NOT p2)))))), true, (X (X (AND p3 p2))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p3 p2)))), (X (X (NOT (AND p1 p3 (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (OR (AND p1 p3) (AND p3 p2)))), (X (X p2)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3)))), (G (NOT (AND (NOT p1) (NOT p2)))), (G (NOT (AND (NOT p1) p2 p3))), (G (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3)))))]
False Knowledge obtained : [(F (AND (NOT p1) p2 (NOT p3))), (F (NOT p1)), (F (NOT p2)), (F (NOT (AND p2 p3))), (F (AND p2 (NOT p3))), (F (AND p1 (NOT p2) p3)), (F (NOT (OR (AND p1 p3) (AND p2 p3)))), (F (OR (AND (NOT p1) (NOT p2)) (NOT p3)))]
Knowledge based reduction with 29 factoid took 2436 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter insensitive) to 6 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 213 ms :[true, (NOT p3), (AND (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p2)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 215 ms :[true, (NOT p3), (AND (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p2)), (NOT p2), (NOT p2)]
Support contains 2 out of 118 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 118/118 places, 118/118 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 117 transition count 89
Reduce places removed 28 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 30 rules applied. Total rules applied 58 place count 89 transition count 87
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 60 place count 87 transition count 87
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 60 place count 87 transition count 62
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 110 place count 62 transition count 62
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 154 place count 40 transition count 40
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 155 place count 40 transition count 39
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 157 place count 39 transition count 38
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 171 place count 32 transition count 43
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 172 place count 31 transition count 42
Applied a total of 172 rules in 17 ms. Remains 31 /118 variables (removed 87) and now considering 42/118 (removed 76) transitions.
// Phase 1: matrix 42 rows 31 cols
[2024-05-29 20:00:33] [INFO ] Computed 13 invariants in 4 ms
[2024-05-29 20:00:33] [INFO ] Implicit Places using invariants in 41 ms returned [23]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 42 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/118 places, 42/118 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61 ms. Remains : 30/118 places, 42/118 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/30 stabilizing places and 4/42 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p3 p1 p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2 p3))), (X p2), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X p2)), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p2 p3)), (X (NOT (AND p2 p3))), (X (AND p1 p2 p3)), (X (NOT (AND p1 p2 p3))), (X (AND p2 (NOT p3))), (X (NOT (AND p2 (NOT p3)))), (X (AND (NOT p1) p2 (NOT p3))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X p1), (X (NOT p1)), (X (X (AND p2 p3))), (X (X (NOT (AND p2 p3)))), (X (X (AND p1 p2 p3))), (X (X (NOT (AND p1 p2 p3)))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 12 factoid took 1506 ms. Reduced automaton from 6 states, 18 edges and 3 AP (stutter insensitive) to 6 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 217 ms :[true, (NOT p3), (AND (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p2)), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 11) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 42 rows 30 cols
[2024-05-29 20:00:35] [INFO ] Computed 12 invariants in 1 ms
[2024-05-29 20:00:35] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-05-29 20:00:35] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 20:00:35] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2024-05-29 20:00:35] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-05-29 20:00:35] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-29 20:00:35] [INFO ] After 7ms SMT Verify possible using 11 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2024-05-29 20:00:35] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-29 20:00:35] [INFO ] After 65ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 42/42 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 30 transition count 41
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 1 with 2 rules applied. Total rules applied 3 place count 29 transition count 40
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 28 transition count 39
Applied a total of 4 rules in 5 ms. Remains 28 /30 variables (removed 2) and now considering 39/42 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 28/30 places, 39/42 transitions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Probably explored full state space saw : 8194 states, properties seen :0
Probabilistic random walk after 59396 steps, saw 8194 distinct states, run finished after 121 ms. (steps per millisecond=490 ) properties seen :0
Explored full state space saw : 8194 states, properties seen :0
Exhaustive walk after 59396 steps, saw 8194 distinct states, run finished after 84 ms. (steps per millisecond=707 ) properties seen :0
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p3 p1 p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2 p3))), (X p2), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X p2)), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p3 p2 (NOT p1)))), (G (NOT (AND (NOT p3) (NOT p2)))), (G (NOT (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(X (AND p2 p3)), (X (NOT (AND p2 p3))), (X (AND p1 p2 p3)), (X (NOT (AND p1 p2 p3))), (X (AND p2 (NOT p3))), (X (NOT (AND p2 (NOT p3)))), (X (AND (NOT p1) p2 (NOT p3))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X p1), (X (NOT p1)), (X (X (AND p2 p3))), (X (X (NOT (AND p2 p3)))), (X (X (AND p1 p2 p3))), (X (X (NOT (AND p1 p2 p3)))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X p1)), (X (X (NOT p1))), (F (AND (NOT p3) p2 (NOT p1))), (F (AND p3 (NOT p2))), (F (NOT p3)), (F (NOT p1)), (F (AND (NOT p3) p2)), (F (NOT (AND p3 p2 p1))), (F (NOT (AND p3 p2))), (F (NOT p2))]
Knowledge based reduction with 15 factoid took 3548 ms. Reduced automaton from 6 states, 18 edges and 3 AP (stutter insensitive) to 6 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 188 ms :[true, (NOT p3), (AND (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p2)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 194 ms :[true, (NOT p3), (AND (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p2)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 197 ms :[true, (NOT p3), (AND (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p2)), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 84 reset in 172 ms.
Product exploration explored 100000 steps with 83 reset in 312 ms.
Built C files in :
/tmp/ltsmin11680280065612233764
[2024-05-29 20:00:40] [INFO ] Computing symmetric may disable matrix : 42 transitions.
[2024-05-29 20:00:40] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:00:40] [INFO ] Computing symmetric may enable matrix : 42 transitions.
[2024-05-29 20:00:40] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:00:40] [INFO ] Computing Do-Not-Accords matrix : 42 transitions.
[2024-05-29 20:00:40] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:00:40] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11680280065612233764
Running compilation step : cd /tmp/ltsmin11680280065612233764;'/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 129 ms.
Running link step : cd /tmp/ltsmin11680280065612233764;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin11680280065612233764;'/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/stateBased1332652077500616486.hoa' '--buchi-type=spotba'
LTSmin run took 942 ms.
FORMULA ShieldRVt-PT-003B-LTLFireability-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVt-PT-003B-LTLFireability-11 finished in 14411 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)&&X(p1))))'
Support contains 3 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 122/122 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 118 transition count 118
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 118 transition count 118
Applied a total of 8 rules in 2 ms. Remains 118 /122 variables (removed 4) and now considering 118/122 (removed 4) transitions.
// Phase 1: matrix 118 rows 118 cols
[2024-05-29 20:00:41] [INFO ] Computed 13 invariants in 1 ms
[2024-05-29 20:00:41] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-29 20:00:41] [INFO ] Invariant cache hit.
[2024-05-29 20:00:41] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
[2024-05-29 20:00:41] [INFO ] Invariant cache hit.
[2024-05-29 20:00:41] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 118/122 places, 118/122 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 380 ms. Remains : 118/122 places, 118/122 transitions.
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : ShieldRVt-PT-003B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s64 1), p1:(AND (EQ s61 1) (EQ s6 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 35 steps with 1 reset in 0 ms.
FORMULA ShieldRVt-PT-003B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-003B-LTLFireability-12 finished in 578 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(p0) U p1)))'
Support contains 2 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 122/122 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 118 transition count 118
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 118 transition count 118
Applied a total of 8 rules in 3 ms. Remains 118 /122 variables (removed 4) and now considering 118/122 (removed 4) transitions.
[2024-05-29 20:00:42] [INFO ] Invariant cache hit.
[2024-05-29 20:00:42] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-29 20:00:42] [INFO ] Invariant cache hit.
[2024-05-29 20:00:42] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2024-05-29 20:00:42] [INFO ] Invariant cache hit.
[2024-05-29 20:00:42] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 118/122 places, 118/122 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 304 ms. Remains : 118/122 places, 118/122 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-003B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p1:(NEQ s106 1), p0:(EQ s71 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 50000 reset in 134 ms.
Product exploration explored 100000 steps with 50000 reset in 128 ms.
Computed a total of 34 stabilizing places and 34 stable transitions
Computed a total of 34 stabilizing places and 34 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 18 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-003B-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-003B-LTLFireability-13 finished in 728 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(G(p0))&&F(p1)))'
Support contains 2 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 122/122 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 118 transition count 118
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 118 transition count 118
Applied a total of 8 rules in 2 ms. Remains 118 /122 variables (removed 4) and now considering 118/122 (removed 4) transitions.
[2024-05-29 20:00:42] [INFO ] Invariant cache hit.
[2024-05-29 20:00:42] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-29 20:00:42] [INFO ] Invariant cache hit.
[2024-05-29 20:00:42] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2024-05-29 20:00:42] [INFO ] Invariant cache hit.
[2024-05-29 20:00:43] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 118/122 places, 118/122 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 292 ms. Remains : 118/122 places, 118/122 transitions.
Stuttering acceptance computed with spot in 190 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-003B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(EQ s52 0), p1:(EQ s53 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 247 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-003B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-003B-LTLFireability-14 finished in 495 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(G((p0 U X((p1&&F(p2))))))))'
Support contains 3 out of 122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 122/122 places, 122/122 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 119 transition count 119
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 119 transition count 119
Applied a total of 6 rules in 2 ms. Remains 119 /122 variables (removed 3) and now considering 119/122 (removed 3) transitions.
// Phase 1: matrix 119 rows 119 cols
[2024-05-29 20:00:43] [INFO ] Computed 13 invariants in 1 ms
[2024-05-29 20:00:43] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-29 20:00:43] [INFO ] Invariant cache hit.
[2024-05-29 20:00:43] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2024-05-29 20:00:43] [INFO ] Invariant cache hit.
[2024-05-29 20:00:43] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 119/122 places, 119/122 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 285 ms. Remains : 119/122 places, 119/122 transitions.
Stuttering acceptance computed with spot in 263 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : ShieldRVt-PT-003B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s87 1), p1:(NEQ s1 1), p2:(NEQ s70 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 9 steps with 1 reset in 0 ms.
FORMULA ShieldRVt-PT-003B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-003B-LTLFireability-15 finished in 568 ms.
All properties solved by simple procedures.
Total runtime 65664 ms.

BK_STOP 1717012844976

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ 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-003B"
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-003B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r373-tall-171683789600578"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-003B.tgz
mv ShieldRVt-PT-003B execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;