fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r373-tall-171683788600128
Last Updated
July 7, 2024

About the Execution of 2023-gold for ShieldIIPt-PT-002B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
336.403 12737.00 20328.00 423.50 FTFFFFFFFTFFTFFF normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K 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.5K Apr 23 07:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K Apr 12 20:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K Apr 12 20:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 12 20:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Apr 12 20:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 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 34K 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 ShieldIIPt-PT-002B-LTLFireability-00
FORMULA_NAME ShieldIIPt-PT-002B-LTLFireability-01
FORMULA_NAME ShieldIIPt-PT-002B-LTLFireability-02
FORMULA_NAME ShieldIIPt-PT-002B-LTLFireability-03
FORMULA_NAME ShieldIIPt-PT-002B-LTLFireability-04
FORMULA_NAME ShieldIIPt-PT-002B-LTLFireability-05
FORMULA_NAME ShieldIIPt-PT-002B-LTLFireability-06
FORMULA_NAME ShieldIIPt-PT-002B-LTLFireability-07
FORMULA_NAME ShieldIIPt-PT-002B-LTLFireability-08
FORMULA_NAME ShieldIIPt-PT-002B-LTLFireability-09
FORMULA_NAME ShieldIIPt-PT-002B-LTLFireability-10
FORMULA_NAME ShieldIIPt-PT-002B-LTLFireability-11
FORMULA_NAME ShieldIIPt-PT-002B-LTLFireability-12
FORMULA_NAME ShieldIIPt-PT-002B-LTLFireability-13
FORMULA_NAME ShieldIIPt-PT-002B-LTLFireability-14
FORMULA_NAME ShieldIIPt-PT-002B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716949571368

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=ShieldIIPt-PT-002B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-29 02:26:13] [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 02:26:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 02:26:13] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2024-05-29 02:26:13] [INFO ] Transformed 143 places.
[2024-05-29 02:26:13] [INFO ] Transformed 133 transitions.
[2024-05-29 02:26:13] [INFO ] Found NUPN structural information;
[2024-05-29 02:26:13] [INFO ] Parsed PT model containing 143 places and 133 transitions and 330 arcs in 118 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 5 formulas.
FORMULA ShieldIIPt-PT-002B-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-002B-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-002B-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-002B-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-002B-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 133/133 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 128 transition count 118
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 128 transition count 118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 127 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 127 transition count 117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 126 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 126 transition count 116
Applied a total of 34 rules in 32 ms. Remains 126 /143 variables (removed 17) and now considering 116/133 (removed 17) transitions.
// Phase 1: matrix 116 rows 126 cols
[2024-05-29 02:26:13] [INFO ] Computed 19 invariants in 12 ms
[2024-05-29 02:26:14] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-05-29 02:26:14] [INFO ] Invariant cache hit.
[2024-05-29 02:26:14] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
[2024-05-29 02:26:14] [INFO ] Invariant cache hit.
[2024-05-29 02:26:14] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 126/143 places, 116/133 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 437 ms. Remains : 126/143 places, 116/133 transitions.
Support contains 31 out of 126 places after structural reductions.
[2024-05-29 02:26:14] [INFO ] Flatten gal took : 37 ms
[2024-05-29 02:26:14] [INFO ] Flatten gal took : 11 ms
[2024-05-29 02:26:14] [INFO ] Input system was already deterministic with 116 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 29) seen :28
Finished Best-First random walk after 7134 steps, including 2 resets, run visited all 1 properties in 17 ms. (steps per millisecond=419 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 30 stabilizing places and 30 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' '!(F(G(p0)))'
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 116/116 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 125 transition count 93
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 103 transition count 93
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 44 place count 103 transition count 80
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 70 place count 90 transition count 80
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 75 place count 85 transition count 75
Iterating global reduction 2 with 5 rules applied. Total rules applied 80 place count 85 transition count 75
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 80 place count 85 transition count 71
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 88 place count 81 transition count 71
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 154 place count 48 transition count 38
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 155 place count 48 transition count 37
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 157 place count 47 transition count 36
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 167 place count 42 transition count 39
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 168 place count 42 transition count 39
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 170 place count 40 transition count 37
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 172 place count 38 transition count 37
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 172 place count 38 transition count 36
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 174 place count 37 transition count 36
Applied a total of 174 rules in 39 ms. Remains 37 /126 variables (removed 89) and now considering 36/116 (removed 80) transitions.
// Phase 1: matrix 36 rows 37 cols
[2024-05-29 02:26:15] [INFO ] Computed 17 invariants in 0 ms
[2024-05-29 02:26:15] [INFO ] Implicit Places using invariants in 51 ms returned [24]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 55 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 36/126 places, 36/116 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 35 transition count 35
Applied a total of 2 rules in 3 ms. Remains 35 /36 variables (removed 1) and now considering 35/36 (removed 1) transitions.
// Phase 1: matrix 35 rows 35 cols
[2024-05-29 02:26:15] [INFO ] Computed 16 invariants in 1 ms
[2024-05-29 02:26:15] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-29 02:26:15] [INFO ] Invariant cache hit.
[2024-05-29 02:26:15] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 35/126 places, 35/116 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 193 ms. Remains : 35/126 places, 35/116 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 166 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-002B-LTLFireability-00 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 s27 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 2 ms.
FORMULA ShieldIIPt-PT-002B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-002B-LTLFireability-00 finished in 411 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(((p2 U p3)&&p1))))'
Support contains 5 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 116/116 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 125 transition count 95
Reduce places removed 20 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 21 rules applied. Total rules applied 41 place count 105 transition count 94
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 42 place count 104 transition count 94
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 42 place count 104 transition count 82
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 66 place count 92 transition count 82
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 71 place count 87 transition count 77
Iterating global reduction 3 with 5 rules applied. Total rules applied 76 place count 87 transition count 77
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 76 place count 87 transition count 73
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 84 place count 83 transition count 73
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 146 place count 52 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 147 place count 52 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 149 place count 51 transition count 40
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 155 place count 48 transition count 41
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 157 place count 46 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 158 place count 45 transition count 39
Applied a total of 158 rules in 23 ms. Remains 45 /126 variables (removed 81) and now considering 39/116 (removed 77) transitions.
// Phase 1: matrix 39 rows 45 cols
[2024-05-29 02:26:15] [INFO ] Computed 18 invariants in 0 ms
[2024-05-29 02:26:15] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-29 02:26:15] [INFO ] Invariant cache hit.
[2024-05-29 02:26:15] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2024-05-29 02:26:15] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 02:26:15] [INFO ] Invariant cache hit.
[2024-05-29 02:26:15] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/126 places, 39/116 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 197 ms. Remains : 45/126 places, 39/116 transitions.
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p1) (NOT p3)), true, (NOT p3), (OR (NOT p3) (NOT p1)), (NOT p3)]
Running random walk in product with property : ShieldIIPt-PT-002B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(OR (AND p1 p3 p0) (AND p1 p2 p0)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) p0) (AND (NOT p3) (NOT p2) p0)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p0))), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p3) p2 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(OR (AND p1 p3 (NOT p0)) (AND p1 p2 (NOT p0))), acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p3) p2 p0), acceptance={0} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={0} source=2 dest: 2}], [{ cond=(OR (NOT p1) (AND (NOT p3) (NOT p2))), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=3 dest: 2}, { cond=(OR (AND p1 p3) (AND p1 p2)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2) p0), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p3) p2 p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s29 1) (EQ s36 1) (EQ s18 1)), p3:(EQ s42 1), p0:(NEQ s24 1), p2:(EQ s18 1)], 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]]
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-002B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-002B-LTLFireability-02 finished in 447 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))&&(p1||(p2 U p3)))))'
Support contains 5 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 116/116 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 119 transition count 109
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 119 transition count 109
Applied a total of 14 rules in 4 ms. Remains 119 /126 variables (removed 7) and now considering 109/116 (removed 7) transitions.
// Phase 1: matrix 109 rows 119 cols
[2024-05-29 02:26:15] [INFO ] Computed 19 invariants in 3 ms
[2024-05-29 02:26:15] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-29 02:26:15] [INFO ] Invariant cache hit.
[2024-05-29 02:26:16] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2024-05-29 02:26:16] [INFO ] Invariant cache hit.
[2024-05-29 02:26:16] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 119/126 places, 109/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 205 ms. Remains : 119/126 places, 109/116 transitions.
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), true, (NOT p0), (NOT p3)]
Running random walk in product with property : ShieldIIPt-PT-002B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(OR p1 p3 p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s19 1) (EQ s36 1)), p3:(EQ s60 1), p2:(EQ s55 1), p0:(NEQ s98 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-002B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-002B-LTLFireability-03 finished in 416 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)))'
Support contains 3 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 116/116 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 119 transition count 109
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 119 transition count 109
Applied a total of 14 rules in 8 ms. Remains 119 /126 variables (removed 7) and now considering 109/116 (removed 7) transitions.
[2024-05-29 02:26:16] [INFO ] Invariant cache hit.
[2024-05-29 02:26:16] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-29 02:26:16] [INFO ] Invariant cache hit.
[2024-05-29 02:26:16] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2024-05-29 02:26:16] [INFO ] Invariant cache hit.
[2024-05-29 02:26:16] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 119/126 places, 109/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 222 ms. Remains : 119/126 places, 109/116 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-002B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s75 1) (AND (EQ s77 1) (EQ s93 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 644 reset in 266 ms.
Stack based approach found an accepted trace after 573 steps with 3 reset with depth 148 and stack size 148 in 1 ms.
FORMULA ShieldIIPt-PT-002B-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-002B-LTLFireability-05 finished in 585 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(p0)||X((G(F(p1))||G(p2)))))'
Support contains 3 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 116/116 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 121 transition count 111
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 121 transition count 111
Applied a total of 10 rules in 6 ms. Remains 121 /126 variables (removed 5) and now considering 111/116 (removed 5) transitions.
// Phase 1: matrix 111 rows 121 cols
[2024-05-29 02:26:16] [INFO ] Computed 19 invariants in 5 ms
[2024-05-29 02:26:17] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-29 02:26:17] [INFO ] Invariant cache hit.
[2024-05-29 02:26:17] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2024-05-29 02:26:17] [INFO ] Invariant cache hit.
[2024-05-29 02:26:17] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 121/126 places, 111/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 221 ms. Remains : 121/126 places, 111/116 transitions.
Stuttering acceptance computed with spot in 234 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-002B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 1}, { cond=(AND p0 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s106 0), p2:(EQ s40 1), p1:(EQ s12 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, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 190 ms.
Product exploration explored 100000 steps with 1 reset in 261 ms.
Computed a total of 30 stabilizing places and 30 stable transitions
Computed a total of 30 stabilizing places and 30 stable transitions
Detected a total of 30/121 stabilizing places and 30/111 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 p2))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), true, (X (X (AND p0 (NOT p2)))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 20 factoid took 255 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Finished random walk after 49 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=9 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 p2))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), true, (X (X (AND p0 (NOT p2)))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 20 factoid took 472 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 2 out of 121 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 : 121/121 places, 111/111 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 120 transition count 87
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 97 transition count 87
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 46 place count 97 transition count 72
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 76 place count 82 transition count 72
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 140 place count 50 transition count 40
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 141 place count 50 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 3 with 2 rules applied. Total rules applied 143 place count 49 transition count 38
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 153 place count 44 transition count 41
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 155 place count 42 transition count 39
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 157 place count 40 transition count 39
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 157 place count 40 transition count 38
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 159 place count 39 transition count 38
Applied a total of 159 rules in 19 ms. Remains 39 /121 variables (removed 82) and now considering 38/111 (removed 73) transitions.
// Phase 1: matrix 38 rows 39 cols
[2024-05-29 02:26:19] [INFO ] Computed 17 invariants in 1 ms
[2024-05-29 02:26:19] [INFO ] Implicit Places using invariants in 42 ms returned [27]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 38/121 places, 38/111 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 37 transition count 37
Applied a total of 2 rules in 1 ms. Remains 37 /38 variables (removed 1) and now considering 37/38 (removed 1) transitions.
// Phase 1: matrix 37 rows 37 cols
[2024-05-29 02:26:19] [INFO ] Computed 16 invariants in 1 ms
[2024-05-29 02:26:19] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-29 02:26:19] [INFO ] Invariant cache hit.
[2024-05-29 02:26:19] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 37/121 places, 37/111 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 153 ms. Remains : 37/121 places, 37/111 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/37 stabilizing places and 2/37 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 6 factoid took 267 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Finished random walk after 4 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=4 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F (NOT p1)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 6 factoid took 500 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering criterion allowed to conclude after 56875 steps with 1 reset in 157 ms.
FORMULA ShieldIIPt-PT-002B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-002B-LTLFireability-06 finished in 3671 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(F(p1)) U G(p2)))))'
Support contains 5 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 116/116 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 120 transition count 110
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 120 transition count 110
Applied a total of 12 rules in 3 ms. Remains 120 /126 variables (removed 6) and now considering 110/116 (removed 6) transitions.
// Phase 1: matrix 110 rows 120 cols
[2024-05-29 02:26:20] [INFO ] Computed 19 invariants in 1 ms
[2024-05-29 02:26:20] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-29 02:26:20] [INFO ] Invariant cache hit.
[2024-05-29 02:26:20] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2024-05-29 02:26:20] [INFO ] Invariant cache hit.
[2024-05-29 02:26:20] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 120/126 places, 110/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 211 ms. Remains : 120/126 places, 110/116 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldIIPt-PT-002B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s84 1), p2:(AND (EQ s83 1) (EQ s93 1) (EQ s119 1)), p1:(EQ s112 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-002B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-002B-LTLFireability-07 finished in 401 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(p0)||G(p1)||F(p2)))'
Support contains 3 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 116/116 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 125 transition count 94
Reduce places removed 21 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 23 rules applied. Total rules applied 44 place count 104 transition count 92
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 46 place count 102 transition count 92
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 46 place count 102 transition count 80
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 70 place count 90 transition count 80
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 73 place count 87 transition count 77
Iterating global reduction 3 with 3 rules applied. Total rules applied 76 place count 87 transition count 77
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 76 place count 87 transition count 75
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 80 place count 85 transition count 75
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 150 place count 50 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 151 place count 50 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 153 place count 49 transition count 38
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 163 place count 44 transition count 41
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 165 place count 42 transition count 39
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 167 place count 40 transition count 39
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 167 place count 40 transition count 38
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 169 place count 39 transition count 38
Applied a total of 169 rules in 29 ms. Remains 39 /126 variables (removed 87) and now considering 38/116 (removed 78) transitions.
// Phase 1: matrix 38 rows 39 cols
[2024-05-29 02:26:21] [INFO ] Computed 17 invariants in 0 ms
[2024-05-29 02:26:21] [INFO ] Implicit Places using invariants in 43 ms returned [24]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 45 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 38/126 places, 38/116 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 37 transition count 37
Applied a total of 2 rules in 3 ms. Remains 37 /38 variables (removed 1) and now considering 37/38 (removed 1) transitions.
// Phase 1: matrix 37 rows 37 cols
[2024-05-29 02:26:21] [INFO ] Computed 16 invariants in 0 ms
[2024-05-29 02:26:21] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-29 02:26:21] [INFO ] Invariant cache hit.
[2024-05-29 02:26:21] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 37/126 places, 37/116 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 170 ms. Remains : 37/126 places, 37/116 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-002B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p0 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 p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=2, aps=[p2:(EQ s31 1), p1:(EQ s34 0), p0:(OR (EQ s28 1) (EQ s34 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 31 steps with 5 reset in 1 ms.
FORMULA ShieldIIPt-PT-002B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-002B-LTLFireability-08 finished in 348 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&&(p1 U (p2||G(p1)))) U !p1))'
Support contains 4 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 116/116 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 125 transition count 96
Reduce places removed 19 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 21 rules applied. Total rules applied 40 place count 106 transition count 94
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 42 place count 104 transition count 94
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 42 place count 104 transition count 81
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 68 place count 91 transition count 81
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 72 place count 87 transition count 77
Iterating global reduction 3 with 4 rules applied. Total rules applied 76 place count 87 transition count 77
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 76 place count 87 transition count 74
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 82 place count 84 transition count 74
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
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 148 place count 51 transition count 41
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 149 place count 51 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 151 place count 50 transition count 39
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 159 place count 46 transition count 41
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 161 place count 44 transition count 39
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 163 place count 42 transition count 39
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 163 place count 42 transition count 38
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 165 place count 41 transition count 38
Applied a total of 165 rules in 20 ms. Remains 41 /126 variables (removed 85) and now considering 38/116 (removed 78) transitions.
// Phase 1: matrix 38 rows 41 cols
[2024-05-29 02:26:21] [INFO ] Computed 17 invariants in 0 ms
[2024-05-29 02:26:21] [INFO ] Implicit Places using invariants in 42 ms returned [29]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/126 places, 38/116 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 39 transition count 37
Applied a total of 2 rules in 2 ms. Remains 39 /40 variables (removed 1) and now considering 37/38 (removed 1) transitions.
// Phase 1: matrix 37 rows 39 cols
[2024-05-29 02:26:21] [INFO ] Computed 16 invariants in 0 ms
[2024-05-29 02:26:21] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-29 02:26:21] [INFO ] Invariant cache hit.
[2024-05-29 02:26:21] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 39/126 places, 37/116 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 153 ms. Remains : 39/126 places, 37/116 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, p1, (OR (NOT p2) p1)]
Running random walk in product with property : ShieldIIPt-PT-002B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (AND p1 p0)), acceptance={0} source=2 dest: 0}, { cond=(AND p1 (NOT p0) p2), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(NEQ s21 1), p0:(AND (EQ s12 1) (EQ s35 1)), p2:(AND (NEQ s21 1) (NEQ s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, 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 ShieldIIPt-PT-002B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-002B-LTLFireability-10 finished in 256 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(p1)))))'
Support contains 4 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 116/116 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 125 transition count 93
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 23 rules applied. Total rules applied 45 place count 103 transition count 92
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 46 place count 102 transition count 92
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 46 place count 102 transition count 80
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 70 place count 90 transition count 80
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 75 place count 85 transition count 75
Iterating global reduction 3 with 5 rules applied. Total rules applied 80 place count 85 transition count 75
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 80 place count 85 transition count 73
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 84 place count 83 transition count 73
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
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 148 place count 51 transition count 41
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 149 place count 51 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 151 place count 50 transition count 39
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 159 place count 46 transition count 41
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 161 place count 44 transition count 39
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 163 place count 42 transition count 39
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 163 place count 42 transition count 38
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 165 place count 41 transition count 38
Applied a total of 165 rules in 19 ms. Remains 41 /126 variables (removed 85) and now considering 38/116 (removed 78) transitions.
// Phase 1: matrix 38 rows 41 cols
[2024-05-29 02:26:21] [INFO ] Computed 17 invariants in 0 ms
[2024-05-29 02:26:21] [INFO ] Implicit Places using invariants in 42 ms returned [27]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 43 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/126 places, 38/116 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 39 transition count 37
Applied a total of 2 rules in 2 ms. Remains 39 /40 variables (removed 1) and now considering 37/38 (removed 1) transitions.
// Phase 1: matrix 37 rows 39 cols
[2024-05-29 02:26:21] [INFO ] Computed 16 invariants in 1 ms
[2024-05-29 02:26:21] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-29 02:26:21] [INFO ] Invariant cache hit.
[2024-05-29 02:26:21] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 02:26:21] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 39/126 places, 37/116 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 147 ms. Remains : 39/126 places, 37/116 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-002B-LTLFireability-11 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 s38 1), p1:(AND (EQ s27 1) (EQ s34 1) (EQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 2175 steps with 0 reset in 3 ms.
FORMULA ShieldIIPt-PT-002B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-002B-LTLFireability-11 finished in 291 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(F(p0))||(F(p0)&&X(F(!p1))&&(p2||X(F(!p3)))))))'
Support contains 6 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 116/116 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 120 transition count 110
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 120 transition count 110
Applied a total of 12 rules in 5 ms. Remains 120 /126 variables (removed 6) and now considering 110/116 (removed 6) transitions.
// Phase 1: matrix 110 rows 120 cols
[2024-05-29 02:26:21] [INFO ] Computed 19 invariants in 1 ms
[2024-05-29 02:26:21] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-29 02:26:21] [INFO ] Invariant cache hit.
[2024-05-29 02:26:22] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2024-05-29 02:26:22] [INFO ] Invariant cache hit.
[2024-05-29 02:26:22] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 120/126 places, 110/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 211 ms. Remains : 120/126 places, 110/116 transitions.
Stuttering acceptance computed with spot in 333 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0)), (AND (NOT p0) p3), (AND (NOT p0) p1), (AND (NOT p0) p3), (AND p1 p3 (NOT p0)), (AND (NOT p0) p1 p3)]
Running random walk in product with property : ShieldIIPt-PT-002B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) p3), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p3), acceptance={} source=3 dest: 5}, { cond=(AND p2 p3), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) p3), acceptance={0} source=5 dest: 5}], [{ cond=(AND p1 p3), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) p1 p3), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p0) p1 p3), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(NEQ s67 1), p2:(NEQ s114 1), p1:(AND (EQ s77 1) (EQ s93 1)), p3:(AND (EQ s2 1) (EQ s49 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 165 ms.
Product exploration explored 100000 steps with 50000 reset in 174 ms.
Computed a total of 30 stabilizing places and 30 stable transitions
Computed a total of 30 stabilizing places and 30 stable transitions
Detected a total of 30/120 stabilizing places and 30/110 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 p2 (NOT p1) (NOT p3)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p2) p3))), (X p0), (X (NOT (AND p2 p3))), (X (NOT (AND (NOT p0) p3))), (X (NOT p1)), (X (X (NOT (AND p1 p3)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1 p3)))), (X (X (NOT (AND (NOT p2) p3)))), (X (X p0)), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 16 factoid took 19 ms. Reduced automaton from 8 states, 14 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-002B-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-002B-LTLFireability-12 finished in 936 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)))'
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 116/116 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 119 transition count 109
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 119 transition count 109
Applied a total of 14 rules in 4 ms. Remains 119 /126 variables (removed 7) and now considering 109/116 (removed 7) transitions.
// Phase 1: matrix 109 rows 119 cols
[2024-05-29 02:26:22] [INFO ] Computed 19 invariants in 1 ms
[2024-05-29 02:26:22] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-29 02:26:22] [INFO ] Invariant cache hit.
[2024-05-29 02:26:22] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2024-05-29 02:26:22] [INFO ] Invariant cache hit.
[2024-05-29 02:26:23] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 119/126 places, 109/116 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 211 ms. Remains : 119/126 places, 109/116 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-002B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(NEQ s29 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 18 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-002B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-002B-LTLFireability-15 finished in 309 ms.
All properties solved by simple procedures.
Total runtime 9594 ms.

BK_STOP 1716949584105

--------------------
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="ShieldIIPt-PT-002B"
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 ShieldIIPt-PT-002B, 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-171683788600128"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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