Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r391-oct2-167903714800028.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is ShieldIIPs-PT-002B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r391-oct2-167903714800028
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 6.5K Feb 25 15:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 15:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 15:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 25 15:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 15:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 25 15:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 15:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 25 15:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 33K Mar 5 18:23 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 ShieldIIPs-PT-002B-LTLFireability-00
FORMULA_NAME ShieldIIPs-PT-002B-LTLFireability-01
FORMULA_NAME ShieldIIPs-PT-002B-LTLFireability-02
FORMULA_NAME ShieldIIPs-PT-002B-LTLFireability-03
FORMULA_NAME ShieldIIPs-PT-002B-LTLFireability-04
FORMULA_NAME ShieldIIPs-PT-002B-LTLFireability-05
FORMULA_NAME ShieldIIPs-PT-002B-LTLFireability-06
FORMULA_NAME ShieldIIPs-PT-002B-LTLFireability-07
FORMULA_NAME ShieldIIPs-PT-002B-LTLFireability-08
FORMULA_NAME ShieldIIPs-PT-002B-LTLFireability-09
FORMULA_NAME ShieldIIPs-PT-002B-LTLFireability-10
FORMULA_NAME ShieldIIPs-PT-002B-LTLFireability-11
FORMULA_NAME ShieldIIPs-PT-002B-LTLFireability-12
FORMULA_NAME ShieldIIPs-PT-002B-LTLFireability-13
FORMULA_NAME ShieldIIPs-PT-002B-LTLFireability-14
FORMULA_NAME ShieldIIPs-PT-002B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679265297216

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-002B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 22:35:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 22:35:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 22:35:00] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2023-03-19 22:35:00] [INFO ] Transformed 123 places.
[2023-03-19 22:35:00] [INFO ] Transformed 121 transitions.
[2023-03-19 22:35:00] [INFO ] Found NUPN structural information;
[2023-03-19 22:35:00] [INFO ] Parsed PT model containing 123 places and 121 transitions and 362 arcs in 176 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 ShieldIIPs-PT-002B-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-002B-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 121/121 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 116 transition count 114
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 116 transition count 114
Applied a total of 14 rules in 22 ms. Remains 116 /123 variables (removed 7) and now considering 114/121 (removed 7) transitions.
// Phase 1: matrix 114 rows 116 cols
[2023-03-19 22:35:00] [INFO ] Computed 19 place invariants in 6 ms
[2023-03-19 22:35:01] [INFO ] Implicit Places using invariants in 311 ms returned []
[2023-03-19 22:35:01] [INFO ] Invariant cache hit.
[2023-03-19 22:35:01] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 648 ms to find 0 implicit places.
[2023-03-19 22:35:01] [INFO ] Invariant cache hit.
[2023-03-19 22:35:01] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 116/123 places, 114/121 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 804 ms. Remains : 116/123 places, 114/121 transitions.
Support contains 35 out of 116 places after structural reductions.
[2023-03-19 22:35:01] [INFO ] Flatten gal took : 30 ms
[2023-03-19 22:35:01] [INFO ] Flatten gal took : 16 ms
[2023-03-19 22:35:01] [INFO ] Input system was already deterministic with 114 transitions.
Support contains 33 out of 116 places (down from 35) after GAL structural reductions.
Finished random walk after 6102 steps, including 18 resets, run visited all 32 properties in 102 ms. (steps per millisecond=59 )
Computed a total of 27 stabilizing places and 27 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 116/116 places, 114/114 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 115 transition count 102
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 104 transition count 102
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 22 place count 104 transition count 91
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 44 place count 93 transition count 91
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 50 place count 87 transition count 85
Iterating global reduction 2 with 6 rules applied. Total rules applied 56 place count 87 transition count 85
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 56 place count 87 transition count 83
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 60 place count 85 transition count 83
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 124 place count 53 transition count 51
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 126 place count 51 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 127 place count 50 transition count 49
Applied a total of 127 rules in 49 ms. Remains 50 /116 variables (removed 66) and now considering 49/114 (removed 65) transitions.
// Phase 1: matrix 49 rows 50 cols
[2023-03-19 22:35:02] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-19 22:35:02] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-19 22:35:02] [INFO ] Invariant cache hit.
[2023-03-19 22:35:02] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
[2023-03-19 22:35:02] [INFO ] Redundant transitions in 30 ms returned [48]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 48 rows 50 cols
[2023-03-19 22:35:02] [INFO ] Computed 18 place invariants in 2 ms
[2023-03-19 22:35:02] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/116 places, 48/114 transitions.
Applied a total of 0 rules in 3 ms. Remains 50 /50 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 417 ms. Remains : 50/116 places, 48/114 transitions.
Stuttering acceptance computed with spot in 271 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-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:(EQ s48 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]]
Stuttering criterion allowed to conclude after 93 steps with 0 reset in 7 ms.
FORMULA ShieldIIPs-PT-002B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-002B-LTLFireability-00 finished in 763 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0)||(p1&&F(p2))) U X(G(!p0))))'
Support contains 4 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 114/114 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 109 transition count 107
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 109 transition count 107
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 108 transition count 106
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 108 transition count 106
Applied a total of 16 rules in 13 ms. Remains 108 /116 variables (removed 8) and now considering 106/114 (removed 8) transitions.
// Phase 1: matrix 106 rows 108 cols
[2023-03-19 22:35:03] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-19 22:35:03] [INFO ] Implicit Places using invariants in 166 ms returned []
[2023-03-19 22:35:03] [INFO ] Invariant cache hit.
[2023-03-19 22:35:03] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
[2023-03-19 22:35:03] [INFO ] Invariant cache hit.
[2023-03-19 22:35:03] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 108/116 places, 106/114 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 404 ms. Remains : 108/116 places, 106/114 transitions.
Stuttering acceptance computed with spot in 578 ms :[p0, (AND (NOT p2) p0), p0, false, false, true, (NOT p2), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 8}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 5}, { cond=p0, acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=8 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=8 dest: 8}]], initial=2, aps=[p0:(NEQ s10 1), p2:(EQ s5 1), p1:(OR (EQ s11 1) (EQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 12 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-002B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-002B-LTLFireability-02 finished in 1027 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G((p1||X(p2)))))'
Support contains 3 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 114/114 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 109 transition count 107
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 109 transition count 107
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 108 transition count 106
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 108 transition count 106
Applied a total of 16 rules in 22 ms. Remains 108 /116 variables (removed 8) and now considering 106/114 (removed 8) transitions.
[2023-03-19 22:35:04] [INFO ] Invariant cache hit.
[2023-03-19 22:35:04] [INFO ] Implicit Places using invariants in 245 ms returned []
[2023-03-19 22:35:04] [INFO ] Invariant cache hit.
[2023-03-19 22:35:04] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
[2023-03-19 22:35:04] [INFO ] Invariant cache hit.
[2023-03-19 22:35:04] [INFO ] Dead Transitions using invariants and state equation in 202 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 108/116 places, 106/114 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 659 ms. Remains : 108/116 places, 106/114 transitions.
Stuttering acceptance computed with spot in 137 ms :[true, (OR (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1 p2), acceptance={0} source=1 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=(AND p1 p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}]], initial=4, aps=[p2:(OR (EQ s73 0) (EQ s97 0)), p0:(AND (EQ s73 1) (EQ s97 1)), p1:(EQ s104 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2324 steps with 6 reset in 34 ms.
FORMULA ShieldIIPs-PT-002B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-002B-LTLFireability-03 finished in 856 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||(G(p2)&&p1))))'
Support contains 5 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 114/114 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 110 transition count 108
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 110 transition count 108
Applied a total of 12 rules in 3 ms. Remains 110 /116 variables (removed 6) and now considering 108/114 (removed 6) transitions.
// Phase 1: matrix 108 rows 110 cols
[2023-03-19 22:35:04] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-19 22:35:05] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-19 22:35:05] [INFO ] Invariant cache hit.
[2023-03-19 22:35:05] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2023-03-19 22:35:05] [INFO ] Invariant cache hit.
[2023-03-19 22:35:05] [INFO ] Dead Transitions using invariants and state equation in 187 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 110/116 places, 108/114 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 372 ms. Remains : 110/116 places, 108/114 transitions.
Stuttering acceptance computed with spot in 128 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s71 1) (EQ s87 1)), p2:(EQ s82 1), p0:(AND (EQ s77 1) (EQ s87 1) (EQ s108 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-002B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-002B-LTLFireability-04 finished in 521 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(p0)||G(p1))))))'
Support contains 2 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 114/114 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 110 transition count 108
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 110 transition count 108
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 109 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 109 transition count 107
Applied a total of 14 rules in 19 ms. Remains 109 /116 variables (removed 7) and now considering 107/114 (removed 7) transitions.
// Phase 1: matrix 107 rows 109 cols
[2023-03-19 22:35:05] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-19 22:35:05] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-19 22:35:05] [INFO ] Invariant cache hit.
[2023-03-19 22:35:05] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
[2023-03-19 22:35:05] [INFO ] Invariant cache hit.
[2023-03-19 22:35:05] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 109/116 places, 107/114 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 440 ms. Remains : 109/116 places, 107/114 transitions.
Stuttering acceptance computed with spot in 297 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=p1, acceptance={} source=4 dest: 2}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}]], initial=6, aps=[p0:(EQ s17 0), p1:(EQ s54 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 608 steps with 1 reset in 3 ms.
FORMULA ShieldIIPs-PT-002B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-002B-LTLFireability-05 finished in 761 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(p1))))'
Support contains 2 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 114/114 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 110 transition count 108
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 110 transition count 108
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 109 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 109 transition count 107
Applied a total of 14 rules in 3 ms. Remains 109 /116 variables (removed 7) and now considering 107/114 (removed 7) transitions.
// Phase 1: matrix 107 rows 109 cols
[2023-03-19 22:35:06] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-19 22:35:06] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-19 22:35:06] [INFO ] Invariant cache hit.
[2023-03-19 22:35:06] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2023-03-19 22:35:06] [INFO ] Invariant cache hit.
[2023-03-19 22:35:06] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 109/116 places, 107/114 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 396 ms. Remains : 109/116 places, 107/114 transitions.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s5 1), p1:(EQ s105 0)], 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 229 ms.
Product exploration explored 100000 steps with 50000 reset in 211 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Detected a total of 23/109 stabilizing places and 23/107 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 4 factoid took 168 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-002B-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-002B-LTLFireability-06 finished in 1139 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&X(G(p1)))))'
Support contains 2 out of 116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 116/116 places, 114/114 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 115 transition count 103
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 105 transition count 103
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 20 place count 105 transition count 92
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 42 place count 94 transition count 92
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 48 place count 88 transition count 86
Iterating global reduction 2 with 6 rules applied. Total rules applied 54 place count 88 transition count 86
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 54 place count 88 transition count 85
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 87 transition count 85
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 120 place count 55 transition count 53
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 122 place count 53 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 123 place count 52 transition count 51
Applied a total of 123 rules in 11 ms. Remains 52 /116 variables (removed 64) and now considering 51/114 (removed 63) transitions.
// Phase 1: matrix 51 rows 52 cols
[2023-03-19 22:35:07] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-19 22:35:07] [INFO ] Implicit Places using invariants in 282 ms returned []
[2023-03-19 22:35:07] [INFO ] Invariant cache hit.
[2023-03-19 22:35:07] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
[2023-03-19 22:35:07] [INFO ] Redundant transitions in 44 ms returned [50]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 50 rows 52 cols
[2023-03-19 22:35:07] [INFO ] Computed 18 place invariants in 0 ms
[2023-03-19 22:35:07] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/116 places, 50/114 transitions.
Applied a total of 0 rules in 2 ms. Remains 52 /52 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 526 ms. Remains : 52/116 places, 50/114 transitions.
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s30 0), p1:(EQ s41 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1419 steps with 45 reset in 2 ms.
FORMULA ShieldIIPs-PT-002B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-002B-LTLFireability-07 finished in 738 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 114/114 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 109 transition count 107
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 109 transition count 107
Applied a total of 14 rules in 2 ms. Remains 109 /116 variables (removed 7) and now considering 107/114 (removed 7) transitions.
// Phase 1: matrix 107 rows 109 cols
[2023-03-19 22:35:08] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-19 22:35:08] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-19 22:35:08] [INFO ] Invariant cache hit.
[2023-03-19 22:35:08] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2023-03-19 22:35:08] [INFO ] Invariant cache hit.
[2023-03-19 22:35:08] [INFO ] Dead Transitions using invariants and state equation in 172 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 109/116 places, 107/114 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 356 ms. Remains : 109/116 places, 107/114 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-002B-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}]], initial=2, aps=[p0:(EQ s81 0)], 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][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 103 ms.
Product exploration explored 100000 steps with 33333 reset in 133 ms.
Computed a total of 24 stabilizing places and 24 stable transitions
Computed a total of 24 stabilizing places and 24 stable transitions
Detected a total of 24/109 stabilizing places and 24/107 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-002B-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-002B-LTLFireability-08 finished in 831 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(G(p1)))))'
Support contains 2 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 114/114 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 109 transition count 107
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 109 transition count 107
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 108 transition count 106
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 108 transition count 106
Applied a total of 16 rules in 4 ms. Remains 108 /116 variables (removed 8) and now considering 106/114 (removed 8) transitions.
// Phase 1: matrix 106 rows 108 cols
[2023-03-19 22:35:08] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-19 22:35:08] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-19 22:35:08] [INFO ] Invariant cache hit.
[2023-03-19 22:35:09] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2023-03-19 22:35:09] [INFO ] Invariant cache hit.
[2023-03-19 22:35:09] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 108/116 places, 106/114 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 190 ms. Remains : 108/116 places, 106/114 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p1:(EQ s53 0), p0:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 152 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-002B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-002B-LTLFireability-09 finished in 356 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||((p0 U p2)&&p1))))'
Support contains 5 out of 116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 116/116 places, 114/114 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 115 transition count 104
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 106 transition count 104
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 18 place count 106 transition count 94
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 38 place count 96 transition count 94
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 44 place count 90 transition count 88
Iterating global reduction 2 with 6 rules applied. Total rules applied 50 place count 90 transition count 88
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 50 place count 90 transition count 86
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 54 place count 88 transition count 86
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 2 with 60 rules applied. Total rules applied 114 place count 58 transition count 56
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 116 place count 56 transition count 54
Applied a total of 116 rules in 26 ms. Remains 56 /116 variables (removed 60) and now considering 54/114 (removed 60) transitions.
// Phase 1: matrix 54 rows 56 cols
[2023-03-19 22:35:09] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-19 22:35:09] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-19 22:35:09] [INFO ] Invariant cache hit.
[2023-03-19 22:35:09] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2023-03-19 22:35:09] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-19 22:35:09] [INFO ] Invariant cache hit.
[2023-03-19 22:35:09] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/116 places, 54/114 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 337 ms. Remains : 56/116 places, 54/114 transitions.
Stuttering acceptance computed with spot in 56 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s3 1), p1:(AND (EQ s40 1) (EQ s50 1) (EQ s55 1) (EQ s17 1)), p2:(EQ s17 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 25795 reset in 193 ms.
Product exploration explored 100000 steps with 25841 reset in 168 ms.
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/56 stabilizing places and 2/54 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))))]
Knowledge based reduction with 2 factoid took 317 ms. Reduced automaton from 1 states, 1 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (F (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 2 factoid took 173 ms. Reduced automaton from 1 states, 1 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 74 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
[2023-03-19 22:35:10] [INFO ] Invariant cache hit.
[2023-03-19 22:35:10] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-03-19 22:35:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 22:35:10] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2023-03-19 22:35:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 22:35:10] [INFO ] [Nat]Absence check using 19 positive place invariants in 6 ms returned sat
[2023-03-19 22:35:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 22:35:11] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2023-03-19 22:35:11] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 5 ms to minimize.
[2023-03-19 22:35:11] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 2 ms to minimize.
[2023-03-19 22:35:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 122 ms
[2023-03-19 22:35:11] [INFO ] Computed and/alt/rep : 49/129/49 causal constraints (skipped 1 transitions) in 6 ms.
[2023-03-19 22:35:11] [INFO ] Added : 24 causal constraints over 5 iterations in 87 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
[2023-03-19 22:35:11] [INFO ] Invariant cache hit.
[2023-03-19 22:35:11] [INFO ] [Real]Absence check using 19 positive place invariants in 5 ms returned sat
[2023-03-19 22:35:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 22:35:11] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-19 22:35:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 22:35:11] [INFO ] [Nat]Absence check using 19 positive place invariants in 6 ms returned sat
[2023-03-19 22:35:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 22:35:11] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-19 22:35:11] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2023-03-19 22:35:11] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2023-03-19 22:35:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 102 ms
[2023-03-19 22:35:11] [INFO ] Computed and/alt/rep : 49/129/49 causal constraints (skipped 1 transitions) in 7 ms.
[2023-03-19 22:35:11] [INFO ] Added : 30 causal constraints over 7 iterations in 119 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 5 out of 56 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 56/56 places, 54/54 transitions.
Applied a total of 0 rules in 4 ms. Remains 56 /56 variables (removed 0) and now considering 54/54 (removed 0) transitions.
[2023-03-19 22:35:11] [INFO ] Invariant cache hit.
[2023-03-19 22:35:11] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-19 22:35:11] [INFO ] Invariant cache hit.
[2023-03-19 22:35:11] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[2023-03-19 22:35:11] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-19 22:35:11] [INFO ] Invariant cache hit.
[2023-03-19 22:35:12] [INFO ] Dead Transitions using invariants and state equation in 222 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 468 ms. Remains : 56/56 places, 54/54 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/56 stabilizing places and 2/54 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))))))]
Knowledge based reduction with 2 factoid took 156 ms. Reduced automaton from 1 states, 1 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2)))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))))), (X (X (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2)))))), (F (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 2 factoid took 201 ms. Reduced automaton from 1 states, 1 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 30 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
[2023-03-19 22:35:12] [INFO ] Invariant cache hit.
[2023-03-19 22:35:12] [INFO ] [Real]Absence check using 19 positive place invariants in 3 ms returned sat
[2023-03-19 22:35:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 22:35:12] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2023-03-19 22:35:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 22:35:12] [INFO ] [Nat]Absence check using 19 positive place invariants in 2 ms returned sat
[2023-03-19 22:35:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 22:35:12] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-19 22:35:12] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 3 ms to minimize.
[2023-03-19 22:35:12] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2023-03-19 22:35:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 56 ms
[2023-03-19 22:35:12] [INFO ] Computed and/alt/rep : 49/129/49 causal constraints (skipped 1 transitions) in 4 ms.
[2023-03-19 22:35:12] [INFO ] Added : 24 causal constraints over 5 iterations in 46 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
[2023-03-19 22:35:12] [INFO ] Invariant cache hit.
[2023-03-19 22:35:13] [INFO ] [Real]Absence check using 19 positive place invariants in 12 ms returned sat
[2023-03-19 22:35:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 22:35:13] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2023-03-19 22:35:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 22:35:13] [INFO ] [Nat]Absence check using 19 positive place invariants in 3 ms returned sat
[2023-03-19 22:35:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 22:35:13] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-19 22:35:13] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2023-03-19 22:35:13] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2023-03-19 22:35:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 73 ms
[2023-03-19 22:35:13] [INFO ] Computed and/alt/rep : 49/129/49 causal constraints (skipped 1 transitions) in 3 ms.
[2023-03-19 22:35:13] [INFO ] Added : 30 causal constraints over 7 iterations in 97 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 41 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Product exploration explored 100000 steps with 25702 reset in 121 ms.
Product exploration explored 100000 steps with 25896 reset in 160 ms.
Support contains 5 out of 56 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 56/56 places, 54/54 transitions.
Applied a total of 0 rules in 3 ms. Remains 56 /56 variables (removed 0) and now considering 54/54 (removed 0) transitions.
[2023-03-19 22:35:13] [INFO ] Invariant cache hit.
[2023-03-19 22:35:13] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-19 22:35:13] [INFO ] Invariant cache hit.
[2023-03-19 22:35:13] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2023-03-19 22:35:13] [INFO ] Redundant transitions in 46 ms returned []
[2023-03-19 22:35:13] [INFO ] Invariant cache hit.
[2023-03-19 22:35:13] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 301 ms. Remains : 56/56 places, 54/54 transitions.
Treatment of property ShieldIIPs-PT-002B-LTLFireability-10 finished in 4728 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0)||(p0 U p1)))))'
Support contains 2 out of 116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 116/116 places, 114/114 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 115 transition count 102
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 104 transition count 102
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 22 place count 104 transition count 91
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 44 place count 93 transition count 91
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 51 place count 86 transition count 84
Iterating global reduction 2 with 7 rules applied. Total rules applied 58 place count 86 transition count 84
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 58 place count 86 transition count 82
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 62 place count 84 transition count 82
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 2 with 58 rules applied. Total rules applied 120 place count 55 transition count 53
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 122 place count 53 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 123 place count 52 transition count 51
Applied a total of 123 rules in 9 ms. Remains 52 /116 variables (removed 64) and now considering 51/114 (removed 63) transitions.
// Phase 1: matrix 51 rows 52 cols
[2023-03-19 22:35:14] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-19 22:35:14] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-19 22:35:14] [INFO ] Invariant cache hit.
[2023-03-19 22:35:14] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2023-03-19 22:35:14] [INFO ] Redundant transitions in 14 ms returned [50]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 50 rows 52 cols
[2023-03-19 22:35:14] [INFO ] Computed 18 place invariants in 0 ms
[2023-03-19 22:35:14] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/116 places, 50/114 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 230 ms. Remains : 52/116 places, 50/114 transitions.
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s3 1), p1:(EQ s32 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 148 steps with 2 reset in 0 ms.
FORMULA ShieldIIPs-PT-002B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-002B-LTLFireability-12 finished in 322 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (p1||X(X((G(p2)&&(p3||X(p1))))))))'
Support contains 4 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 114/114 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 110 transition count 108
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 110 transition count 108
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 109 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 109 transition count 107
Applied a total of 14 rules in 2 ms. Remains 109 /116 variables (removed 7) and now considering 107/114 (removed 7) transitions.
// Phase 1: matrix 107 rows 109 cols
[2023-03-19 22:35:14] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-19 22:35:14] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-19 22:35:14] [INFO ] Invariant cache hit.
[2023-03-19 22:35:14] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2023-03-19 22:35:14] [INFO ] Invariant cache hit.
[2023-03-19 22:35:14] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 109/116 places, 107/114 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 290 ms. Remains : 109/116 places, 107/114 transitions.
Stuttering acceptance computed with spot in 767 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p2) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p2) (AND (NOT p1) (NOT p3))), true, (AND (NOT p1) p2), (NOT p2), (OR (NOT p2) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) p2 (NOT p3)), (NOT p2), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 7}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 8}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}, { cond=(AND p2 (NOT p3)), acceptance={} source=3 dest: 5}, { cond=p2, acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 4}], [{ cond=(NOT p2), acceptance={} source=6 dest: 4}, { cond=p2, acceptance={} source=6 dest: 6}], [{ cond=(NOT p2), acceptance={} source=7 dest: 3}, { cond=p2, acceptance={} source=7 dest: 6}, { cond=(AND p2 (NOT p3)), acceptance={} source=7 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=8 dest: 7}, { cond=(OR (AND (NOT p1) p0 (NOT p2)) (AND (NOT p1) p0 (NOT p3))), acceptance={0} source=8 dest: 8}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=8 dest: 10}, { cond=(AND (NOT p1) (NOT p0) p2 (NOT p3)), acceptance={} source=8 dest: 11}, { cond=(AND (NOT p1) p0 p2 p3), acceptance={} source=8 dest: 12}], [{ cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=9 dest: 5}], [{ cond=(NOT p2), acceptance={} source=10 dest: 3}, { cond=p2, acceptance={} source=10 dest: 6}], [{ cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=11 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=12 dest: 7}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=12 dest: 8}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=12 dest: 10}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=12 dest: 12}]], initial=0, aps=[p1:(EQ s41 1), p0:(EQ s8 1), p2:(EQ s34 1), p3:(EQ s96 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], 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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-002B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-002B-LTLFireability-13 finished in 1082 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||(F(p1)&&G((p1||(p2 U (p3||G(p2)))))))))'
Support contains 5 out of 116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 116/116 places, 114/114 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 115 transition count 103
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 105 transition count 103
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 20 place count 105 transition count 93
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 40 place count 95 transition count 93
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 45 place count 90 transition count 88
Iterating global reduction 2 with 5 rules applied. Total rules applied 50 place count 90 transition count 88
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 50 place count 90 transition count 87
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 89 transition count 87
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 118 place count 56 transition count 54
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 120 place count 54 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 121 place count 53 transition count 52
Applied a total of 121 rules in 22 ms. Remains 53 /116 variables (removed 63) and now considering 52/114 (removed 62) transitions.
// Phase 1: matrix 52 rows 53 cols
[2023-03-19 22:35:15] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-19 22:35:15] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-19 22:35:15] [INFO ] Invariant cache hit.
[2023-03-19 22:35:15] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2023-03-19 22:35:15] [INFO ] Redundant transitions in 28 ms returned [51]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 51 rows 53 cols
[2023-03-19 22:35:15] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-19 22:35:15] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 53/116 places, 51/114 transitions.
Applied a total of 0 rules in 2 ms. Remains 53 /53 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 337 ms. Remains : 53/116 places, 51/114 transitions.
Stuttering acceptance computed with spot in 433 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={} source=0 dest: 3}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p3) (AND (NOT p0) p2)), acceptance={} source=0 dest: 4}, { cond=(OR (AND (NOT p1) p3) (AND (NOT p1) p2)), acceptance={} source=0 dest: 5}, { cond=(OR p1 p3 p2), acceptance={} source=0 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={1} source=1 dest: 3}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p3) (AND (NOT p0) p2)), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={1} source=4 dest: 3}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p3) (AND (NOT p0) p2)), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(NOT p1), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={} source=6 dest: 3}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p3) (AND (NOT p0) p2)), acceptance={} source=6 dest: 4}, { cond=(OR p1 p3 p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(EQ s26 0), p3:(AND (NOT (AND (EQ s12 1) (EQ s23 1) (EQ s29 1))) (NEQ s42 1)), p2:(NEQ s42 1), p0:(EQ s42 0)], nbAcceptance=2, 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]]
Product exploration explored 100000 steps with 3657 reset in 228 ms.
Product exploration explored 100000 steps with 3615 reset in 202 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p3 p2 p0), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2))), (X (NOT (AND (NOT p0) p1 (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)))), (X p1), (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) p2)))), (X (NOT (OR (AND (NOT p1) p3) (AND (NOT p1) p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p3) (AND (NOT p0) p2)))), (X (NOT (AND (NOT p0) p1 (NOT p3) p2))), (X (OR p1 p3 p2)), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))))), (X (X p1)), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) p2))))), (X (X (NOT (OR (AND (NOT p1) p3) (AND (NOT p1) p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p3) (AND (NOT p0) p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (X (X (OR p1 p3 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 1583 ms. Reduced automaton from 7 states, 26 edges and 4 AP (stutter insensitive) to 7 states, 24 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 370 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0))]
Incomplete random walk after 10000 steps, including 65 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 11) seen :8
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-19 22:35:18] [INFO ] Invariant cache hit.
[2023-03-19 22:35:19] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 22:35:19] [INFO ] [Nat]Absence check using 18 positive place invariants in 15 ms returned sat
[2023-03-19 22:35:19] [INFO ] After 52ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p1 p3 p2 p0), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2))), (X (NOT (AND (NOT p0) p1 (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)))), (X p1), (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) p2)))), (X (NOT (OR (AND (NOT p1) p3) (AND (NOT p1) p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p3) (AND (NOT p0) p2)))), (X (NOT (AND (NOT p0) p1 (NOT p3) p2))), (X (OR p1 p3 p2)), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))))), (X (X p1)), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) p2))))), (X (X (NOT (OR (AND (NOT p1) p3) (AND (NOT p1) p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p3) (AND (NOT p0) p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (X (X (OR p1 p3 p2))), (G (NOT (AND (NOT p1) p2 (NOT p3) (NOT p0)))), (G (NOT (OR (AND (NOT p1) p2 (NOT p0)) (AND (NOT p1) p3 (NOT p0))))), (G (NOT (AND p1 p2 (NOT p3) (NOT p0))))]
False Knowledge obtained : [(F (OR (AND (NOT p1) p2) (AND (NOT p1) p3))), (F (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)) (AND p3 (NOT p0)))), (F (NOT (OR p1 p2 p3))), (F (AND (NOT p1) (NOT p2) (NOT p3))), (F (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0))), (F (NOT p1)), (F (AND (NOT p1) (NOT p0))), (F (AND p1 (NOT p2) (NOT p3) (NOT p0)))]
Knowledge based reduction with 26 factoid took 1379 ms. Reduced automaton from 7 states, 24 edges and 4 AP (stutter insensitive) to 2 states, 4 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) p3)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 69 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) p3)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 51/51 transitions.
Applied a total of 0 rules in 3 ms. Remains 53 /53 variables (removed 0) and now considering 51/51 (removed 0) transitions.
[2023-03-19 22:35:20] [INFO ] Invariant cache hit.
[2023-03-19 22:35:20] [INFO ] Implicit Places using invariants in 131 ms returned []
[2023-03-19 22:35:20] [INFO ] Invariant cache hit.
[2023-03-19 22:35:20] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
[2023-03-19 22:35:20] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-19 22:35:20] [INFO ] Invariant cache hit.
[2023-03-19 22:35:20] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 256 ms. Remains : 53/53 places, 51/51 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 p3 p1), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p3)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p0 (NOT p2) p3)), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p3))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p0 (NOT p2) p3))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 310 ms. Reduced automaton from 2 states, 4 edges and 4 AP (stutter insensitive) to 2 states, 4 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) p3)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 65 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 22:35:21] [INFO ] Invariant cache hit.
[2023-03-19 22:35:21] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 22:35:21] [INFO ] [Nat]Absence check using 18 positive place invariants in 2 ms returned sat
[2023-03-19 22:35:21] [INFO ] After 29ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 p3 p1), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p3)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p0 (NOT p2) p3)), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p3))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p0 (NOT p2) p3))), (X (X (NOT (AND p1 (NOT p0))))), (G (OR (NOT p2) p3 p0))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1)), (F (OR (AND (NOT p2) (NOT p0)) (AND p3 (NOT p0))))]
Knowledge based reduction with 10 factoid took 451 ms. Reduced automaton from 2 states, 4 edges and 4 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 3691 reset in 185 ms.
Product exploration explored 100000 steps with 3673 reset in 138 ms.
Support contains 2 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 51/51 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 53 transition count 49
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 51 transition count 49
Applied a total of 4 rules in 2 ms. Remains 51 /53 variables (removed 2) and now considering 49/51 (removed 2) transitions.
// Phase 1: matrix 49 rows 51 cols
[2023-03-19 22:35:22] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-19 22:35:22] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-19 22:35:22] [INFO ] Invariant cache hit.
[2023-03-19 22:35:23] [INFO ] Implicit Places using invariants and state equation in 473 ms returned []
Implicit Place search using SMT with State Equation took 582 ms to find 0 implicit places.
[2023-03-19 22:35:23] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-19 22:35:23] [INFO ] Invariant cache hit.
[2023-03-19 22:35:23] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/53 places, 49/51 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 679 ms. Remains : 51/53 places, 49/51 transitions.
Treatment of property ShieldIIPs-PT-002B-LTLFireability-14 finished in 7984 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 116/116 places, 114/114 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 115 transition count 102
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 104 transition count 102
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 22 place count 104 transition count 91
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 44 place count 93 transition count 91
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 50 place count 87 transition count 85
Iterating global reduction 2 with 6 rules applied. Total rules applied 56 place count 87 transition count 85
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 56 place count 87 transition count 83
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 60 place count 85 transition count 83
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 124 place count 53 transition count 51
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 126 place count 51 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 127 place count 50 transition count 49
Applied a total of 127 rules in 10 ms. Remains 50 /116 variables (removed 66) and now considering 49/114 (removed 65) transitions.
// Phase 1: matrix 49 rows 50 cols
[2023-03-19 22:35:23] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-19 22:35:23] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-19 22:35:23] [INFO ] Invariant cache hit.
[2023-03-19 22:35:23] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 513 ms to find 0 implicit places.
[2023-03-19 22:35:23] [INFO ] Redundant transitions in 17 ms returned [48]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 48 rows 50 cols
[2023-03-19 22:35:23] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-19 22:35:23] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/116 places, 48/114 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 610 ms. Remains : 50/116 places, 48/114 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-002B-LTLFireability-15 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:(EQ s21 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]]
Stuttering criterion allowed to conclude after 299 steps with 3 reset in 1 ms.
FORMULA ShieldIIPs-PT-002B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-002B-LTLFireability-15 finished in 703 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||((p0 U p2)&&p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||(F(p1)&&G((p1||(p2 U (p3||G(p2)))))))))'
[2023-03-19 22:35:24] [INFO ] Flatten gal took : 8 ms
[2023-03-19 22:35:24] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-19 22:35:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 116 places, 114 transitions and 348 arcs took 1 ms.
Total runtime 24067 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldIIPs-PT-002B
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/371
LTLFireability

