About the Execution of 2023-gold for ShieldPPPt-PT-002B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 523.443 | 17505.00 | 28756.00 | 417.50 | FFFFFTFFFTFFFFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r373-tall-171683789100348.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 ShieldPPPt-PT-002B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683789100348
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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.3K Apr 23 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Apr 11 14:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 14:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 14:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 103K Apr 11 14:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 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 37K 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 ShieldPPPt-PT-002B-LTLFireability-00
FORMULA_NAME ShieldPPPt-PT-002B-LTLFireability-01
FORMULA_NAME ShieldPPPt-PT-002B-LTLFireability-02
FORMULA_NAME ShieldPPPt-PT-002B-LTLFireability-03
FORMULA_NAME ShieldPPPt-PT-002B-LTLFireability-04
FORMULA_NAME ShieldPPPt-PT-002B-LTLFireability-05
FORMULA_NAME ShieldPPPt-PT-002B-LTLFireability-06
FORMULA_NAME ShieldPPPt-PT-002B-LTLFireability-07
FORMULA_NAME ShieldPPPt-PT-002B-LTLFireability-08
FORMULA_NAME ShieldPPPt-PT-002B-LTLFireability-09
FORMULA_NAME ShieldPPPt-PT-002B-LTLFireability-10
FORMULA_NAME ShieldPPPt-PT-002B-LTLFireability-11
FORMULA_NAME ShieldPPPt-PT-002B-LTLFireability-12
FORMULA_NAME ShieldPPPt-PT-002B-LTLFireability-13
FORMULA_NAME ShieldPPPt-PT-002B-LTLFireability-14
FORMULA_NAME ShieldPPPt-PT-002B-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716983040328
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=ShieldPPPt-PT-002B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-29 11:44:02] [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 11:44:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 11:44:02] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2024-05-29 11:44:02] [INFO ] Transformed 159 places.
[2024-05-29 11:44:02] [INFO ] Transformed 145 transitions.
[2024-05-29 11:44:02] [INFO ] Found NUPN structural information;
[2024-05-29 11:44:02] [INFO ] Parsed PT model containing 159 places and 145 transitions and 362 arcs in 142 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldPPPt-PT-002B-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-002B-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-002B-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 145/145 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 143 transition count 129
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 143 transition count 129
Applied a total of 32 rules in 33 ms. Remains 143 /159 variables (removed 16) and now considering 129/145 (removed 16) transitions.
// Phase 1: matrix 129 rows 143 cols
[2024-05-29 11:44:02] [INFO ] Computed 23 invariants in 12 ms
[2024-05-29 11:44:02] [INFO ] Implicit Places using invariants in 221 ms returned []
[2024-05-29 11:44:02] [INFO ] Invariant cache hit.
[2024-05-29 11:44:03] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
[2024-05-29 11:44:03] [INFO ] Invariant cache hit.
[2024-05-29 11:44:03] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 143/159 places, 129/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 499 ms. Remains : 143/159 places, 129/145 transitions.
Support contains 34 out of 143 places after structural reductions.
[2024-05-29 11:44:03] [INFO ] Flatten gal took : 33 ms
[2024-05-29 11:44:03] [INFO ] Flatten gal took : 13 ms
[2024-05-29 11:44:03] [INFO ] Input system was already deterministic with 129 transitions.
Finished random walk after 5572 steps, including 1 resets, run visited all 33 properties in 186 ms. (steps per millisecond=29 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 33 stabilizing places and 33 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 129/129 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 142 transition count 100
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 30 rules applied. Total rules applied 58 place count 114 transition count 98
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 59 place count 113 transition count 98
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 59 place count 113 transition count 85
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 85 place count 100 transition count 85
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 91 place count 94 transition count 79
Iterating global reduction 3 with 6 rules applied. Total rules applied 97 place count 94 transition count 79
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 97 place count 94 transition count 74
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 107 place count 89 transition count 74
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 167 place count 59 transition count 44
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 177 place count 54 transition count 44
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 179 place count 52 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 180 place count 51 transition count 42
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 180 place count 51 transition count 40
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 184 place count 49 transition count 40
Applied a total of 184 rules in 34 ms. Remains 49 /143 variables (removed 94) and now considering 40/129 (removed 89) transitions.
// Phase 1: matrix 40 rows 49 cols
[2024-05-29 11:44:04] [INFO ] Computed 22 invariants in 0 ms
[2024-05-29 11:44:04] [INFO ] Implicit Places using invariants in 55 ms returned [32, 36]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 57 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/143 places, 40/129 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 45 transition count 38
Applied a total of 4 rules in 3 ms. Remains 45 /47 variables (removed 2) and now considering 38/40 (removed 2) transitions.
// Phase 1: matrix 38 rows 45 cols
[2024-05-29 11:44:04] [INFO ] Computed 20 invariants in 1 ms
[2024-05-29 11:44:04] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-29 11:44:04] [INFO ] Invariant cache hit.
[2024-05-29 11:44:04] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 45/143 places, 38/129 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 188 ms. Remains : 45/143 places, 38/129 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 218 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-002B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s5 1) (NEQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1389 reset in 329 ms.
Stack based approach found an accepted trace after 390 steps with 4 reset with depth 120 and stack size 118 in 4 ms.
FORMULA ShieldPPPt-PT-002B-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-002B-LTLFireability-00 finished in 800 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))||((p1 U G(p2))&&X(p3))))'
Support contains 5 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 129/129 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 138 transition count 124
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 138 transition count 124
Applied a total of 10 rules in 11 ms. Remains 138 /143 variables (removed 5) and now considering 124/129 (removed 5) transitions.
// Phase 1: matrix 124 rows 138 cols
[2024-05-29 11:44:04] [INFO ] Computed 23 invariants in 2 ms
[2024-05-29 11:44:04] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-29 11:44:04] [INFO ] Invariant cache hit.
[2024-05-29 11:44:05] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2024-05-29 11:44:05] [INFO ] Invariant cache hit.
[2024-05-29 11:44:05] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 138/143 places, 124/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 304 ms. Remains : 138/143 places, 124/129 transitions.
Stuttering acceptance computed with spot in 365 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-002B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 3}, { cond=p1, acceptance={} source=0 dest: 4}, { cond=(OR p2 p1), acceptance={} source=0 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=5 dest: 1}, { cond=(NOT p3), acceptance={} source=5 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 1}, { cond=(NOT p2), acceptance={} source=7 dest: 2}, { cond=p2, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (EQ s94 1) (EQ s96 1)), p2:(EQ s91 1), p1:(EQ s53 1), p3:(EQ s107 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 331 reset in 209 ms.
Stack based approach found an accepted trace after 798 steps with 2 reset with depth 65 and stack size 65 in 2 ms.
FORMULA ShieldPPPt-PT-002B-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-002B-LTLFireability-01 finished in 910 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(X(p1)&&(p2 U G(p3)))))'
Support contains 3 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 129/129 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 137 transition count 123
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 137 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 136 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 136 transition count 122
Applied a total of 14 rules in 17 ms. Remains 136 /143 variables (removed 7) and now considering 122/129 (removed 7) transitions.
// Phase 1: matrix 122 rows 136 cols
[2024-05-29 11:44:05] [INFO ] Computed 23 invariants in 2 ms
[2024-05-29 11:44:05] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-29 11:44:05] [INFO ] Invariant cache hit.
[2024-05-29 11:44:05] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2024-05-29 11:44:05] [INFO ] Invariant cache hit.
[2024-05-29 11:44:06] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 136/143 places, 122/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 323 ms. Remains : 136/143 places, 122/129 transitions.
Stuttering acceptance computed with spot in 294 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) p1 (NOT p3))), (AND (NOT p3) (NOT p0) p1), true, (NOT p3), (NOT p3)]
Running random walk in product with property : ShieldPPPt-PT-002B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(OR p3 p2), acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}, { cond=(AND p3 (NOT p2)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0) p1), acceptance={} source=3 dest: 5}, { cond=(AND p3 (NOT p2) (NOT p0)), acceptance={} source=3 dest: 6}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p3) (NOT p0) p1), acceptance={} source=4 dest: 5}, { cond=(AND p3 (NOT p0)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p3), acceptance={} source=6 dest: 5}, { cond=p3, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=7 dest: 5}, { cond=(AND p3 (NOT p2)), acceptance={} source=7 dest: 6}, { cond=(AND p3 p2), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p3) p2), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p3:(EQ s47 1), p2:(EQ s17 1), p0:(EQ s124 1), p1:(AND (EQ s17 1) (EQ s47 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-002B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-002B-LTLFireability-02 finished in 639 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(p1)&&p0) U p2)))'
Support contains 3 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 129/129 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 136 transition count 122
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 136 transition count 122
Applied a total of 14 rules in 7 ms. Remains 136 /143 variables (removed 7) and now considering 122/129 (removed 7) transitions.
// Phase 1: matrix 122 rows 136 cols
[2024-05-29 11:44:06] [INFO ] Computed 23 invariants in 3 ms
[2024-05-29 11:44:06] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-29 11:44:06] [INFO ] Invariant cache hit.
[2024-05-29 11:44:06] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2024-05-29 11:44:06] [INFO ] Invariant cache hit.
[2024-05-29 11:44:06] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 136/143 places, 122/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 232 ms. Remains : 136/143 places, 122/129 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p2), (NOT p2), true, (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-002B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s107 1), p0:(AND (EQ s26 1) (EQ s44 1)), p1:(AND (EQ s26 1) (EQ s44 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-002B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-002B-LTLFireability-03 finished in 385 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U ((p1||X(!p2)) U X(p3))))'
Support contains 6 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 129/129 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 136 transition count 122
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 136 transition count 122
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 135 transition count 121
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 135 transition count 121
Applied a total of 16 rules in 8 ms. Remains 135 /143 variables (removed 8) and now considering 121/129 (removed 8) transitions.
// Phase 1: matrix 121 rows 135 cols
[2024-05-29 11:44:06] [INFO ] Computed 23 invariants in 1 ms
[2024-05-29 11:44:06] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-29 11:44:06] [INFO ] Invariant cache hit.
[2024-05-29 11:44:07] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2024-05-29 11:44:07] [INFO ] Invariant cache hit.
[2024-05-29 11:44:07] [INFO ] Dead Transitions using invariants and state equation in 163 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 135/143 places, 121/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 375 ms. Remains : 135/143 places, 121/129 transitions.
Stuttering acceptance computed with spot in 219 ms :[(NOT p3), (AND (NOT p0) p2 (NOT p3)), (NOT p3), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-002B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(NOT p3), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s42 1), p0:(EQ s51 1), p2:(AND (EQ s26 1) (EQ s44 1)), p3:(AND (EQ s13 1) (EQ s66 1) (EQ s42 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33226 reset in 139 ms.
Product exploration explored 100000 steps with 33495 reset in 151 ms.
Computed a total of 30 stabilizing places and 30 stable transitions
Computed a total of 30 stabilizing places and 30 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (X (NOT p3)), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (AND (NOT p1) (NOT p0) (NOT p3))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0) (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 105 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(NOT p3), (AND (NOT p0) p2 (NOT p3)), (NOT p3), (NOT p0)]
Finished random walk after 1644 steps, including 0 resets, run visited all 4 properties in 15 ms. (steps per millisecond=109 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (X (NOT p3)), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (AND (NOT p1) (NOT p0) (NOT p3))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0) (NOT p3))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p0) p2 (NOT p3))), (F p3), (F (NOT (AND (NOT p0) (NOT p3) (NOT p1))))]
Knowledge based reduction with 8 factoid took 186 ms. Reduced automaton from 4 states, 5 edges and 4 AP (stutter sensitive) to 4 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[(NOT p3), (AND (NOT p0) p2 (NOT p3)), (NOT p3), (NOT p0)]
Stuttering acceptance computed with spot in 175 ms :[(NOT p3), (AND (NOT p0) p2 (NOT p3)), (NOT p3), (NOT p0)]
[2024-05-29 11:44:08] [INFO ] Invariant cache hit.
Proved EG (NOT p3)
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (X (NOT p3)), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (AND (NOT p1) (NOT p0) (NOT p3))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0) (NOT p3))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p0) p2 (NOT p3))), (F p3), (F (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (G (NOT p3))]
Property proved to be false thanks to negative knowledge :(G (NOT p3))
Knowledge based reduction with 8 factoid took 216 ms. Reduced automaton from 4 states, 5 edges and 4 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-002B-LTLFireability-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-002B-LTLFireability-04 finished in 2148 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((F(p0)&&(p1||G(p2))))))'
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 129/129 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 136 transition count 122
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 136 transition count 122
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 135 transition count 121
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 135 transition count 121
Applied a total of 16 rules in 7 ms. Remains 135 /143 variables (removed 8) and now considering 121/129 (removed 8) transitions.
[2024-05-29 11:44:08] [INFO ] Invariant cache hit.
[2024-05-29 11:44:09] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-29 11:44:09] [INFO ] Invariant cache hit.
[2024-05-29 11:44:09] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
[2024-05-29 11:44:09] [INFO ] Invariant cache hit.
[2024-05-29 11:44:09] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 135/143 places, 121/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 247 ms. Remains : 135/143 places, 121/129 transitions.
Stuttering acceptance computed with spot in 246 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-002B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s67 0), p2:(EQ s67 1), p0:(EQ s90 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 200 ms.
Product exploration explored 100000 steps with 50000 reset in 172 ms.
Computed a total of 30 stabilizing places and 30 stable transitions
Computed a total of 30 stabilizing places and 30 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT (AND (NOT p1) p2))), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p0)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 121 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-002B-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-002B-LTLFireability-05 finished in 1010 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((G(F(p0)) U !p0)))))'
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 129/129 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 137 transition count 123
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 137 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 136 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 136 transition count 122
Applied a total of 14 rules in 6 ms. Remains 136 /143 variables (removed 7) and now considering 122/129 (removed 7) transitions.
// Phase 1: matrix 122 rows 136 cols
[2024-05-29 11:44:09] [INFO ] Computed 23 invariants in 1 ms
[2024-05-29 11:44:10] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-29 11:44:10] [INFO ] Invariant cache hit.
[2024-05-29 11:44:10] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2024-05-29 11:44:10] [INFO ] Invariant cache hit.
[2024-05-29 11:44:10] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 136/143 places, 122/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 249 ms. Remains : 136/143 places, 122/129 transitions.
Stuttering acceptance computed with spot in 246 ms :[p0, p0, p0, (NOT p0), p0, (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-002B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={0} source=4 dest: 3}, { cond=p0, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s128 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 231 reset in 156 ms.
Stack based approach found an accepted trace after 3664 steps with 8 reset with depth 644 and stack size 644 in 6 ms.
FORMULA ShieldPPPt-PT-002B-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-002B-LTLFireability-07 finished in 678 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(G(p1)||X(p2))))'
Support contains 4 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 129/129 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 137 transition count 123
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 137 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 136 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 136 transition count 122
Applied a total of 14 rules in 8 ms. Remains 136 /143 variables (removed 7) and now considering 122/129 (removed 7) transitions.
// Phase 1: matrix 122 rows 136 cols
[2024-05-29 11:44:10] [INFO ] Computed 23 invariants in 1 ms
[2024-05-29 11:44:10] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-29 11:44:10] [INFO ] Invariant cache hit.
[2024-05-29 11:44:10] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2024-05-29 11:44:10] [INFO ] Invariant cache hit.
[2024-05-29 11:44:10] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 136/143 places, 122/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 235 ms. Remains : 136/143 places, 122/129 transitions.
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (AND (NOT p1) (NOT p2)), true, (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-002B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s133 1), p1:(EQ s61 1), p2:(OR (EQ s40 0) (EQ s90 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3994 reset in 125 ms.
Product exploration explored 100000 steps with 3997 reset in 162 ms.
Computed a total of 30 stabilizing places and 30 stable transitions
Computed a total of 30 stabilizing places and 30 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p0)), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), true, (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 144 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Finished random walk after 46 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=23 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p0)), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), true, (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 8 factoid took 115 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 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
[2024-05-29 11:44:11] [INFO ] Invariant cache hit.
[2024-05-29 11:44:11] [INFO ] [Real]Absence check using 23 positive place invariants in 5 ms returned sat
[2024-05-29 11:44:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 11:44:11] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2024-05-29 11:44:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 11:44:12] [INFO ] [Nat]Absence check using 23 positive place invariants in 5 ms returned sat
[2024-05-29 11:44:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 11:44:12] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2024-05-29 11:44:12] [INFO ] Computed and/alt/rep : 121/180/121 causal constraints (skipped 0 transitions) in 18 ms.
[2024-05-29 11:44:12] [INFO ] Added : 110 causal constraints over 22 iterations in 309 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 136 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 122/122 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 135 transition count 98
Reduce places removed 23 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 24 rules applied. Total rules applied 47 place count 112 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 48 place count 111 transition count 97
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 48 place count 111 transition count 80
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 82 place count 94 transition count 80
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 146 place count 62 transition count 48
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 147 place count 62 transition count 47
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 149 place count 61 transition count 46
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 157 place count 57 transition count 46
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 159 place count 55 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 160 place count 54 transition count 44
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 160 place count 54 transition count 42
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 164 place count 52 transition count 42
Applied a total of 164 rules in 22 ms. Remains 52 /136 variables (removed 84) and now considering 42/122 (removed 80) transitions.
// Phase 1: matrix 42 rows 52 cols
[2024-05-29 11:44:12] [INFO ] Computed 22 invariants in 1 ms
[2024-05-29 11:44:12] [INFO ] Implicit Places using invariants in 40 ms returned [33, 37]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 41 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/136 places, 42/122 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 49 transition count 41
Applied a total of 2 rules in 2 ms. Remains 49 /50 variables (removed 1) and now considering 41/42 (removed 1) transitions.
// Phase 1: matrix 41 rows 49 cols
[2024-05-29 11:44:12] [INFO ] Computed 20 invariants in 3 ms
[2024-05-29 11:44:12] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-29 11:44:12] [INFO ] Invariant cache hit.
[2024-05-29 11:44:12] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 49/136 places, 41/122 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 178 ms. Remains : 49/136 places, 41/122 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 107 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 33 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), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 148 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 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
[2024-05-29 11:44:12] [INFO ] Invariant cache hit.
[2024-05-29 11:44:13] [INFO ] [Real]Absence check using 20 positive place invariants in 3 ms returned sat
[2024-05-29 11:44:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 11:44:13] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-29 11:44:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 11:44:13] [INFO ] [Nat]Absence check using 20 positive place invariants in 2 ms returned sat
[2024-05-29 11:44:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 11:44:13] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-29 11:44:13] [INFO ] Computed and/alt/rep : 37/60/37 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-29 11:44:13] [INFO ] Added : 36 causal constraints over 8 iterations in 40 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Product exploration explored 100000 steps with 14642 reset in 126 ms.
Product exploration explored 100000 steps with 14626 reset in 136 ms.
Built C files in :
/tmp/ltsmin10668816116915924946
[2024-05-29 11:44:13] [INFO ] Computing symmetric may disable matrix : 41 transitions.
[2024-05-29 11:44:13] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 11:44:13] [INFO ] Computing symmetric may enable matrix : 41 transitions.
[2024-05-29 11:44:13] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 11:44:13] [INFO ] Computing Do-Not-Accords matrix : 41 transitions.
[2024-05-29 11:44:13] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 11:44:13] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10668816116915924946
Running compilation step : cd /tmp/ltsmin10668816116915924946;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 336 ms.
Running link step : cd /tmp/ltsmin10668816116915924946;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin10668816116915924946;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9930235060790565144.hoa' '--buchi-type=spotba'
LTSmin run took 123 ms.
FORMULA ShieldPPPt-PT-002B-LTLFireability-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPt-PT-002B-LTLFireability-08 finished in 3363 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U X((!p0||(p1&&F(G(p2))))))))'
Support contains 3 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 129/129 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 137 transition count 123
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 137 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 136 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 136 transition count 122
Applied a total of 14 rules in 6 ms. Remains 136 /143 variables (removed 7) and now considering 122/129 (removed 7) transitions.
// Phase 1: matrix 122 rows 136 cols
[2024-05-29 11:44:14] [INFO ] Computed 23 invariants in 2 ms
[2024-05-29 11:44:14] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-29 11:44:14] [INFO ] Invariant cache hit.
[2024-05-29 11:44:14] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2024-05-29 11:44:14] [INFO ] Invariant cache hit.
[2024-05-29 11:44:14] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 136/143 places, 122/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 306 ms. Remains : 136/143 places, 122/129 transitions.
Stuttering acceptance computed with spot in 255 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), true, (NOT p2), (AND p0 (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-002B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p0 p1), acceptance={} source=2 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p2, acceptance={} source=5 dest: 5}, { cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=(AND p0 p2), acceptance={} source=6 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s59 1), p1:(NEQ s55 1), p2:(NEQ s40 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 120 ms.
Product exploration explored 100000 steps with 33333 reset in 116 ms.
Computed a total of 30 stabilizing places and 30 stable transitions
Computed a total of 30 stabilizing places and 30 stable transitions
Detected a total of 30/136 stabilizing places and 30/122 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 20 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-002B-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-002B-LTLFireability-09 finished in 839 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)))&&F(p1)))'
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 129/129 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 137 transition count 123
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 137 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 136 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 136 transition count 122
Applied a total of 14 rules in 5 ms. Remains 136 /143 variables (removed 7) and now considering 122/129 (removed 7) transitions.
// Phase 1: matrix 122 rows 136 cols
[2024-05-29 11:44:14] [INFO ] Computed 23 invariants in 1 ms
[2024-05-29 11:44:14] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-29 11:44:14] [INFO ] Invariant cache hit.
[2024-05-29 11:44:15] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2024-05-29 11:44:15] [INFO ] Invariant cache hit.
[2024-05-29 11:44:15] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 136/143 places, 122/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 244 ms. Remains : 136/143 places, 122/129 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), true]
Running random walk in product with property : ShieldPPPt-PT-002B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s50 0), p0:(EQ s57 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 92 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-002B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-002B-LTLFireability-10 finished in 414 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(G(p1) U p2)))))'
Support contains 5 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 129/129 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 143 transition count 102
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 29 rules applied. Total rules applied 56 place count 116 transition count 100
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 60 place count 115 transition count 97
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 63 place count 112 transition count 97
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 63 place count 112 transition count 87
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 83 place count 102 transition count 87
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 89 place count 96 transition count 81
Iterating global reduction 4 with 6 rules applied. Total rules applied 95 place count 96 transition count 81
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 95 place count 96 transition count 76
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 105 place count 91 transition count 76
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 163 place count 62 transition count 47
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 173 place count 57 transition count 47
Applied a total of 173 rules in 20 ms. Remains 57 /143 variables (removed 86) and now considering 47/129 (removed 82) transitions.
// Phase 1: matrix 47 rows 57 cols
[2024-05-29 11:44:15] [INFO ] Computed 23 invariants in 0 ms
[2024-05-29 11:44:15] [INFO ] Implicit Places using invariants in 42 ms returned [49]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 43 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/143 places, 47/129 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 56 transition count 45
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 54 transition count 45
Applied a total of 4 rules in 2 ms. Remains 54 /56 variables (removed 2) and now considering 45/47 (removed 2) transitions.
// Phase 1: matrix 45 rows 54 cols
[2024-05-29 11:44:15] [INFO ] Computed 22 invariants in 0 ms
[2024-05-29 11:44:15] [INFO ] Implicit Places using invariants in 40 ms returned [35, 40]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 52 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 52/143 places, 45/129 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 50 transition count 43
Applied a total of 4 rules in 3 ms. Remains 50 /52 variables (removed 2) and now considering 43/45 (removed 2) transitions.
// Phase 1: matrix 43 rows 50 cols
[2024-05-29 11:44:15] [INFO ] Computed 20 invariants in 1 ms
[2024-05-29 11:44:15] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-29 11:44:15] [INFO ] Invariant cache hit.
[2024-05-29 11:44:15] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-29 11:44:15] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 50/143 places, 43/129 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 228 ms. Remains : 50/143 places, 43/129 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2)]
Running random walk in product with property : ShieldPPPt-PT-002B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(OR (AND p2 p0) (AND p0 p1)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1)) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p2) p0 p1), acceptance={0, 1} source=0 dest: 2}], [{ cond=(AND p2 p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p1))), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p2 p0 p1), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p0) p1)), acceptance={1} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p2:(EQ s23 1), p0:(OR (EQ s37 0) (EQ s35 0) (EQ s47 0)), p1:(EQ s30 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 18150 steps with 0 reset in 46 ms.
FORMULA ShieldPPPt-PT-002B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-002B-LTLFireability-11 finished in 419 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(G(p1)))))'
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 129/129 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 136 transition count 122
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 136 transition count 122
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 135 transition count 121
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 135 transition count 121
Applied a total of 16 rules in 12 ms. Remains 135 /143 variables (removed 8) and now considering 121/129 (removed 8) transitions.
// Phase 1: matrix 121 rows 135 cols
[2024-05-29 11:44:15] [INFO ] Computed 23 invariants in 2 ms
[2024-05-29 11:44:15] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-29 11:44:15] [INFO ] Invariant cache hit.
[2024-05-29 11:44:15] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2024-05-29 11:44:15] [INFO ] Invariant cache hit.
[2024-05-29 11:44:15] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 135/143 places, 121/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 254 ms. Remains : 135/143 places, 121/129 transitions.
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-002B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(EQ s68 1), p1:(EQ s68 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1 reset in 144 ms.
Stack based approach found an accepted trace after 964 steps with 0 reset with depth 965 and stack size 965 in 2 ms.
FORMULA ShieldPPPt-PT-002B-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-002B-LTLFireability-12 finished in 534 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 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 129/129 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 136 transition count 122
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 136 transition count 122
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 135 transition count 121
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 135 transition count 121
Applied a total of 16 rules in 3 ms. Remains 135 /143 variables (removed 8) and now considering 121/129 (removed 8) transitions.
[2024-05-29 11:44:16] [INFO ] Invariant cache hit.
[2024-05-29 11:44:16] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-29 11:44:16] [INFO ] Invariant cache hit.
[2024-05-29 11:44:16] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
[2024-05-29 11:44:16] [INFO ] Invariant cache hit.
[2024-05-29 11:44:16] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 135/143 places, 121/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 277 ms. Remains : 135/143 places, 121/129 transitions.
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-002B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s46 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-002B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-002B-LTLFireability-14 finished in 375 ms.
All properties solved by simple procedures.
Total runtime 14232 ms.
BK_STOP 1716983057833
--------------------
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="ShieldPPPt-PT-002B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is ShieldPPPt-PT-002B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r373-tall-171683789100348"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-002B.tgz
mv ShieldPPPt-PT-002B execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
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 ;