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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K 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:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 19 19:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 20:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K Apr 12 20:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 20:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 12 20:37 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 83K 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-005B-LTLFireability-00
FORMULA_NAME ShieldIIPt-PT-005B-LTLFireability-01
FORMULA_NAME ShieldIIPt-PT-005B-LTLFireability-02
FORMULA_NAME ShieldIIPt-PT-005B-LTLFireability-03
FORMULA_NAME ShieldIIPt-PT-005B-LTLFireability-04
FORMULA_NAME ShieldIIPt-PT-005B-LTLFireability-05
FORMULA_NAME ShieldIIPt-PT-005B-LTLFireability-06
FORMULA_NAME ShieldIIPt-PT-005B-LTLFireability-07
FORMULA_NAME ShieldIIPt-PT-005B-LTLFireability-08
FORMULA_NAME ShieldIIPt-PT-005B-LTLFireability-09
FORMULA_NAME ShieldIIPt-PT-005B-LTLFireability-10
FORMULA_NAME ShieldIIPt-PT-005B-LTLFireability-11
FORMULA_NAME ShieldIIPt-PT-005B-LTLFireability-12
FORMULA_NAME ShieldIIPt-PT-005B-LTLFireability-13
FORMULA_NAME ShieldIIPt-PT-005B-LTLFireability-14
FORMULA_NAME ShieldIIPt-PT-005B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716951719294

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-005B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-29 03:02:01] [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 03:02:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 03:02:01] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2024-05-29 03:02:01] [INFO ] Transformed 353 places.
[2024-05-29 03:02:01] [INFO ] Transformed 328 transitions.
[2024-05-29 03:02:01] [INFO ] Found NUPN structural information;
[2024-05-29 03:02:01] [INFO ] Parsed PT model containing 353 places and 328 transitions and 816 arcs in 146 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldIIPt-PT-005B-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-005B-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 353 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 353/353 places, 328/328 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 305 transition count 280
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 305 transition count 280
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 304 transition count 279
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 304 transition count 279
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 99 place count 303 transition count 278
Iterating global reduction 0 with 1 rules applied. Total rules applied 100 place count 303 transition count 278
Applied a total of 100 rules in 73 ms. Remains 303 /353 variables (removed 50) and now considering 278/328 (removed 50) transitions.
// Phase 1: matrix 278 rows 303 cols
[2024-05-29 03:02:01] [INFO ] Computed 46 invariants in 23 ms
[2024-05-29 03:02:01] [INFO ] Implicit Places using invariants in 289 ms returned []
[2024-05-29 03:02:01] [INFO ] Invariant cache hit.
[2024-05-29 03:02:02] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
[2024-05-29 03:02:02] [INFO ] Invariant cache hit.
[2024-05-29 03:02:02] [INFO ] Dead Transitions using invariants and state equation in 171 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 303/353 places, 278/328 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 766 ms. Remains : 303/353 places, 278/328 transitions.
Support contains 40 out of 303 places after structural reductions.
[2024-05-29 03:02:02] [INFO ] Flatten gal took : 46 ms
[2024-05-29 03:02:02] [INFO ] Flatten gal took : 18 ms
[2024-05-29 03:02:02] [INFO ] Input system was already deterministic with 278 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 313 ms. (steps per millisecond=31 ) 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 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-29 03:02:03] [INFO ] Invariant cache hit.
[2024-05-29 03:02:03] [INFO ] [Real]Absence check using 46 positive place invariants in 10 ms returned sat
[2024-05-29 03:02:03] [INFO ] After 226ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 03:02:03] [INFO ] [Nat]Absence check using 46 positive place invariants in 15 ms returned sat
[2024-05-29 03:02:03] [INFO ] After 106ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 03:02:03] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 6 ms to minimize.
[2024-05-29 03:02:03] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 1 ms to minimize.
[2024-05-29 03:02:03] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 199 ms
[2024-05-29 03:02:03] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-05-29 03:02:03] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 3 ms to minimize.
[2024-05-29 03:02:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 182 ms
[2024-05-29 03:02:03] [INFO ] After 504ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-29 03:02:03] [INFO ] After 633ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 303/303 places, 278/278 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 303 transition count 219
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 1 with 59 rules applied. Total rules applied 118 place count 244 transition count 219
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 118 place count 244 transition count 182
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 192 place count 207 transition count 182
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 198 place count 201 transition count 176
Iterating global reduction 2 with 6 rules applied. Total rules applied 204 place count 201 transition count 176
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 204 place count 201 transition count 171
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 214 place count 196 transition count 171
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 0 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 164 rules applied. Total rules applied 378 place count 114 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 379 place count 114 transition count 88
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 381 place count 113 transition count 87
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -7
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 407 place count 100 transition count 94
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 408 place count 100 transition count 93
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 413 place count 100 transition count 93
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 414 place count 99 transition count 92
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 416 place count 97 transition count 92
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 416 place count 97 transition count 91
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 418 place count 96 transition count 91
Applied a total of 418 rules in 58 ms. Remains 96 /303 variables (removed 207) and now considering 91/278 (removed 187) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 96/303 places, 91/278 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Finished Best-First random walk after 3680 steps, including 1 resets, run visited all 1 properties in 7 ms. (steps per millisecond=525 )
Parikh walk visited 0 properties in 0 ms.
FORMULA ShieldIIPt-PT-005B-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA ShieldIIPt-PT-005B-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 80 stabilizing places and 80 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(((p0 U p1)||(p1 U p2)))||G(F(p3))))'
Support contains 7 out of 303 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 303/303 places, 278/278 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 302 transition count 219
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 1 with 58 rules applied. Total rules applied 116 place count 244 transition count 219
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 116 place count 244 transition count 183
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 188 place count 208 transition count 183
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 194 place count 202 transition count 177
Iterating global reduction 2 with 6 rules applied. Total rules applied 200 place count 202 transition count 177
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 200 place count 202 transition count 173
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 208 place count 198 transition count 173
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Deduced a syphon composed of 81 places in 0 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 2 with 162 rules applied. Total rules applied 370 place count 117 transition count 92
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 371 place count 117 transition count 91
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 373 place count 116 transition count 90
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -7
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 399 place count 103 transition count 97
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 401 place count 101 transition count 95
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 403 place count 99 transition count 95
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 403 place count 99 transition count 94
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 405 place count 98 transition count 94
Applied a total of 405 rules in 38 ms. Remains 98 /303 variables (removed 205) and now considering 94/278 (removed 184) transitions.
// Phase 1: matrix 94 rows 98 cols
[2024-05-29 03:02:04] [INFO ] Computed 44 invariants in 0 ms
[2024-05-29 03:02:04] [INFO ] Implicit Places using invariants in 64 ms returned [87]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 72 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 97/303 places, 94/278 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 96 transition count 93
Applied a total of 2 rules in 6 ms. Remains 96 /97 variables (removed 1) and now considering 93/94 (removed 1) transitions.
// Phase 1: matrix 93 rows 96 cols
[2024-05-29 03:02:04] [INFO ] Computed 43 invariants in 1 ms
[2024-05-29 03:02:04] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-29 03:02:04] [INFO ] Invariant cache hit.
[2024-05-29 03:02:04] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 96/303 places, 93/278 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 281 ms. Remains : 96/303 places, 93/278 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 359 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (NOT p3), (NOT p3), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : ShieldIIPt-PT-005B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p3), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) p2 (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0 p2 (NOT p3)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s62 1), p0:(EQ s66 1), p2:(AND (EQ s10 1) (EQ s15 1) (EQ s22 1)), p3:(OR (EQ s69 0) (EQ s81 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 64 steps with 1 reset in 5 ms.
FORMULA ShieldIIPt-PT-005B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-005B-LTLFireability-00 finished in 710 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&&X(X((F(G(!p1)) U G(p2))))))))'
Support contains 7 out of 303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 278/278 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 297 transition count 272
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 297 transition count 272
Applied a total of 12 rules in 16 ms. Remains 297 /303 variables (removed 6) and now considering 272/278 (removed 6) transitions.
// Phase 1: matrix 272 rows 297 cols
[2024-05-29 03:02:05] [INFO ] Computed 46 invariants in 2 ms
[2024-05-29 03:02:05] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-29 03:02:05] [INFO ] Invariant cache hit.
[2024-05-29 03:02:05] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
[2024-05-29 03:02:05] [INFO ] Invariant cache hit.
[2024-05-29 03:02:05] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 297/303 places, 272/278 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 472 ms. Remains : 297/303 places, 272/278 transitions.
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p2), (NOT p2), p1]
Running random walk in product with property : ShieldIIPt-PT-005B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}, { cond=(NOT p2), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 5}, { cond=p1, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s66 1), p2:(AND (EQ s29 1) (EQ s111 1) (EQ s147 1)), p1:(AND (EQ s31 1) (EQ s56 1) (EQ s65 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, 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-005B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-005B-LTLFireability-01 finished in 714 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(F((X(F((p2&&F(p3))))||p1)))))'
Support contains 4 out of 303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 278/278 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 296 transition count 271
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 296 transition count 271
Applied a total of 14 rules in 15 ms. Remains 296 /303 variables (removed 7) and now considering 271/278 (removed 7) transitions.
// Phase 1: matrix 271 rows 296 cols
[2024-05-29 03:02:05] [INFO ] Computed 46 invariants in 3 ms
[2024-05-29 03:02:06] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-29 03:02:06] [INFO ] Invariant cache hit.
[2024-05-29 03:02:06] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
[2024-05-29 03:02:06] [INFO ] Invariant cache hit.
[2024-05-29 03:02:06] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 296/303 places, 271/278 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 444 ms. Remains : 296/303 places, 271/278 transitions.
Stuttering acceptance computed with spot in 290 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-005B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2 (NOT p3)), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=6 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=6 dest: 6}]], initial=3, aps=[p1:(OR (NEQ s63 1) (EQ s63 0)), p2:(NEQ s63 1), p3:(EQ s246 1), p0:(AND (EQ s74 1) (EQ s119 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, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 339 ms.
Product exploration explored 100000 steps with 50000 reset in 285 ms.
Computed a total of 78 stabilizing places and 78 stable transitions
Computed a total of 78 stabilizing places and 78 stable transitions
Detected a total of 78/296 stabilizing places and 78/271 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p1 p2 (NOT p3) (NOT p0)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 20 ms. Reduced automaton from 7 states, 14 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-005B-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-005B-LTLFireability-03 finished in 1413 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 1 out of 303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 278/278 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 296 transition count 271
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 296 transition count 271
Applied a total of 14 rules in 12 ms. Remains 296 /303 variables (removed 7) and now considering 271/278 (removed 7) transitions.
[2024-05-29 03:02:07] [INFO ] Invariant cache hit.
[2024-05-29 03:02:07] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-29 03:02:07] [INFO ] Invariant cache hit.
[2024-05-29 03:02:07] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
[2024-05-29 03:02:07] [INFO ] Invariant cache hit.
[2024-05-29 03:02:07] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 296/303 places, 271/278 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 491 ms. Remains : 296/303 places, 271/278 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-005B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s45 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 50000 reset in 233 ms.
Product exploration explored 100000 steps with 50000 reset in 239 ms.
Computed a total of 78 stabilizing places and 78 stable transitions
Computed a total of 78 stabilizing places and 78 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 16 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-005B-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-005B-LTLFireability-06 finished in 1171 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 1 out of 303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 278/278 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 296 transition count 271
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 296 transition count 271
Applied a total of 14 rules in 9 ms. Remains 296 /303 variables (removed 7) and now considering 271/278 (removed 7) transitions.
[2024-05-29 03:02:08] [INFO ] Invariant cache hit.
[2024-05-29 03:02:08] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-29 03:02:08] [INFO ] Invariant cache hit.
[2024-05-29 03:02:08] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
[2024-05-29 03:02:08] [INFO ] Invariant cache hit.
[2024-05-29 03:02:08] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 296/303 places, 271/278 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 449 ms. Remains : 296/303 places, 271/278 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-005B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s58 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 2326 reset in 156 ms.
Product exploration explored 100000 steps with 2305 reset in 217 ms.
Computed a total of 78 stabilizing places and 78 stable transitions
Computed a total of 78 stabilizing places and 78 stable transitions
Detected a total of 78/296 stabilizing places and 78/271 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 79 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 71 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=23 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 103 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
[2024-05-29 03:02:09] [INFO ] Invariant cache hit.
[2024-05-29 03:02:09] [INFO ] [Real]Absence check using 46 positive place invariants in 13 ms returned sat
[2024-05-29 03:02:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 03:02:10] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2024-05-29 03:02:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 03:02:10] [INFO ] [Nat]Absence check using 46 positive place invariants in 12 ms returned sat
[2024-05-29 03:02:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 03:02:10] [INFO ] [Nat]Absence check using state equation in 160 ms returned sat
[2024-05-29 03:02:10] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-29 03:02:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2024-05-29 03:02:10] [INFO ] Computed and/alt/rep : 270/406/270 causal constraints (skipped 0 transitions) in 17 ms.
[2024-05-29 03:02:11] [INFO ] Added : 255 causal constraints over 51 iterations in 1181 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 296 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 296/296 places, 271/271 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 295 transition count 212
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 1 with 58 rules applied. Total rules applied 116 place count 237 transition count 212
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 116 place count 237 transition count 170
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 200 place count 195 transition count 170
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Deduced a syphon composed of 81 places in 0 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 2 with 162 rules applied. Total rules applied 362 place count 114 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 363 place count 114 transition count 88
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 365 place count 113 transition count 87
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 393 place count 99 transition count 96
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 395 place count 97 transition count 94
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 397 place count 95 transition count 94
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 397 place count 95 transition count 93
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 399 place count 94 transition count 93
Applied a total of 399 rules in 33 ms. Remains 94 /296 variables (removed 202) and now considering 93/271 (removed 178) transitions.
// Phase 1: matrix 93 rows 94 cols
[2024-05-29 03:02:11] [INFO ] Computed 44 invariants in 2 ms
[2024-05-29 03:02:11] [INFO ] Implicit Places using invariants in 63 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 64 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 93/296 places, 93/271 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 92 transition count 92
Applied a total of 2 rules in 5 ms. Remains 92 /93 variables (removed 1) and now considering 92/93 (removed 1) transitions.
// Phase 1: matrix 92 rows 92 cols
[2024-05-29 03:02:11] [INFO ] Computed 43 invariants in 1 ms
[2024-05-29 03:02:11] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-29 03:02:11] [INFO ] Invariant cache hit.
[2024-05-29 03:02:11] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-29 03:02:11] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 92/296 places, 92/271 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 257 ms. Remains : 92/296 places, 92/271 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/92 stabilizing places and 2/92 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 156 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 190 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
[2024-05-29 03:02:12] [INFO ] Invariant cache hit.
[2024-05-29 03:02:12] [INFO ] [Real]Absence check using 43 positive place invariants in 7 ms returned sat
[2024-05-29 03:02:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 03:02:12] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2024-05-29 03:02:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 03:02:12] [INFO ] [Nat]Absence check using 43 positive place invariants in 7 ms returned sat
[2024-05-29 03:02:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 03:02:12] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-05-29 03:02:12] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-29 03:02:12] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2024-05-29 03:02:12] [INFO ] Computed and/alt/rep : 87/190/87 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-29 03:02:12] [INFO ] Added : 43 causal constraints over 9 iterations in 78 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-005B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-005B-LTLFireability-07 finished in 4115 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(X(F(p0))))))'
Support contains 2 out of 303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 278/278 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 296 transition count 271
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 296 transition count 271
Applied a total of 14 rules in 11 ms. Remains 296 /303 variables (removed 7) and now considering 271/278 (removed 7) transitions.
// Phase 1: matrix 271 rows 296 cols
[2024-05-29 03:02:12] [INFO ] Computed 46 invariants in 1 ms
[2024-05-29 03:02:12] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-29 03:02:12] [INFO ] Invariant cache hit.
[2024-05-29 03:02:12] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
[2024-05-29 03:02:12] [INFO ] Invariant cache hit.
[2024-05-29 03:02:13] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 296/303 places, 271/278 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 441 ms. Remains : 296/303 places, 271/278 transitions.
Stuttering acceptance computed with spot in 244 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-005B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(OR (NEQ s80 1) (NEQ s97 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 177 ms.
Product exploration explored 100000 steps with 20000 reset in 173 ms.
Computed a total of 78 stabilizing places and 78 stable transitions
Computed a total of 78 stabilizing places and 78 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 65 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 537 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=59 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 100 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 296 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 296/296 places, 271/271 transitions.
Applied a total of 0 rules in 5 ms. Remains 296 /296 variables (removed 0) and now considering 271/271 (removed 0) transitions.
[2024-05-29 03:02:14] [INFO ] Invariant cache hit.
[2024-05-29 03:02:14] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-29 03:02:14] [INFO ] Invariant cache hit.
[2024-05-29 03:02:14] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
[2024-05-29 03:02:14] [INFO ] Invariant cache hit.
[2024-05-29 03:02:14] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 436 ms. Remains : 296/296 places, 271/271 transitions.
Computed a total of 78 stabilizing places and 78 stable transitions
Computed a total of 78 stabilizing places and 78 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 81 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 443 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=63 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 200 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 139 ms.
Product exploration explored 100000 steps with 20000 reset in 138 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 296 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 296/296 places, 271/271 transitions.
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 296 transition count 271
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 21 Pre rules applied. Total rules applied 59 place count 296 transition count 288
Deduced a syphon composed of 80 places in 1 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 80 place count 296 transition count 288
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 178 places in 0 ms
Iterating global reduction 1 with 98 rules applied. Total rules applied 178 place count 296 transition count 288
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 179 place count 296 transition count 287
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 218 place count 257 transition count 248
Deduced a syphon composed of 139 places in 0 ms
Iterating global reduction 2 with 39 rules applied. Total rules applied 257 place count 257 transition count 248
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 140 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 258 place count 257 transition count 248
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 260 place count 255 transition count 246
Deduced a syphon composed of 138 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 262 place count 255 transition count 246
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -109
Deduced a syphon composed of 157 places in 0 ms
Iterating global reduction 2 with 19 rules applied. Total rules applied 281 place count 255 transition count 355
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 300 place count 236 transition count 317
Deduced a syphon composed of 138 places in 1 ms
Iterating global reduction 2 with 19 rules applied. Total rules applied 319 place count 236 transition count 317
Deduced a syphon composed of 138 places in 1 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 328 place count 236 transition count 308
Deduced a syphon composed of 138 places in 0 ms
Applied a total of 328 rules in 63 ms. Remains 236 /296 variables (removed 60) and now considering 308/271 (removed -37) transitions.
[2024-05-29 03:02:16] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 308 rows 236 cols
[2024-05-29 03:02:16] [INFO ] Computed 46 invariants in 2 ms
[2024-05-29 03:02:16] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 236/296 places, 308/271 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 239 ms. Remains : 236/296 places, 308/271 transitions.
Built C files in :
/tmp/ltsmin16615574675790874802
[2024-05-29 03:02:16] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16615574675790874802
Running compilation step : cd /tmp/ltsmin16615574675790874802;'/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 489 ms.
Running link step : cd /tmp/ltsmin16615574675790874802;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin16615574675790874802;'/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/stateBased12293311263639382182.hoa' '--buchi-type=spotba'
LTSmin run took 172 ms.
FORMULA ShieldIIPt-PT-005B-LTLFireability-08 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPt-PT-005B-LTLFireability-08 finished in 4787 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)&&F(p1))||X(G(p0)))))'
Support contains 2 out of 303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 278/278 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 296 transition count 271
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 296 transition count 271
Applied a total of 14 rules in 10 ms. Remains 296 /303 variables (removed 7) and now considering 271/278 (removed 7) transitions.
// Phase 1: matrix 271 rows 296 cols
[2024-05-29 03:02:17] [INFO ] Computed 46 invariants in 2 ms
[2024-05-29 03:02:17] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-29 03:02:17] [INFO ] Invariant cache hit.
[2024-05-29 03:02:17] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
[2024-05-29 03:02:17] [INFO ] Invariant cache hit.
[2024-05-29 03:02:17] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 296/303 places, 271/278 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 428 ms. Remains : 296/303 places, 271/278 transitions.
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-005B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s62 1) (EQ s131 1)), p0:(NEQ s62 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][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 8 reset in 194 ms.
Stack based approach found an accepted trace after 2405 steps with 0 reset with depth 2406 and stack size 2406 in 6 ms.
FORMULA ShieldIIPt-PT-005B-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-005B-LTLFireability-09 finished in 842 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 U p1)||F((G(p2)&&F(p3))))))'
Support contains 4 out of 303 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 303/303 places, 278/278 transitions.
Drop transitions removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 57 place count 303 transition count 221
Reduce places removed 57 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 58 rules applied. Total rules applied 115 place count 246 transition count 220
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 116 place count 245 transition count 220
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 116 place count 245 transition count 182
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 192 place count 207 transition count 182
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 196 place count 203 transition count 178
Iterating global reduction 3 with 4 rules applied. Total rules applied 200 place count 203 transition count 178
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 200 place count 203 transition count 175
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 206 place count 200 transition count 175
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 3 with 166 rules applied. Total rules applied 372 place count 117 transition count 92
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 373 place count 117 transition count 91
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 375 place count 116 transition count 90
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 403 place count 102 transition count 99
Applied a total of 403 rules in 31 ms. Remains 102 /303 variables (removed 201) and now considering 99/278 (removed 179) transitions.
// Phase 1: matrix 99 rows 102 cols
[2024-05-29 03:02:18] [INFO ] Computed 46 invariants in 1 ms
[2024-05-29 03:02:18] [INFO ] Implicit Places using invariants in 62 ms returned [92, 93]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 63 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 100/303 places, 99/278 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 100 transition count 98
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 99 transition count 98
Applied a total of 2 rules in 4 ms. Remains 99 /100 variables (removed 1) and now considering 98/99 (removed 1) transitions.
// Phase 1: matrix 98 rows 99 cols
[2024-05-29 03:02:18] [INFO ] Computed 44 invariants in 1 ms
[2024-05-29 03:02:18] [INFO ] Implicit Places using invariants in 60 ms returned [86]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 61 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 98/303 places, 98/278 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 97 transition count 97
Applied a total of 2 rules in 4 ms. Remains 97 /98 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 97 cols
[2024-05-29 03:02:18] [INFO ] Computed 43 invariants in 1 ms
[2024-05-29 03:02:18] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-29 03:02:18] [INFO ] Invariant cache hit.
[2024-05-29 03:02:18] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-29 03:02:18] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 97/303 places, 97/278 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 383 ms. Remains : 97/303 places, 97/278 transitions.
Stuttering acceptance computed with spot in 299 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p2), (NOT p3), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : ShieldIIPt-PT-005B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p2 (NOT p3)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p1) p0 p2 (NOT p3)), acceptance={} source=0 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=p2, acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p3)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p2 (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) p0 p2 (NOT p3)), acceptance={} source=2 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(EQ s96 1), p0:(EQ s23 1), p2:(EQ s82 1), p3:(EQ s60 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-005B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-005B-LTLFireability-10 finished in 706 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 303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 278/278 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 297 transition count 272
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 297 transition count 272
Applied a total of 12 rules in 8 ms. Remains 297 /303 variables (removed 6) and now considering 272/278 (removed 6) transitions.
// Phase 1: matrix 272 rows 297 cols
[2024-05-29 03:02:18] [INFO ] Computed 46 invariants in 3 ms
[2024-05-29 03:02:19] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-29 03:02:19] [INFO ] Invariant cache hit.
[2024-05-29 03:02:19] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
[2024-05-29 03:02:19] [INFO ] Invariant cache hit.
[2024-05-29 03:02:19] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 297/303 places, 272/278 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 433 ms. Remains : 297/303 places, 272/278 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-005B-LTLFireability-11 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 s270 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 321 steps with 0 reset in 3 ms.
FORMULA ShieldIIPt-PT-005B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-005B-LTLFireability-11 finished in 542 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||G((p1 U X(!p2)))))))'
Support contains 2 out of 303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 278/278 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 298 transition count 273
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 298 transition count 273
Applied a total of 10 rules in 12 ms. Remains 298 /303 variables (removed 5) and now considering 273/278 (removed 5) transitions.
// Phase 1: matrix 273 rows 298 cols
[2024-05-29 03:02:19] [INFO ] Computed 46 invariants in 1 ms
[2024-05-29 03:02:19] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-29 03:02:19] [INFO ] Invariant cache hit.
[2024-05-29 03:02:19] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
[2024-05-29 03:02:19] [INFO ] Invariant cache hit.
[2024-05-29 03:02:19] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 298/303 places, 273/278 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 448 ms. Remains : 298/303 places, 273/278 transitions.
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Running random walk in product with property : ShieldIIPt-PT-005B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s66 0), p1:(EQ s102 1), p2:(EQ s66 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 19 reset in 198 ms.
Product exploration explored 100000 steps with 5 reset in 394 ms.
Computed a total of 79 stabilizing places and 79 stable transitions
Computed a total of 79 stabilizing places and 79 stable transitions
Detected a total of 79/298 stabilizing places and 79/273 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 324 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 13 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-29 03:02:21] [INFO ] Invariant cache hit.
[2024-05-29 03:02:21] [INFO ] [Real]Absence check using 46 positive place invariants in 10 ms returned sat
[2024-05-29 03:02:21] [INFO ] After 171ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-29 03:02:21] [INFO ] [Nat]Absence check using 46 positive place invariants in 10 ms returned sat
[2024-05-29 03:02:21] [INFO ] After 109ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2024-05-29 03:02:21] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 0 ms to minimize.
[2024-05-29 03:02:22] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 0 ms to minimize.
[2024-05-29 03:02:22] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-29 03:02:22] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2024-05-29 03:02:22] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2024-05-29 03:02:22] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2024-05-29 03:02:22] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-05-29 03:02:22] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2024-05-29 03:02:22] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 0 ms to minimize.
[2024-05-29 03:02:22] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-05-29 03:02:22] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-05-29 03:02:22] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-29 03:02:22] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-05-29 03:02:22] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 707 ms
[2024-05-29 03:02:22] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-29 03:02:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2024-05-29 03:02:22] [INFO ] After 911ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 34 ms.
[2024-05-29 03:02:22] [INFO ] After 1031ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 2 out of 298 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 298/298 places, 273/273 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 298 transition count 214
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 1 with 59 rules applied. Total rules applied 118 place count 239 transition count 214
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 118 place count 239 transition count 175
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 196 place count 200 transition count 175
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 2 with 172 rules applied. Total rules applied 368 place count 114 transition count 89
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 369 place count 114 transition count 88
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 371 place count 113 transition count 87
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 399 place count 99 transition count 96
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 400 place count 99 transition count 95
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 405 place count 99 transition count 95
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 406 place count 98 transition count 94
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 408 place count 96 transition count 94
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 408 place count 96 transition count 93
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 410 place count 95 transition count 93
Applied a total of 410 rules in 26 ms. Remains 95 /298 variables (removed 203) and now considering 93/273 (removed 180) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 95/298 places, 93/273 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 3) seen :0
Finished Best-First random walk after 457 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=228 )
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p2) (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) p1))), (F (AND p2 (NOT p0) (NOT p1))), (F (AND p2 (NOT p0) p1))]
Knowledge based reduction with 13 factoid took 1061 ms. Reduced automaton from 4 states, 13 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 133 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
Stuttering acceptance computed with spot in 119 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
Support contains 2 out of 298 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 298/298 places, 273/273 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 297 transition count 213
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 1 with 59 rules applied. Total rules applied 118 place count 238 transition count 213
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 118 place count 238 transition count 174
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 196 place count 199 transition count 174
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 84
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 364 place count 115 transition count 90
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 365 place count 115 transition count 89
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 367 place count 114 transition count 88
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 395 place count 100 transition count 97
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 397 place count 98 transition count 95
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 399 place count 96 transition count 95
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 399 place count 96 transition count 94
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 401 place count 95 transition count 94
Applied a total of 401 rules in 23 ms. Remains 95 /298 variables (removed 203) and now considering 94/273 (removed 179) transitions.
// Phase 1: matrix 94 rows 95 cols
[2024-05-29 03:02:24] [INFO ] Computed 44 invariants in 1 ms
[2024-05-29 03:02:24] [INFO ] Implicit Places using invariants in 60 ms returned [84]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 62 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 94/298 places, 94/273 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 93 transition count 93
Applied a total of 2 rules in 3 ms. Remains 93 /94 variables (removed 1) and now considering 93/94 (removed 1) transitions.
// Phase 1: matrix 93 rows 93 cols
[2024-05-29 03:02:24] [INFO ] Computed 43 invariants in 1 ms
[2024-05-29 03:02:24] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-29 03:02:24] [INFO ] Invariant cache hit.
[2024-05-29 03:02:24] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 03:02:24] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 93/298 places, 93/273 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 228 ms. Remains : 93/298 places, 93/273 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/93 stabilizing places and 2/93 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p2 (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 7 factoid took 373 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 3) seen :1
Finished Best-First random walk after 961 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=320 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p2 (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1)), (F (AND (NOT p0) p2 p1))]
Knowledge based reduction with 7 factoid took 551 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
Stuttering acceptance computed with spot in 111 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
Stuttering acceptance computed with spot in 138 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2))]
Product exploration explored 100000 steps with 1 reset in 236 ms.
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-005B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-005B-LTLFireability-12 finished in 6864 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)||(p0&&F(p1)))) U (X(G((G(p0)||(p0&&F(p1)))))||(p2&&X((G(p0)||(p0&&F(p1))))))) U (!p1 U p3))))'
Support contains 4 out of 303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 278/278 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 298 transition count 273
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 298 transition count 273
Applied a total of 10 rules in 13 ms. Remains 298 /303 variables (removed 5) and now considering 273/278 (removed 5) transitions.
// Phase 1: matrix 273 rows 298 cols
[2024-05-29 03:02:26] [INFO ] Computed 46 invariants in 2 ms
[2024-05-29 03:02:26] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-29 03:02:26] [INFO ] Invariant cache hit.
[2024-05-29 03:02:26] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
[2024-05-29 03:02:26] [INFO ] Invariant cache hit.
[2024-05-29 03:02:26] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 298/303 places, 273/278 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 432 ms. Remains : 298/303 places, 273/278 transitions.
Stuttering acceptance computed with spot in 535 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), true, (NOT p3), (NOT p3), (NOT p3), (NOT p3), (OR (NOT p0) (NOT p3)), (OR (NOT p0) (NOT p3)), (OR (NOT p3) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (NOT p3)), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-005B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p3) p1 p2), acceptance={} source=4 dest: 7}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p3) p1 (NOT p0)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 6}, { cond=(AND (NOT p3) p1 p2 p0), acceptance={0} source=5 dest: 7}, { cond=(AND (NOT p3) p1 (NOT p2) p0), acceptance={0} source=5 dest: 8}], [{ cond=(AND (NOT p3) p1), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p3) (NOT p1)), acceptance={0} source=6 dest: 6}], [{ cond=(AND p3 (NOT p1) p0), acceptance={0} source=7 dest: 1}, { cond=(NOT p0), acceptance={0} source=7 dest: 2}, { cond=(AND (NOT p3) p1 p2 p0), acceptance={0} source=7 dest: 7}, { cond=(AND (NOT p3) p1 (NOT p2) p0), acceptance={0} source=7 dest: 8}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={0} source=7 dest: 9}], [{ cond=(NOT p0), acceptance={0} source=8 dest: 2}, { cond=(AND (NOT p3) p2 p0), acceptance={0} source=8 dest: 7}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={0} source=8 dest: 8}, { cond=(AND p3 (NOT p2) p0), acceptance={0} source=8 dest: 11}, { cond=(AND p3 p2 p0), acceptance={0} source=8 dest: 12}], [{ cond=(AND p3 (NOT p1) (NOT p0)), acceptance={0} source=9 dest: 0}, { cond=(AND p3 (NOT p1) p0), acceptance={0} source=9 dest: 1}, { cond=(AND (NOT p3) p1 (NOT p0)), acceptance={0} source=9 dest: 2}, { cond=(AND (NOT p3) p1 p2 p0), acceptance={0} source=9 dest: 7}, { cond=(AND (NOT p3) p1 (NOT p2) p0), acceptance={0} source=9 dest: 8}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={0} source=9 dest: 9}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={0} source=9 dest: 10}], [{ cond=(AND p3 (NOT p1)), acceptance={0} source=10 dest: 0}, { cond=(AND (NOT p3) p1), acceptance={0} source=10 dest: 2}, { cond=(AND (NOT p3) (NOT p1)), acceptance={0} source=10 dest: 10}], [{ cond=(NOT p0), acceptance={} source=11 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=11 dest: 11}, { cond=(AND p2 p0), acceptance={} source=11 dest: 12}], [{ cond=(AND (NOT p1) p0), acceptance={} source=12 dest: 1}, { cond=(NOT p0), acceptance={} source=12 dest: 2}]], initial=3, aps=[p1:(NEQ s229 1), p0:(NEQ s271 1), p3:(EQ s239 1), p2:(NEQ s280 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 784 reset in 215 ms.
Stack based approach found an accepted trace after 1318 steps with 10 reset with depth 121 and stack size 121 in 3 ms.
FORMULA ShieldIIPt-PT-005B-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-005B-LTLFireability-13 finished in 1233 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))))'
Support contains 1 out of 303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 278/278 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 297 transition count 272
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 297 transition count 272
Applied a total of 12 rules in 11 ms. Remains 297 /303 variables (removed 6) and now considering 272/278 (removed 6) transitions.
// Phase 1: matrix 272 rows 297 cols
[2024-05-29 03:02:27] [INFO ] Computed 46 invariants in 3 ms
[2024-05-29 03:02:27] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-29 03:02:27] [INFO ] Invariant cache hit.
[2024-05-29 03:02:27] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
[2024-05-29 03:02:27] [INFO ] Invariant cache hit.
[2024-05-29 03:02:28] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 297/303 places, 272/278 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 436 ms. Remains : 297/303 places, 272/278 transitions.
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-005B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s51 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 845 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-005B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-005B-LTLFireability-14 finished in 586 ms.
All properties solved by simple procedures.
Total runtime 26939 ms.

BK_STOP 1716951749140

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is ShieldIIPt-PT-005B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r373-tall-171683788700158"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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