fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r423-tajo-167905976200076
Last Updated
May 14, 2023

About the Execution of LoLa+red for ShieldRVs-PT-005B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1801.560 154665.00 182138.00 140.80 F?FFF??FFFFTFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r423-tajo-167905976200076.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is ShieldRVs-PT-005B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r423-tajo-167905976200076
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 7.3K Feb 26 18:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 18:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 26 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 26 18:21 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.7K Feb 25 17:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 17:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 18:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 18:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 26 18:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 18:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:02 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 61K 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 ShieldRVs-PT-005B-LTLFireability-00
FORMULA_NAME ShieldRVs-PT-005B-LTLFireability-01
FORMULA_NAME ShieldRVs-PT-005B-LTLFireability-02
FORMULA_NAME ShieldRVs-PT-005B-LTLFireability-03
FORMULA_NAME ShieldRVs-PT-005B-LTLFireability-04
FORMULA_NAME ShieldRVs-PT-005B-LTLFireability-05
FORMULA_NAME ShieldRVs-PT-005B-LTLFireability-06
FORMULA_NAME ShieldRVs-PT-005B-LTLFireability-07
FORMULA_NAME ShieldRVs-PT-005B-LTLFireability-08
FORMULA_NAME ShieldRVs-PT-005B-LTLFireability-09
FORMULA_NAME ShieldRVs-PT-005B-LTLFireability-10
FORMULA_NAME ShieldRVs-PT-005B-LTLFireability-11
FORMULA_NAME ShieldRVs-PT-005B-LTLFireability-12
FORMULA_NAME ShieldRVs-PT-005B-LTLFireability-13
FORMULA_NAME ShieldRVs-PT-005B-LTLFireability-14
FORMULA_NAME ShieldRVs-PT-005B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679242173221

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=ShieldRVs-PT-005B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 16:09:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 16:09:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 16:09:34] [INFO ] Load time of PNML (sax parser for PT used): 48 ms
[2023-03-19 16:09:34] [INFO ] Transformed 203 places.
[2023-03-19 16:09:34] [INFO ] Transformed 228 transitions.
[2023-03-19 16:09:34] [INFO ] Found NUPN structural information;
[2023-03-19 16:09:34] [INFO ] Parsed PT model containing 203 places and 228 transitions and 720 arcs in 111 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldRVs-PT-005B-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-005B-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-005B-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 228/228 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 177 transition count 202
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 177 transition count 202
Applied a total of 52 rules in 27 ms. Remains 177 /203 variables (removed 26) and now considering 202/228 (removed 26) transitions.
// Phase 1: matrix 202 rows 177 cols
[2023-03-19 16:09:35] [INFO ] Computed 21 place invariants in 12 ms
[2023-03-19 16:09:35] [INFO ] Implicit Places using invariants in 187 ms returned []
[2023-03-19 16:09:35] [INFO ] Invariant cache hit.
[2023-03-19 16:09:35] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2023-03-19 16:09:35] [INFO ] Invariant cache hit.
[2023-03-19 16:09:35] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 177/203 places, 202/228 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 504 ms. Remains : 177/203 places, 202/228 transitions.
Support contains 41 out of 177 places after structural reductions.
[2023-03-19 16:09:35] [INFO ] Flatten gal took : 51 ms
[2023-03-19 16:09:35] [INFO ] Flatten gal took : 19 ms
[2023-03-19 16:09:35] [INFO ] Input system was already deterministic with 202 transitions.
Support contains 37 out of 177 places (down from 41) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 42 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 29) seen :28
Finished Best-First random walk after 964 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=241 )
FORMULA ShieldRVs-PT-005B-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 46 stabilizing places and 46 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' '!(X((X(p0) U (F(!p0)&&p1))))'
Support contains 2 out of 177 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 202/202 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 169 transition count 194
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 169 transition count 194
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 168 transition count 193
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 168 transition count 193
Applied a total of 18 rules in 22 ms. Remains 168 /177 variables (removed 9) and now considering 193/202 (removed 9) transitions.
// Phase 1: matrix 193 rows 168 cols
[2023-03-19 16:09:36] [INFO ] Computed 21 place invariants in 5 ms
[2023-03-19 16:09:36] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-19 16:09:36] [INFO ] Invariant cache hit.
[2023-03-19 16:09:36] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2023-03-19 16:09:36] [INFO ] Invariant cache hit.
[2023-03-19 16:09:36] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 168/177 places, 193/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 313 ms. Remains : 168/177 places, 193/202 transitions.
Stuttering acceptance computed with spot in 308 ms :[p0, (OR (NOT p1) p0), (OR (NOT p1) p0), true, true]
Running random walk in product with property : ShieldRVs-PT-005B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=4 dest: 0}, { cond=(NOT p0), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}]], initial=2, aps=[p0:(EQ s124 1), p1:(AND (EQ s72 1) (EQ s124 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA ShieldRVs-PT-005B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-005B-LTLFireability-00 finished in 681 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||X(F((p0&&X(F(((p1&&X(F(!p2)))||G(F(!p2)))))))))))'
Support contains 4 out of 177 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 202/202 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 168 transition count 193
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 168 transition count 193
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 167 transition count 192
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 167 transition count 192
Applied a total of 20 rules in 15 ms. Remains 167 /177 variables (removed 10) and now considering 192/202 (removed 10) transitions.
// Phase 1: matrix 192 rows 167 cols
[2023-03-19 16:09:37] [INFO ] Computed 21 place invariants in 3 ms
[2023-03-19 16:09:37] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-19 16:09:37] [INFO ] Invariant cache hit.
[2023-03-19 16:09:37] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2023-03-19 16:09:37] [INFO ] Invariant cache hit.
[2023-03-19 16:09:37] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 167/177 places, 192/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 337 ms. Remains : 167/177 places, 192/202 transitions.
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (OR (NOT p0) p2), p2, p2]
Running random walk in product with property : ShieldRVs-PT-005B-LTLFireability-01 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}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(OR p2 p1), acceptance={} source=2 dest: 3}], [{ cond=p2, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(NEQ s101 1), p1:(NEQ s95 1), p2:(AND (EQ s54 1) (EQ s65 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 934 reset in 365 ms.
Product exploration explored 100000 steps with 916 reset in 261 ms.
Computed a total of 39 stabilizing places and 39 stable transitions
Computed a total of 39 stabilizing places and 39 stable transitions
Detected a total of 39/167 stabilizing places and 39/192 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p0), (X (X (OR p2 p1))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 314 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (OR (NOT p0) p2), p2, p2]
Finished random walk after 111 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=37 )
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p0), (X (X (OR p2 p1))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p2), (F (NOT p0)), (F (NOT (OR p1 p2))), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 384 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (OR (NOT p0) p2), p2, p2]
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (OR (NOT p0) p2), p2, p2]
Support contains 4 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 192/192 transitions.
Applied a total of 0 rules in 3 ms. Remains 167 /167 variables (removed 0) and now considering 192/192 (removed 0) transitions.
[2023-03-19 16:09:39] [INFO ] Invariant cache hit.
[2023-03-19 16:09:39] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-19 16:09:39] [INFO ] Invariant cache hit.
[2023-03-19 16:09:39] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2023-03-19 16:09:39] [INFO ] Invariant cache hit.
[2023-03-19 16:09:39] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 321 ms. Remains : 167/167 places, 192/192 transitions.
Computed a total of 39 stabilizing places and 39 stable transitions
Computed a total of 39 stabilizing places and 39 stable transitions
Detected a total of 39/167 stabilizing places and 39/192 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p0), (X (X p0)), (X (X (OR p1 p2))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 281 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (OR (NOT p0) p2), p2, p2]
Finished random walk after 101 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=33 )
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p0), (X (X p0)), (X (X (OR p1 p2))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p2), (F (NOT p0)), (F (NOT (OR p1 p2))), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 340 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (OR (NOT p0) p2), p2, p2]
Stuttering acceptance computed with spot in 189 ms :[(NOT p0), (OR (NOT p0) p2), p2, p2]
Stuttering acceptance computed with spot in 189 ms :[(NOT p0), (OR (NOT p0) p2), p2, p2]
Product exploration explored 100000 steps with 918 reset in 207 ms.
Product exploration explored 100000 steps with 917 reset in 306 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (OR (NOT p0) p2), p2, p2]
Support contains 4 out of 167 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 167/167 places, 192/192 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 167 transition count 192
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 10 Pre rules applied. Total rules applied 19 place count 167 transition count 196
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 29 place count 167 transition count 196
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 166 transition count 195
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 166 transition count 195
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 90 places in 1 ms
Iterating global reduction 1 with 62 rules applied. Total rules applied 93 place count 166 transition count 195
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 126 place count 133 transition count 162
Deduced a syphon composed of 57 places in 0 ms
Iterating global reduction 1 with 33 rules applied. Total rules applied 159 place count 133 transition count 162
Deduced a syphon composed of 57 places in 0 ms
Applied a total of 159 rules in 42 ms. Remains 133 /167 variables (removed 34) and now considering 162/192 (removed 30) transitions.
[2023-03-19 16:09:42] [INFO ] Redundant transitions in 37 ms returned [161]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 161 rows 133 cols
[2023-03-19 16:09:42] [INFO ] Computed 21 place invariants in 3 ms
[2023-03-19 16:09:42] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 133/167 places, 161/192 transitions.
Deduced a syphon composed of 57 places in 0 ms
Applied a total of 0 rules in 6 ms. Remains 133 /133 variables (removed 0) and now considering 161/161 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 190 ms. Remains : 133/167 places, 161/192 transitions.
Support contains 4 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 192/192 transitions.
Applied a total of 0 rules in 2 ms. Remains 167 /167 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 167 cols
[2023-03-19 16:09:42] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-19 16:09:42] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-19 16:09:42] [INFO ] Invariant cache hit.
[2023-03-19 16:09:42] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2023-03-19 16:09:42] [INFO ] Invariant cache hit.
[2023-03-19 16:09:42] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 300 ms. Remains : 167/167 places, 192/192 transitions.
Treatment of property ShieldRVs-PT-005B-LTLFireability-01 finished in 5549 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((G(!p0) U (G(F(p2))&&p1)))))'
Support contains 7 out of 177 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 177/177 places, 202/202 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 176 transition count 183
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 158 transition count 183
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 36 place count 158 transition count 158
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 86 place count 133 transition count 158
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 95 place count 124 transition count 149
Iterating global reduction 2 with 9 rules applied. Total rules applied 104 place count 124 transition count 149
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 104 place count 124 transition count 145
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 112 place count 120 transition count 145
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 198 place count 77 transition count 102
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 200 place count 75 transition count 100
Applied a total of 200 rules in 27 ms. Remains 75 /177 variables (removed 102) and now considering 100/202 (removed 102) transitions.
// Phase 1: matrix 100 rows 75 cols
[2023-03-19 16:09:42] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-19 16:09:42] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-19 16:09:42] [INFO ] Invariant cache hit.
[2023-03-19 16:09:42] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2023-03-19 16:09:42] [INFO ] Redundant transitions in 25 ms returned [99]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 99 rows 75 cols
[2023-03-19 16:09:42] [INFO ] Computed 21 place invariants in 3 ms
[2023-03-19 16:09:42] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 75/177 places, 99/202 transitions.
Applied a total of 0 rules in 4 ms. Remains 75 /75 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 241 ms. Remains : 75/177 places, 99/202 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p1) (NOT p2)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldRVs-PT-005B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(OR p1 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=1 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0, 1} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s3 1) (EQ s21 1) (EQ s31 1)), p0:(AND (EQ s50 1) (EQ s52 1) (EQ s57 1)), p2:(EQ s20 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 4207 steps with 48 reset in 19 ms.
FORMULA ShieldRVs-PT-005B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-005B-LTLFireability-02 finished in 465 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)&&F(G(p1)))))'
Support contains 4 out of 177 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 177/177 places, 202/202 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 176 transition count 182
Reduce places removed 19 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 20 rules applied. Total rules applied 39 place count 157 transition count 181
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 40 place count 156 transition count 181
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 40 place count 156 transition count 155
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 92 place count 130 transition count 155
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 100 place count 122 transition count 147
Iterating global reduction 3 with 8 rules applied. Total rules applied 108 place count 122 transition count 147
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 108 place count 122 transition count 144
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 114 place count 119 transition count 144
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 202 place count 75 transition count 100
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 204 place count 73 transition count 98
Applied a total of 204 rules in 20 ms. Remains 73 /177 variables (removed 104) and now considering 98/202 (removed 104) transitions.
// Phase 1: matrix 98 rows 73 cols
[2023-03-19 16:09:43] [INFO ] Computed 21 place invariants in 0 ms
[2023-03-19 16:09:43] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-19 16:09:43] [INFO ] Invariant cache hit.
[2023-03-19 16:09:43] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2023-03-19 16:09:43] [INFO ] Redundant transitions in 28 ms returned [97]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 97 rows 73 cols
[2023-03-19 16:09:43] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-19 16:09:43] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 73/177 places, 97/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 73 /73 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 220 ms. Remains : 73/177 places, 97/202 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-005B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s15 0) (EQ s27 0)), p1:(OR (EQ s67 0) (EQ s71 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 5947 reset in 230 ms.
Product exploration explored 100000 steps with 5789 reset in 256 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 210 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 292 steps, including 3 resets, run visited all 2 properties in 2 ms. (steps per millisecond=146 )
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 211 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 97/97 transitions.
Applied a total of 0 rules in 3 ms. Remains 73 /73 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-19 16:09:44] [INFO ] Invariant cache hit.
[2023-03-19 16:09:44] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-19 16:09:44] [INFO ] Invariant cache hit.
[2023-03-19 16:09:44] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2023-03-19 16:09:44] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-19 16:09:44] [INFO ] Invariant cache hit.
[2023-03-19 16:09:44] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 244 ms. Remains : 73/73 places, 97/97 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 188 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 14 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=14 )
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 237 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 5826 reset in 181 ms.
Product exploration explored 100000 steps with 5943 reset in 245 ms.
Support contains 4 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 97/97 transitions.
Applied a total of 0 rules in 2 ms. Remains 73 /73 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-19 16:09:46] [INFO ] Invariant cache hit.
[2023-03-19 16:09:46] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-19 16:09:46] [INFO ] Invariant cache hit.
[2023-03-19 16:09:46] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2023-03-19 16:09:46] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-19 16:09:46] [INFO ] Invariant cache hit.
[2023-03-19 16:09:46] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 224 ms. Remains : 73/73 places, 97/97 transitions.
Treatment of property ShieldRVs-PT-005B-LTLFireability-03 finished in 3457 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(G((p0&&F(p1)))))'
Support contains 2 out of 177 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 202/202 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 169 transition count 194
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 169 transition count 194
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 168 transition count 193
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 168 transition count 193
Applied a total of 18 rules in 3 ms. Remains 168 /177 variables (removed 9) and now considering 193/202 (removed 9) transitions.
// Phase 1: matrix 193 rows 168 cols
[2023-03-19 16:09:46] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-19 16:09:46] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-19 16:09:46] [INFO ] Invariant cache hit.
[2023-03-19 16:09:46] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2023-03-19 16:09:46] [INFO ] Invariant cache hit.
[2023-03-19 16:09:46] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 168/177 places, 193/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 285 ms. Remains : 168/177 places, 193/202 transitions.
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-005B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s43 1), p1:(EQ s117 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-005B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-005B-LTLFireability-04 finished in 415 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 (X(F(p1))&&(G(!p0) U G(p2)))))'
Support contains 3 out of 177 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 202/202 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 169 transition count 194
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 169 transition count 194
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 168 transition count 193
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 168 transition count 193
Applied a total of 18 rules in 4 ms. Remains 168 /177 variables (removed 9) and now considering 193/202 (removed 9) transitions.
// Phase 1: matrix 193 rows 168 cols
[2023-03-19 16:09:46] [INFO ] Computed 21 place invariants in 5 ms
[2023-03-19 16:09:47] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-19 16:09:47] [INFO ] Invariant cache hit.
[2023-03-19 16:09:47] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2023-03-19 16:09:47] [INFO ] Invariant cache hit.
[2023-03-19 16:09:47] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 168/177 places, 193/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 265 ms. Remains : 168/177 places, 193/202 transitions.
Stuttering acceptance computed with spot in 269 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (AND p2 p0), (NOT p2), (NOT p2), true, (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVs-PT-005B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(OR p2 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}, { cond=(AND p2 p0), acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND p2 p0), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 5}, { cond=(AND p2 p0), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=(AND p2 p0), acceptance={} source=4 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 7}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=p2, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=7 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(EQ s28 1), p0:(EQ s85 1), p1:(EQ s75 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 8158 reset in 161 ms.
Product exploration explored 100000 steps with 7941 reset in 176 ms.
Computed a total of 40 stabilizing places and 40 stable transitions
Computed a total of 40 stabilizing places and 40 stable transitions
Detected a total of 40/168 stabilizing places and 40/193 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (OR p2 (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p2) p0)))), true, (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (OR p2 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 20 factoid took 768 ms. Reduced automaton from 8 states, 24 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p1), (AND p2 p0), (NOT p2), true, (NOT p2)]
Finished random walk after 119 steps, including 0 resets, run visited all 6 properties in 5 ms. (steps per millisecond=23 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (OR p2 (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p2) p0)))), true, (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (OR p2 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p2) p0)), (F (NOT (AND (NOT p2) (NOT p0)))), (F p2), (F p1), (F (AND p2 p0)), (F (AND p2 (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 20 factoid took 878 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p1), (AND p2 p0), (NOT p2), true, (NOT p2)]
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p1), (AND p2 p0), (NOT p2), true, (NOT p2)]
[2023-03-19 16:09:50] [INFO ] Invariant cache hit.
[2023-03-19 16:09:50] [INFO ] [Real]Absence check using 21 positive place invariants in 6 ms returned sat
[2023-03-19 16:09:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 16:09:50] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2023-03-19 16:09:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 16:09:50] [INFO ] [Nat]Absence check using 21 positive place invariants in 4 ms returned sat
[2023-03-19 16:09:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 16:09:51] [INFO ] [Nat]Absence check using state equation in 1470 ms returned sat
[2023-03-19 16:09:51] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 10 ms to minimize.
[2023-03-19 16:09:52] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 1 ms to minimize.
[2023-03-19 16:09:53] [INFO ] Deduced a trap composed of 23 places in 1234 ms of which 2 ms to minimize.
[2023-03-19 16:09:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1532 ms
[2023-03-19 16:09:53] [INFO ] Computed and/alt/rep : 192/590/192 causal constraints (skipped 0 transitions) in 20 ms.
[2023-03-19 16:09:54] [INFO ] Added : 184 causal constraints over 39 iterations in 1182 ms. Result :sat
Could not prove EG (NOT p1)
[2023-03-19 16:09:54] [INFO ] Invariant cache hit.
[2023-03-19 16:09:54] [INFO ] [Real]Absence check using 21 positive place invariants in 17 ms returned sat
[2023-03-19 16:09:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 16:09:54] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2023-03-19 16:09:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 16:09:54] [INFO ] [Nat]Absence check using 21 positive place invariants in 8 ms returned sat
[2023-03-19 16:09:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 16:09:55] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2023-03-19 16:09:55] [INFO ] Computed and/alt/rep : 192/590/192 causal constraints (skipped 0 transitions) in 17 ms.
[2023-03-19 16:09:55] [INFO ] Added : 190 causal constraints over 39 iterations in 908 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 3 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 193/193 transitions.
Applied a total of 0 rules in 2 ms. Remains 168 /168 variables (removed 0) and now considering 193/193 (removed 0) transitions.
[2023-03-19 16:09:55] [INFO ] Invariant cache hit.
[2023-03-19 16:09:56] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-19 16:09:56] [INFO ] Invariant cache hit.
[2023-03-19 16:09:56] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
[2023-03-19 16:09:56] [INFO ] Invariant cache hit.
[2023-03-19 16:09:56] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 405 ms. Remains : 168/168 places, 193/193 transitions.
Computed a total of 40 stabilizing places and 40 stable transitions
Computed a total of 40 stabilizing places and 40 stable transitions
Detected a total of 40/168 stabilizing places and 40/193 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND (NOT p2) p0)))), true, (X (X (NOT p2))), (X (X (NOT (AND p2 p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 773 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 279 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p1), (AND p0 p2), (NOT p2), true, (NOT p2)]
Finished random walk after 1140 steps, including 4 resets, run visited all 6 properties in 10 ms. (steps per millisecond=114 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND (NOT p2) p0)))), true, (X (X (NOT p2))), (X (X (NOT (AND p2 p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F p2), (F p1), (F (AND p0 p2)), (F (AND (NOT p0) p2))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 14 factoid took 1028 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 278 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p1), (AND p0 p2), (NOT p2), true, (NOT p2)]
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p1), (AND p0 p2), (NOT p2), true, (NOT p2)]
[2023-03-19 16:09:58] [INFO ] Invariant cache hit.
[2023-03-19 16:09:59] [INFO ] [Real]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-19 16:09:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 16:09:59] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2023-03-19 16:09:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 16:09:59] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-03-19 16:09:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 16:09:59] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2023-03-19 16:09:59] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 2 ms to minimize.
[2023-03-19 16:09:59] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2023-03-19 16:09:59] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 0 ms to minimize.
[2023-03-19 16:09:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 184 ms
[2023-03-19 16:09:59] [INFO ] Computed and/alt/rep : 192/590/192 causal constraints (skipped 0 transitions) in 14 ms.
[2023-03-19 16:10:00] [INFO ] Added : 184 causal constraints over 39 iterations in 1083 ms. Result :sat
Could not prove EG (NOT p1)
[2023-03-19 16:10:00] [INFO ] Invariant cache hit.
[2023-03-19 16:10:00] [INFO ] [Real]Absence check using 21 positive place invariants in 10 ms returned sat
[2023-03-19 16:10:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 16:10:00] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2023-03-19 16:10:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 16:10:01] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-19 16:10:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 16:10:01] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2023-03-19 16:10:01] [INFO ] Computed and/alt/rep : 192/590/192 causal constraints (skipped 0 transitions) in 15 ms.
[2023-03-19 16:10:01] [INFO ] Added : 190 causal constraints over 39 iterations in 811 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 281 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p1), (AND p0 p2), (NOT p2), true, (NOT p2)]
Product exploration explored 100000 steps with 7994 reset in 157 ms.
Product exploration explored 100000 steps with 8038 reset in 162 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 289 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p1), (AND p0 p2), (NOT p2), true, (NOT p2)]
Support contains 3 out of 168 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 168/168 places, 193/193 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 168 transition count 193
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 10 Pre rules applied. Total rules applied 20 place count 168 transition count 197
Deduced a syphon composed of 30 places in 1 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 30 place count 168 transition count 197
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 167 transition count 196
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 167 transition count 196
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 92 places in 0 ms
Iterating global reduction 1 with 63 rules applied. Total rules applied 95 place count 167 transition count 196
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 130 place count 132 transition count 161
Deduced a syphon composed of 57 places in 0 ms
Iterating global reduction 1 with 35 rules applied. Total rules applied 165 place count 132 transition count 161
Deduced a syphon composed of 57 places in 0 ms
Applied a total of 165 rules in 16 ms. Remains 132 /168 variables (removed 36) and now considering 161/193 (removed 32) transitions.
[2023-03-19 16:10:02] [INFO ] Redundant transitions in 23 ms returned [160]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 160 rows 132 cols
[2023-03-19 16:10:02] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-19 16:10:03] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/168 places, 160/193 transitions.
Deduced a syphon composed of 57 places in 0 ms
Applied a total of 0 rules in 3 ms. Remains 132 /132 variables (removed 0) and now considering 160/160 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 130 ms. Remains : 132/168 places, 160/193 transitions.
Support contains 3 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 193/193 transitions.
Applied a total of 0 rules in 1 ms. Remains 168 /168 variables (removed 0) and now considering 193/193 (removed 0) transitions.
// Phase 1: matrix 193 rows 168 cols
[2023-03-19 16:10:03] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-19 16:10:03] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-19 16:10:03] [INFO ] Invariant cache hit.
[2023-03-19 16:10:03] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2023-03-19 16:10:03] [INFO ] Invariant cache hit.
[2023-03-19 16:10:03] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 284 ms. Remains : 168/168 places, 193/193 transitions.
Treatment of property ShieldRVs-PT-005B-LTLFireability-05 finished in 16407 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)||(F(p0) U X(G(p1)))))'
Support contains 3 out of 177 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 202/202 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 169 transition count 194
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 169 transition count 194
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 168 transition count 193
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 168 transition count 193
Applied a total of 18 rules in 4 ms. Remains 168 /177 variables (removed 9) and now considering 193/202 (removed 9) transitions.
// Phase 1: matrix 193 rows 168 cols
[2023-03-19 16:10:03] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-19 16:10:03] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-19 16:10:03] [INFO ] Invariant cache hit.
[2023-03-19 16:10:03] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2023-03-19 16:10:03] [INFO ] Invariant cache hit.
[2023-03-19 16:10:03] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 168/177 places, 193/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 304 ms. Remains : 168/177 places, 193/202 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-005B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s109 1), p1:(OR (EQ s67 1) (EQ s70 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3126 reset in 136 ms.
Product exploration explored 100000 steps with 3121 reset in 154 ms.
Computed a total of 39 stabilizing places and 39 stable transitions
Computed a total of 39 stabilizing places and 39 stable transitions
Detected a total of 39/168 stabilizing places and 39/193 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 266 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Finished random walk after 46 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=46 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 7 factoid took 189 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
[2023-03-19 16:10:04] [INFO ] Invariant cache hit.
[2023-03-19 16:10:04] [INFO ] [Real]Absence check using 21 positive place invariants in 4 ms returned sat
[2023-03-19 16:10:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 16:10:04] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2023-03-19 16:10:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 16:10:04] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-19 16:10:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 16:10:04] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2023-03-19 16:10:04] [INFO ] Computed and/alt/rep : 192/590/192 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-19 16:10:05] [INFO ] Added : 183 causal constraints over 39 iterations in 791 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 168 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 168/168 places, 193/193 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 167 transition count 171
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 146 transition count 171
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 42 place count 146 transition count 146
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 92 place count 121 transition count 146
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 182 place count 76 transition count 101
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 184 place count 74 transition count 99
Applied a total of 184 rules in 29 ms. Remains 74 /168 variables (removed 94) and now considering 99/193 (removed 94) transitions.
// Phase 1: matrix 99 rows 74 cols
[2023-03-19 16:10:05] [INFO ] Computed 21 place invariants in 0 ms
[2023-03-19 16:10:05] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-19 16:10:05] [INFO ] Invariant cache hit.
[2023-03-19 16:10:05] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2023-03-19 16:10:05] [INFO ] Redundant transitions in 31 ms returned [98]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 98 rows 74 cols
[2023-03-19 16:10:05] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-19 16:10:06] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 74/168 places, 98/193 transitions.
Applied a total of 0 rules in 3 ms. Remains 74 /74 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 331 ms. Remains : 74/168 places, 98/193 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/74 stabilizing places and 2/98 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 263 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 148 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
[2023-03-19 16:10:06] [INFO ] Invariant cache hit.
[2023-03-19 16:10:06] [INFO ] [Real]Absence check using 21 positive place invariants in 4 ms returned sat
[2023-03-19 16:10:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 16:10:06] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-19 16:10:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 16:10:06] [INFO ] [Nat]Absence check using 21 positive place invariants in 3 ms returned sat
[2023-03-19 16:10:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 16:10:06] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-19 16:10:06] [INFO ] Computed and/alt/rep : 86/345/86 causal constraints (skipped 10 transitions) in 5 ms.
[2023-03-19 16:10:06] [INFO ] Added : 52 causal constraints over 11 iterations in 94 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 27776 reset in 133 ms.
Product exploration explored 100000 steps with 27894 reset in 142 ms.
Support contains 1 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 98/98 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 73 transition count 97
Applied a total of 2 rules in 7 ms. Remains 73 /74 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 73 cols
[2023-03-19 16:10:07] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-19 16:10:07] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-19 16:10:07] [INFO ] Invariant cache hit.
[2023-03-19 16:10:07] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2023-03-19 16:10:07] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-19 16:10:07] [INFO ] Invariant cache hit.
[2023-03-19 16:10:07] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 73/74 places, 97/98 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 303 ms. Remains : 73/74 places, 97/98 transitions.
Treatment of property ShieldRVs-PT-005B-LTLFireability-06 finished in 4190 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((p0 U p1)))'
Support contains 3 out of 177 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 202/202 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 170 transition count 195
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 170 transition count 195
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 169 transition count 194
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 169 transition count 194
Applied a total of 16 rules in 5 ms. Remains 169 /177 variables (removed 8) and now considering 194/202 (removed 8) transitions.
// Phase 1: matrix 194 rows 169 cols
[2023-03-19 16:10:07] [INFO ] Computed 21 place invariants in 8 ms
[2023-03-19 16:10:07] [INFO ] Implicit Places using invariants in 426 ms returned []
[2023-03-19 16:10:07] [INFO ] Invariant cache hit.
[2023-03-19 16:10:08] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 539 ms to find 0 implicit places.
[2023-03-19 16:10:08] [INFO ] Invariant cache hit.
[2023-03-19 16:10:08] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 169/177 places, 194/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 639 ms. Remains : 169/177 places, 194/202 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : ShieldRVs-PT-005B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(AND (NEQ s57 1) (OR (EQ s17 1) (EQ s115 1))), p0:(NEQ s57 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 130 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-005B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-005B-LTLFireability-08 finished in 784 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((p0||X(((G(p1) U p2)||X(p3))))))'
Support contains 5 out of 177 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 202/202 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 169 transition count 194
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 169 transition count 194
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 168 transition count 193
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 168 transition count 193
Applied a total of 18 rules in 7 ms. Remains 168 /177 variables (removed 9) and now considering 193/202 (removed 9) transitions.
// Phase 1: matrix 193 rows 168 cols
[2023-03-19 16:10:08] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-19 16:10:08] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-19 16:10:08] [INFO ] Invariant cache hit.
[2023-03-19 16:10:08] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
[2023-03-19 16:10:08] [INFO ] Invariant cache hit.
[2023-03-19 16:10:08] [INFO ] Dead Transitions using invariants and state equation in 187 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 168/177 places, 193/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 488 ms. Remains : 168/177 places, 193/202 transitions.
Stuttering acceptance computed with spot in 380 ms :[(NOT p1), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (NOT p2)), true, (AND (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : ShieldRVs-PT-005B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 6}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p3), acceptance={} source=3 dest: 6}], [{ cond=(AND p2 p1 (NOT p3)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=4 dest: 6}], [{ cond=(AND p2 p1), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=5 dest: 5}, { cond=(NOT p1), acceptance={0} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=true, acceptance={} source=7 dest: 1}]], initial=7, aps=[p1:(EQ s113 1), p0:(AND (EQ s155 1) (EQ s164 1)), p2:(EQ s59 1), p3:(EQ s72 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-005B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-005B-LTLFireability-09 finished in 886 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(p0)))'
Support contains 1 out of 177 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 177/177 places, 202/202 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 176 transition count 180
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 155 transition count 180
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 42 place count 155 transition count 155
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 92 place count 130 transition count 155
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 100 place count 122 transition count 147
Iterating global reduction 2 with 8 rules applied. Total rules applied 108 place count 122 transition count 147
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 108 place count 122 transition count 143
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 116 place count 118 transition count 143
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 204 place count 74 transition count 99
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 206 place count 72 transition count 97
Applied a total of 206 rules in 18 ms. Remains 72 /177 variables (removed 105) and now considering 97/202 (removed 105) transitions.
// Phase 1: matrix 97 rows 72 cols
[2023-03-19 16:10:09] [INFO ] Computed 21 place invariants in 0 ms
[2023-03-19 16:10:09] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-19 16:10:09] [INFO ] Invariant cache hit.
[2023-03-19 16:10:09] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2023-03-19 16:10:09] [INFO ] Redundant transitions in 43 ms returned [96]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 96 rows 72 cols
[2023-03-19 16:10:09] [INFO ] Computed 21 place invariants in 4 ms
[2023-03-19 16:10:09] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 72/177 places, 96/202 transitions.
Applied a total of 0 rules in 7 ms. Remains 72 /72 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 322 ms. Remains : 72/177 places, 96/202 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-005B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s66 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 72 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-005B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-005B-LTLFireability-13 finished in 412 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)||(p1&&F(G(p2))))))'
Support contains 5 out of 177 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 202/202 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 169 transition count 194
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 169 transition count 194
Applied a total of 16 rules in 3 ms. Remains 169 /177 variables (removed 8) and now considering 194/202 (removed 8) transitions.
// Phase 1: matrix 194 rows 169 cols
[2023-03-19 16:10:09] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-19 16:10:09] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-19 16:10:09] [INFO ] Invariant cache hit.
[2023-03-19 16:10:09] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
[2023-03-19 16:10:09] [INFO ] Invariant cache hit.
[2023-03-19 16:10:09] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 169/177 places, 194/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 377 ms. Remains : 169/177 places, 194/202 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : ShieldRVs-PT-005B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s18 0) (EQ s21 0) (EQ s29 0)), p0:(EQ s48 1), p2:(EQ s148 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 277 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-005B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-005B-LTLFireability-14 finished in 580 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(G(p0)))'
Support contains 1 out of 177 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 177/177 places, 202/202 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 169 transition count 194
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 169 transition count 194
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 168 transition count 193
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 168 transition count 193
Applied a total of 18 rules in 3 ms. Remains 168 /177 variables (removed 9) and now considering 193/202 (removed 9) transitions.
// Phase 1: matrix 193 rows 168 cols
[2023-03-19 16:10:10] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-19 16:10:10] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-19 16:10:10] [INFO ] Invariant cache hit.
[2023-03-19 16:10:10] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
[2023-03-19 16:10:10] [INFO ] Invariant cache hit.
[2023-03-19 16:10:10] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 168/177 places, 193/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 265 ms. Remains : 168/177 places, 193/202 transitions.
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-005B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s88 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-005B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-005B-LTLFireability-15 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' '!(G((p0||X(F((p0&&X(F(((p1&&X(F(!p2)))||G(F(!p2)))))))))))'
Found a Shortening insensitive property : ShieldRVs-PT-005B-LTLFireability-01
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (OR (NOT p0) p2), p2, p2]
Support contains 4 out of 177 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 177/177 places, 202/202 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 176 transition count 181
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 156 transition count 181
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 40 place count 156 transition count 157
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 88 place count 132 transition count 157
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 97 place count 123 transition count 148
Iterating global reduction 2 with 9 rules applied. Total rules applied 106 place count 123 transition count 148
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 106 place count 123 transition count 144
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 114 place count 119 transition count 144
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 198 place count 77 transition count 102
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 200 place count 75 transition count 100
Applied a total of 200 rules in 18 ms. Remains 75 /177 variables (removed 102) and now considering 100/202 (removed 102) transitions.
// Phase 1: matrix 100 rows 75 cols
[2023-03-19 16:10:10] [INFO ] Computed 21 place invariants in 0 ms
[2023-03-19 16:10:10] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-19 16:10:10] [INFO ] Invariant cache hit.
[2023-03-19 16:10:11] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2023-03-19 16:10:11] [INFO ] Invariant cache hit.
[2023-03-19 16:10:11] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 75/177 places, 100/202 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 264 ms. Remains : 75/177 places, 100/202 transitions.
Running random walk in product with property : ShieldRVs-PT-005B-LTLFireability-01 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}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(OR p2 p1), acceptance={} source=2 dest: 3}], [{ cond=p2, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(NEQ s47 1), p1:(NEQ s43 1), p2:(AND (EQ s22 1) (EQ s28 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3559 reset in 160 ms.
Product exploration explored 100000 steps with 3534 reset in 146 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/75 stabilizing places and 2/100 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p0), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (OR p2 p1))), (X (X (NOT (OR p2 p1)))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 4 factoid took 429 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (OR (NOT p0) p2), p2, p2]
Finished random walk after 23 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=23 )
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p0), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (OR p2 p1))), (X (X (NOT (OR p2 p1)))), (X (X (NOT p1))), (X (X p1)), (F p2), (F (NOT p0)), (F (NOT (OR p1 p2))), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 329 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (OR (NOT p0) p2), p2, p2]
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (OR (NOT p0) p2), p2, p2]
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 100/100 transitions.
Applied a total of 0 rules in 0 ms. Remains 75 /75 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2023-03-19 16:10:12] [INFO ] Invariant cache hit.
[2023-03-19 16:10:12] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-19 16:10:12] [INFO ] Invariant cache hit.
[2023-03-19 16:10:12] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2023-03-19 16:10:12] [INFO ] Invariant cache hit.
[2023-03-19 16:10:12] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 209 ms. Remains : 75/75 places, 100/100 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/75 stabilizing places and 2/100 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p0), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (OR p1 p2))), (X (X (NOT (OR p1 p2)))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 4 factoid took 238 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[(NOT p0), (OR (NOT p0) p2), p2, p2]
Finished random walk after 36 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=36 )
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p0), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (OR p1 p2))), (X (X (NOT (OR p1 p2)))), (X (X (NOT p1))), (X (X p1)), (F p2), (F (NOT p0)), (F (NOT (OR p1 p2))), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 350 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(NOT p0), (OR (NOT p0) p2), p2, p2]
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (OR (NOT p0) p2), p2, p2]
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (OR (NOT p0) p2), p2, p2]
Product exploration explored 100000 steps with 3581 reset in 200 ms.
Product exploration explored 100000 steps with 3568 reset in 185 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 218 ms :[(NOT p0), (OR (NOT p0) p2), p2, p2]
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2023-03-19 16:10:15] [INFO ] Redundant transitions in 31 ms returned [99]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 99 rows 75 cols
[2023-03-19 16:10:15] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-19 16:10:15] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 75/75 places, 99/100 transitions.
Applied a total of 0 rules in 4 ms. Remains 75 /75 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 148 ms. Remains : 75/75 places, 99/100 transitions.
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 100/100 transitions.
Applied a total of 0 rules in 1 ms. Remains 75 /75 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 75 cols
[2023-03-19 16:10:15] [INFO ] Computed 21 place invariants in 0 ms
[2023-03-19 16:10:15] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-19 16:10:15] [INFO ] Invariant cache hit.
[2023-03-19 16:10:15] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2023-03-19 16:10:15] [INFO ] Invariant cache hit.
[2023-03-19 16:10:15] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 255 ms. Remains : 75/75 places, 100/100 transitions.
Treatment of property ShieldRVs-PT-005B-LTLFireability-01 finished in 4880 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)&&F(G(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' '!((p0 U (X(F(p1))&&(G(!p0) U G(p2)))))'
Found a Shortening insensitive property : ShieldRVs-PT-005B-LTLFireability-05
Stuttering acceptance computed with spot in 287 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (AND p2 p0), (NOT p2), (NOT p2), true, (NOT p2), (AND (NOT p1) (NOT p2))]
Support contains 3 out of 177 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 177/177 places, 202/202 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 176 transition count 180
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 155 transition count 180
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 42 place count 155 transition count 156
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 90 place count 131 transition count 156
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 98 place count 123 transition count 148
Iterating global reduction 2 with 8 rules applied. Total rules applied 106 place count 123 transition count 148
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 106 place count 123 transition count 144
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 114 place count 119 transition count 144
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 86 rules applied. Total rules applied 200 place count 76 transition count 101
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 202 place count 74 transition count 99
Applied a total of 202 rules in 15 ms. Remains 74 /177 variables (removed 103) and now considering 99/202 (removed 103) transitions.
// Phase 1: matrix 99 rows 74 cols
[2023-03-19 16:10:15] [INFO ] Computed 21 place invariants in 0 ms
[2023-03-19 16:10:16] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-19 16:10:16] [INFO ] Invariant cache hit.
[2023-03-19 16:10:16] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2023-03-19 16:10:16] [INFO ] Invariant cache hit.
[2023-03-19 16:10:16] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 74/177 places, 99/202 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 213 ms. Remains : 74/177 places, 99/202 transitions.
Running random walk in product with property : ShieldRVs-PT-005B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(OR p2 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}, { cond=(AND p2 p0), acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND p2 p0), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 5}, { cond=(AND p2 p0), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=(AND p2 p0), acceptance={} source=4 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 7}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=p2, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=7 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(EQ s11 1), p0:(EQ s36 1), p1:(EQ s31 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 31408 reset in 219 ms.
Product exploration explored 100000 steps with 31166 reset in 185 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/74 stabilizing places and 2/99 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (OR p2 (NOT p0))), (X (NOT p0)), (X (X (NOT (AND (NOT p2) p0)))), true, (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (OR p2 (NOT p0)))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p1))), (X (X p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 802 ms. Reduced automaton from 8 states, 24 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 240 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p1), (AND p2 p0), (NOT p2), true, (NOT p2)]
Finished random walk after 114 steps, including 1 resets, run visited all 6 properties in 3 ms. (steps per millisecond=38 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (OR p2 (NOT p0))), (X (NOT p0)), (X (X (NOT (AND (NOT p2) p0)))), true, (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (OR p2 (NOT p0)))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (F (AND (NOT p2) p0)), (F (NOT (AND (NOT p2) (NOT p0)))), (F p2), (F p1), (F (AND p2 p0)), (F (AND p2 (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 854 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p1), (AND p2 p0), (NOT p2), true, (NOT p2)]
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p1), (AND p2 p0), (NOT p2), true, (NOT p2)]
[2023-03-19 16:10:18] [INFO ] Invariant cache hit.
[2023-03-19 16:10:18] [INFO ] [Real]Absence check using 21 positive place invariants in 3 ms returned sat
[2023-03-19 16:10:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 16:10:18] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-19 16:10:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 16:10:18] [INFO ] [Nat]Absence check using 21 positive place invariants in 3 ms returned sat
[2023-03-19 16:10:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 16:10:18] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2023-03-19 16:10:19] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2023-03-19 16:10:19] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2023-03-19 16:10:19] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2023-03-19 16:10:19] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2023-03-19 16:10:19] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 161 ms
[2023-03-19 16:10:19] [INFO ] Computed and/alt/rep : 84/340/84 causal constraints (skipped 13 transitions) in 7 ms.
[2023-03-19 16:10:19] [INFO ] Added : 33 causal constraints over 7 iterations in 77 ms. Result :sat
Could not prove EG (NOT p1)
[2023-03-19 16:10:19] [INFO ] Invariant cache hit.
[2023-03-19 16:10:19] [INFO ] [Real]Absence check using 21 positive place invariants in 3 ms returned sat
[2023-03-19 16:10:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 16:10:19] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2023-03-19 16:10:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 16:10:19] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-19 16:10:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 16:10:19] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2023-03-19 16:10:19] [INFO ] Computed and/alt/rep : 84/340/84 causal constraints (skipped 13 transitions) in 8 ms.
[2023-03-19 16:10:19] [INFO ] Added : 78 causal constraints over 16 iterations in 158 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 3 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 99/99 transitions.
Applied a total of 0 rules in 1 ms. Remains 74 /74 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2023-03-19 16:10:19] [INFO ] Invariant cache hit.
[2023-03-19 16:10:19] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-19 16:10:19] [INFO ] Invariant cache hit.
[2023-03-19 16:10:19] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2023-03-19 16:10:19] [INFO ] Invariant cache hit.
[2023-03-19 16:10:19] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 184 ms. Remains : 74/74 places, 99/99 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/74 stabilizing places and 2/99 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (X (NOT (AND (NOT p2) p0)))), true, (X (X (NOT p2))), (X (X (NOT (AND p2 p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 616 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p1), (AND p0 p2), (NOT p2), true, (NOT p2)]
Finished random walk after 311 steps, including 3 resets, run visited all 6 properties in 4 ms. (steps per millisecond=77 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p2 p0))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (X (NOT (AND (NOT p2) p0)))), true, (X (X (NOT p2))), (X (X (NOT (AND p2 p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F (AND p0 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F p2), (F p1), (F (AND p0 p2)), (F (AND (NOT p0) p2))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 817 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 246 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p1), (AND p0 p2), (NOT p2), true, (NOT p2)]
Stuttering acceptance computed with spot in 255 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p1), (AND p0 p2), (NOT p2), true, (NOT p2)]
[2023-03-19 16:10:21] [INFO ] Invariant cache hit.
[2023-03-19 16:10:22] [INFO ] [Real]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-19 16:10:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 16:10:22] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2023-03-19 16:10:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 16:10:22] [INFO ] [Nat]Absence check using 21 positive place invariants in 4 ms returned sat
[2023-03-19 16:10:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 16:10:22] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-03-19 16:10:22] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2023-03-19 16:10:22] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 0 ms to minimize.
[2023-03-19 16:10:22] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2023-03-19 16:10:22] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2023-03-19 16:10:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 141 ms
[2023-03-19 16:10:22] [INFO ] Computed and/alt/rep : 84/340/84 causal constraints (skipped 13 transitions) in 7 ms.
[2023-03-19 16:10:22] [INFO ] Added : 33 causal constraints over 7 iterations in 76 ms. Result :sat
Could not prove EG (NOT p1)
[2023-03-19 16:10:22] [INFO ] Invariant cache hit.
[2023-03-19 16:10:22] [INFO ] [Real]Absence check using 21 positive place invariants in 3 ms returned sat
[2023-03-19 16:10:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 16:10:22] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-19 16:10:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 16:10:22] [INFO ] [Nat]Absence check using 21 positive place invariants in 3 ms returned sat
[2023-03-19 16:10:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 16:10:22] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-19 16:10:22] [INFO ] Computed and/alt/rep : 84/340/84 causal constraints (skipped 13 transitions) in 6 ms.
[2023-03-19 16:10:22] [INFO ] Added : 78 causal constraints over 16 iterations in 115 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p1), (AND p0 p2), (NOT p2), true, (NOT p2)]
Product exploration explored 100000 steps with 31308 reset in 176 ms.
Entered a terminal (fully accepting) state of product in 69468 steps with 21816 reset in 129 ms.
Treatment of property ShieldRVs-PT-005B-LTLFireability-05 finished in 7665 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
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)||(F(p0) U X(G(p1)))))'
Found a Lengthening insensitive property : ShieldRVs-PT-005B-LTLFireability-06
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 177 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 177/177 places, 202/202 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 176 transition count 180
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 155 transition count 180
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 42 place count 155 transition count 155
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 92 place count 130 transition count 155
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 100 place count 122 transition count 147
Iterating global reduction 2 with 8 rules applied. Total rules applied 108 place count 122 transition count 147
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 108 place count 122 transition count 143
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 116 place count 118 transition count 143
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 200 place count 76 transition count 101
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 202 place count 74 transition count 99
Applied a total of 202 rules in 17 ms. Remains 74 /177 variables (removed 103) and now considering 99/202 (removed 103) transitions.
// Phase 1: matrix 99 rows 74 cols
[2023-03-19 16:10:23] [INFO ] Computed 21 place invariants in 0 ms
[2023-03-19 16:10:23] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-19 16:10:23] [INFO ] Invariant cache hit.
[2023-03-19 16:10:23] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2023-03-19 16:10:23] [INFO ] Invariant cache hit.
[2023-03-19 16:10:23] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 74/177 places, 99/202 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 203 ms. Remains : 74/177 places, 99/202 transitions.
Running random walk in product with property : ShieldRVs-PT-005B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s46 1), p1:(OR (EQ s28 1) (EQ s30 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 27390 reset in 160 ms.
Product exploration explored 100000 steps with 27811 reset in 174 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/74 stabilizing places and 2/99 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 394 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F p0)]
Knowledge based reduction with 4 factoid took 324 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
[2023-03-19 16:10:24] [INFO ] Invariant cache hit.
[2023-03-19 16:10:24] [INFO ] [Real]Absence check using 21 positive place invariants in 4 ms returned sat
[2023-03-19 16:10:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 16:10:24] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2023-03-19 16:10:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 16:10:25] [INFO ] [Nat]Absence check using 21 positive place invariants in 30 ms returned sat
[2023-03-19 16:10:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 16:10:25] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2023-03-19 16:10:25] [INFO ] Computed and/alt/rep : 86/344/86 causal constraints (skipped 11 transitions) in 8 ms.
[2023-03-19 16:10:25] [INFO ] Added : 77 causal constraints over 16 iterations in 164 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 74 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 99/99 transitions.
Applied a total of 0 rules in 3 ms. Remains 74 /74 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2023-03-19 16:10:25] [INFO ] Invariant cache hit.
[2023-03-19 16:10:25] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-19 16:10:25] [INFO ] Invariant cache hit.
[2023-03-19 16:10:25] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2023-03-19 16:10:25] [INFO ] Redundant transitions in 53 ms returned [98]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 98 rows 74 cols
[2023-03-19 16:10:25] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-19 16:10:25] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 74/74 places, 98/99 transitions.
Applied a total of 0 rules in 2 ms. Remains 74 /74 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 351 ms. Remains : 74/74 places, 98/99 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/74 stabilizing places and 2/98 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 176 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 186 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
[2023-03-19 16:10:26] [INFO ] Invariant cache hit.
[2023-03-19 16:10:26] [INFO ] [Real]Absence check using 21 positive place invariants in 3 ms returned sat
[2023-03-19 16:10:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 16:10:26] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2023-03-19 16:10:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 16:10:26] [INFO ] [Nat]Absence check using 21 positive place invariants in 4 ms returned sat
[2023-03-19 16:10:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 16:10:26] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-19 16:10:26] [INFO ] Computed and/alt/rep : 86/345/86 causal constraints (skipped 10 transitions) in 6 ms.
[2023-03-19 16:10:26] [INFO ] Added : 67 causal constraints over 15 iterations in 119 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Product exploration explored 100000 steps with 27625 reset in 157 ms.
Product exploration explored 100000 steps with 27550 reset in 155 ms.
Support contains 1 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 98/98 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 73 transition count 97
Applied a total of 2 rules in 3 ms. Remains 73 /74 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 73 cols
[2023-03-19 16:10:26] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-19 16:10:26] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-19 16:10:26] [INFO ] Invariant cache hit.
[2023-03-19 16:10:26] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2023-03-19 16:10:27] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-19 16:10:27] [INFO ] Invariant cache hit.
[2023-03-19 16:10:27] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 73/74 places, 97/98 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 290 ms. Remains : 73/74 places, 97/98 transitions.
Treatment of property ShieldRVs-PT-005B-LTLFireability-06 finished in 3883 ms.
[2023-03-19 16:10:27] [INFO ] Flatten gal took : 25 ms
[2023-03-19 16:10:27] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 15 ms.
[2023-03-19 16:10:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 177 places, 202 transitions and 668 arcs took 3 ms.
Total runtime 52364 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldRVs-PT-005B
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLFireability

FORMULA ShieldRVs-PT-005B-LTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679242327886

--------------------
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:
++ sed s/.jar//
++ 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
+ 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/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:544
lola: rewrite Frontend/Parser/formula_rewrite.k:373
lola: rewrite Frontend/Parser/formula_rewrite.k:430
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 6 (type EXCL) for 3 ShieldRVs-PT-005B-LTLFireability-03
lola: time limit : 514 sec
lola: memory limit: 32 pages
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-005B-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-005B-LTLFireability-03: CONJ 0 1 1 0 2 0 0 0
ShieldRVs-PT-005B-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-005B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
6 LTL EXCL 5/720 12/32 ShieldRVs-PT-005B-LTLFireability-03 1703304 m, 340660 m/sec, 3954065 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-005B-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-005B-LTLFireability-03: CONJ 0 1 1 0 2 0 0 0
ShieldRVs-PT-005B-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-005B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
6 LTL EXCL 10/720 20/32 ShieldRVs-PT-005B-LTLFireability-03 2936219 m, 246583 m/sec, 8153741 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-005B-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-005B-LTLFireability-03: CONJ 0 1 1 0 2 0 0 0
ShieldRVs-PT-005B-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-005B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
6 LTL EXCL 15/720 26/32 ShieldRVs-PT-005B-LTLFireability-03 4008289 m, 214414 m/sec, 12012059 t fired, .

Time elapsed: 15 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 6 (type EXCL) for ShieldRVs-PT-005B-LTLFireability-03 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-005B-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-005B-LTLFireability-03: CONJ 0 1 0 0 2 0 1 0
ShieldRVs-PT-005B-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-005B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0

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

Time elapsed: 20 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 14 (type EXCL) for 13 ShieldRVs-PT-005B-LTLFireability-06
lola: time limit : 895 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
ShieldRVs-PT-005B-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-005B-LTLFireability-03: CONJ 0 1 0 0 2 0 1 0
ShieldRVs-PT-005B-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-005B-LTLFireability-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 5/895 8/32 ShieldRVs-PT-005B-LTLFireability-06 1178489 m, 235697 m/sec, 3796394 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-005B-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-005B-LTLFireability-03: CONJ 0 1 0 0 2 0 1 0
ShieldRVs-PT-005B-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-005B-LTLFireability-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 10/895 16/32 ShieldRVs-PT-005B-LTLFireability-06 2337992 m, 231900 m/sec, 8055722 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-005B-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-005B-LTLFireability-03: CONJ 0 1 0 0 2 0 1 0
ShieldRVs-PT-005B-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-005B-LTLFireability-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 15/895 23/32 ShieldRVs-PT-005B-LTLFireability-06 3361355 m, 204672 m/sec, 11876198 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-005B-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-005B-LTLFireability-03: CONJ 0 1 0 0 2 0 1 0
ShieldRVs-PT-005B-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-005B-LTLFireability-06: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
14 LTL EXCL 20/895 29/32 ShieldRVs-PT-005B-LTLFireability-06 4253523 m, 178433 m/sec, 15366614 t fired, .

Time elapsed: 40 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 14 (type EXCL) for ShieldRVs-PT-005B-LTLFireability-06 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-005B-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-005B-LTLFireability-03: CONJ 0 1 0 0 2 0 1 0
ShieldRVs-PT-005B-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-005B-LTLFireability-06: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 45 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 11 (type EXCL) for 10 ShieldRVs-PT-005B-LTLFireability-05
lola: time limit : 1185 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
ShieldRVs-PT-005B-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-005B-LTLFireability-03: CONJ 0 1 0 0 2 0 1 0
ShieldRVs-PT-005B-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-005B-LTLFireability-06: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 5/1185 9/32 ShieldRVs-PT-005B-LTLFireability-05 1024352 m, 204870 m/sec, 3596578 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-005B-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-005B-LTLFireability-03: CONJ 0 1 0 0 2 0 1 0
ShieldRVs-PT-005B-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-005B-LTLFireability-06: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 10/1185 14/32 ShieldRVs-PT-005B-LTLFireability-05 1769622 m, 149054 m/sec, 6934632 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-005B-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-005B-LTLFireability-03: CONJ 0 1 0 0 2 0 1 0
ShieldRVs-PT-005B-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-005B-LTLFireability-06: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 15/1185 18/32 ShieldRVs-PT-005B-LTLFireability-05 2472048 m, 140485 m/sec, 10533555 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-005B-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-005B-LTLFireability-03: CONJ 0 1 0 0 2 0 1 0
ShieldRVs-PT-005B-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-005B-LTLFireability-06: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 20/1185 24/32 ShieldRVs-PT-005B-LTLFireability-05 3333503 m, 172291 m/sec, 13902538 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-005B-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-005B-LTLFireability-03: CONJ 0 1 0 0 2 0 1 0
ShieldRVs-PT-005B-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-005B-LTLFireability-06: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 25/1185 29/32 ShieldRVs-PT-005B-LTLFireability-05 4027498 m, 138799 m/sec, 17358475 t fired, .

Time elapsed: 70 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 11 (type EXCL) for ShieldRVs-PT-005B-LTLFireability-05 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-005B-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-005B-LTLFireability-03: CONJ 0 1 0 0 2 0 1 0
ShieldRVs-PT-005B-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-005B-LTLFireability-06: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 75 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 1 (type EXCL) for 0 ShieldRVs-PT-005B-LTLFireability-01
lola: time limit : 1762 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
ShieldRVs-PT-005B-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-005B-LTLFireability-03: CONJ 0 1 0 0 2 0 1 0
ShieldRVs-PT-005B-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-005B-LTLFireability-06: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/1762 7/32 ShieldRVs-PT-005B-LTLFireability-01 973857 m, 194771 m/sec, 3601695 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-005B-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-005B-LTLFireability-03: CONJ 0 1 0 0 2 0 1 0
ShieldRVs-PT-005B-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-005B-LTLFireability-06: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/1762 13/32 ShieldRVs-PT-005B-LTLFireability-01 1871649 m, 179558 m/sec, 7403559 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-005B-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-005B-LTLFireability-03: CONJ 0 1 0 0 2 0 1 0
ShieldRVs-PT-005B-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-005B-LTLFireability-06: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/1762 20/32 ShieldRVs-PT-005B-LTLFireability-01 2807379 m, 187146 m/sec, 11244772 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-005B-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-005B-LTLFireability-03: CONJ 0 1 0 0 2 0 1 0
ShieldRVs-PT-005B-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-005B-LTLFireability-06: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/1762 26/32 ShieldRVs-PT-005B-LTLFireability-01 3784311 m, 195386 m/sec, 15013160 t fired, .

Time elapsed: 95 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 1 (type EXCL) for ShieldRVs-PT-005B-LTLFireability-01 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-005B-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-005B-LTLFireability-03: CONJ 0 1 0 0 2 0 1 0
ShieldRVs-PT-005B-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-005B-LTLFireability-06: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 100 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 8 (type EXCL) for 3 ShieldRVs-PT-005B-LTLFireability-03
lola: time limit : 3500 sec
lola: memory limit: 32 pages
lola: FINISHED task # 8 (type EXCL) for ShieldRVs-PT-005B-LTLFireability-03
lola: result : false
lola: markings : 2839
lola: fired transitions : 7128
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open tasks 4

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVs-PT-005B-LTLFireability-01: LTL unknown AGGR
ShieldRVs-PT-005B-LTLFireability-03: CONJ false LTL model checker
ShieldRVs-PT-005B-LTLFireability-05: LTL unknown AGGR
ShieldRVs-PT-005B-LTLFireability-06: LTL unknown AGGR


Time elapsed: 100 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="ShieldRVs-PT-005B"
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 ShieldRVs-PT-005B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r423-tajo-167905976200076"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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