FORMULA ShieldIIPs-PT-002B-LTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679265354766

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

+ 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:
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ sed s/.jar//
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/371/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/371/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/371/LTLFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 4 (type EXCL) for 3 ShieldIIPs-PT-002B-LTLFireability-14
lola: time limit : 1800 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-002B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-002B-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/1800 6/32 ShieldIIPs-PT-002B-LTLFireability-14 896396 m, 179279 m/sec, 6888350 t fired, .

Time elapsed: 5 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-002B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-002B-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/1800 12/32 ShieldIIPs-PT-002B-LTLFireability-14 1739628 m, 168646 m/sec, 13217893 t fired, .

Time elapsed: 10 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-002B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-002B-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/1800 17/32 ShieldIIPs-PT-002B-LTLFireability-14 2609955 m, 174065 m/sec, 19801334 t fired, .

Time elapsed: 15 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-002B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-002B-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/1800 23/32 ShieldIIPs-PT-002B-LTLFireability-14 3456401 m, 169289 m/sec, 26272334 t fired, .

Time elapsed: 20 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-002B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-002B-LTLFireability-14: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/1800 28/32 ShieldIIPs-PT-002B-LTLFireability-14 4336791 m, 176078 m/sec, 32922858 t fired, .

Time elapsed: 25 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 4 (type EXCL) for ShieldIIPs-PT-002B-LTLFireability-14 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPs-PT-002B-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ShieldIIPs-PT-002B-LTLFireability-14: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 30 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 1 (type EXCL) for 0 ShieldIIPs-PT-002B-LTLFireability-10
lola: time limit : 3570 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for ShieldIIPs-PT-002B-LTLFireability-10
lola: result : true
lola: markings : 231
lola: fired transitions : 684
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open tasks 2

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPs-PT-002B-LTLFireability-10: LTL true LTL model checker
ShieldIIPs-PT-002B-LTLFireability-14: LTL unknown AGGR


Time elapsed: 30 secs. Pages in use: 32

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="ShieldIIPs-PT-002B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is ShieldIIPs-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 r391-oct2-167903714800028"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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