Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 6.2K Feb 25 15:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 15:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 15:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 15:52 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.8K Feb 25 16:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 15:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Feb 25 15:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 25 15:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 25 15:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 82K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-00
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-01
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-02
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-03
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-04
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-05
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-06
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-07
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-08
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-09
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-10
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-11
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-12
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-13
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-14
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679420625370

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-005B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 17:43:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 17:43:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 17:43:47] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2023-03-21 17:43:47] [INFO ] Transformed 303 places.
[2023-03-21 17:43:47] [INFO ] Transformed 298 transitions.
[2023-03-21 17:43:47] [INFO ] Found NUPN structural information;
[2023-03-21 17:43:47] [INFO ] Parsed PT model containing 303 places and 298 transitions and 896 arcs in 177 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldIIPs-PT-005B-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-005B-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 298/298 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 278 transition count 273
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 278 transition count 273
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 277 transition count 272
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 277 transition count 272
Applied a total of 52 rules in 60 ms. Remains 277 /303 variables (removed 26) and now considering 272/298 (removed 26) transitions.
// Phase 1: matrix 272 rows 277 cols
[2023-03-21 17:43:48] [INFO ] Computed 46 place invariants in 8 ms
[2023-03-21 17:43:48] [INFO ] Implicit Places using invariants in 308 ms returned []
[2023-03-21 17:43:48] [INFO ] Invariant cache hit.
[2023-03-21 17:43:48] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 745 ms to find 0 implicit places.
[2023-03-21 17:43:48] [INFO ] Invariant cache hit.
[2023-03-21 17:43:49] [INFO ] Dead Transitions using invariants and state equation in 265 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 277/303 places, 272/298 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1086 ms. Remains : 277/303 places, 272/298 transitions.
Support contains 46 out of 277 places after structural reductions.
[2023-03-21 17:43:49] [INFO ] Flatten gal took : 45 ms
[2023-03-21 17:43:49] [INFO ] Flatten gal took : 19 ms
[2023-03-21 17:43:49] [INFO ] Input system was already deterministic with 272 transitions.
Support contains 45 out of 277 places (down from 46) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 35) seen :34
Finished Best-First random walk after 8198 steps, including 2 resets, run visited all 1 properties in 12 ms. (steps per millisecond=683 )
Computed a total of 66 stabilizing places and 66 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(((G(p1)&&X(p2))||p0)))'
Support contains 5 out of 277 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 272/272 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 267 transition count 262
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 267 transition count 262
Applied a total of 20 rules in 9 ms. Remains 267 /277 variables (removed 10) and now considering 262/272 (removed 10) transitions.
// Phase 1: matrix 262 rows 267 cols
[2023-03-21 17:43:50] [INFO ] Computed 46 place invariants in 3 ms
[2023-03-21 17:43:50] [INFO ] Implicit Places using invariants in 159 ms returned []
[2023-03-21 17:43:50] [INFO ] Invariant cache hit.
[2023-03-21 17:43:51] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
[2023-03-21 17:43:51] [INFO ] Invariant cache hit.
[2023-03-21 17:43:51] [INFO ] Dead Transitions using invariants and state equation in 221 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 267/277 places, 262/272 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 615 ms. Remains : 267/277 places, 262/272 transitions.
Stuttering acceptance computed with spot in 387 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p1 p2), acceptance={} source=4 dest: 2}]], initial=1, aps=[p1:(OR (EQ s31 0) (EQ s47 0) (EQ s58 0) (EQ s212 1)), p0:(OR (EQ s31 0) (EQ s47 0) (EQ s58 0)), p2:(EQ s223 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 366 ms.
Product exploration explored 100000 steps with 50000 reset in 210 ms.
Computed a total of 59 stabilizing places and 59 stable transitions
Computed a total of 59 stabilizing places and 59 stable transitions
Detected a total of 59/267 stabilizing places and 59/262 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), true, (X (X (AND p1 p2))), (X (X (NOT (OR (NOT p1) (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1)))
Knowledge based reduction with 7 factoid took 129 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-005B-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-005B-LTLFireability-00 finished in 1796 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) U p1)||G(p2)))'
Support contains 5 out of 277 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 277/277 places, 272/272 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 276 transition count 246
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 251 transition count 246
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 50 place count 251 transition count 222
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 98 place count 227 transition count 222
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 106 place count 219 transition count 214
Iterating global reduction 2 with 8 rules applied. Total rules applied 114 place count 219 transition count 214
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 114 place count 219 transition count 211
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 120 place count 216 transition count 211
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 84
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 288 place count 132 transition count 127
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 290 place count 130 transition count 125
Applied a total of 290 rules in 96 ms. Remains 130 /277 variables (removed 147) and now considering 125/272 (removed 147) transitions.
// Phase 1: matrix 125 rows 130 cols
[2023-03-21 17:43:52] [INFO ] Computed 46 place invariants in 1 ms
[2023-03-21 17:43:52] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-21 17:43:52] [INFO ] Invariant cache hit.
[2023-03-21 17:43:52] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
[2023-03-21 17:43:52] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-21 17:43:52] [INFO ] Invariant cache hit.
[2023-03-21 17:43:52] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 130/277 places, 125/272 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 425 ms. Remains : 130/277 places, 125/272 transitions.
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s45 1), p2:(OR (EQ s116 0) (EQ s124 0) (EQ s128 0)), p0:(EQ s44 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 16797 reset in 214 ms.
Product exploration explored 100000 steps with 16522 reset in 247 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/130 stabilizing places and 4/125 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT p1)), (X p1), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 11 factoid took 1165 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 235 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2))]
Finished random walk after 202 steps, including 0 resets, run visited all 9 properties in 17 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT p1)), (X p1), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X p0)), (F p0), (F (NOT (AND p2 (NOT p0) (NOT p1)))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND p2 (NOT p1)))), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p2) (NOT p0) (NOT p1))), (F (NOT (AND p2 (NOT p0)))), (F (AND (NOT p2) (NOT p0)))]
Knowledge based reduction with 11 factoid took 1279 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 125/125 transitions.
Applied a total of 0 rules in 3 ms. Remains 130 /130 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-21 17:43:56] [INFO ] Invariant cache hit.
[2023-03-21 17:43:56] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-21 17:43:56] [INFO ] Invariant cache hit.
[2023-03-21 17:43:56] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
[2023-03-21 17:43:56] [INFO ] Redundant transitions in 34 ms returned []
[2023-03-21 17:43:56] [INFO ] Invariant cache hit.
[2023-03-21 17:43:56] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 446 ms. Remains : 130/130 places, 125/125 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/130 stabilizing places and 4/125 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p2 (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p2 (NOT p0) (NOT p1))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT p1)), (X p1), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p2 (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 11 factoid took 913 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2))]
Finished random walk after 723 steps, including 2 resets, run visited all 9 properties in 34 ms. (steps per millisecond=21 )
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p2 (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p2 (NOT p0) (NOT p1))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT p1)), (X p1), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p2 (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F p0), (F (NOT (AND p2 (NOT p0) (NOT p1)))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND p2 (NOT p1)))), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p2) (NOT p0) (NOT p1))), (F (NOT (AND p2 (NOT p0)))), (F (AND (NOT p2) (NOT p0)))]
Knowledge based reduction with 11 factoid took 1354 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 224 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 16895 reset in 176 ms.
Product exploration explored 100000 steps with 16736 reset in 197 ms.
Support contains 5 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 125/125 transitions.
Applied a total of 0 rules in 3 ms. Remains 130 /130 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2023-03-21 17:44:00] [INFO ] Invariant cache hit.
[2023-03-21 17:44:00] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-21 17:44:00] [INFO ] Invariant cache hit.
[2023-03-21 17:44:00] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
[2023-03-21 17:44:00] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-21 17:44:00] [INFO ] Invariant cache hit.
[2023-03-21 17:44:00] [INFO ] Dead Transitions using invariants and state equation in 163 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 479 ms. Remains : 130/130 places, 125/125 transitions.
Treatment of property ShieldIIPs-PT-005B-LTLFireability-02 finished in 8614 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(G((p0||G(p1)))))))'
Support contains 2 out of 277 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 272/272 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 268 transition count 263
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 268 transition count 263
Applied a total of 18 rules in 4 ms. Remains 268 /277 variables (removed 9) and now considering 263/272 (removed 9) transitions.
// Phase 1: matrix 263 rows 268 cols
[2023-03-21 17:44:01] [INFO ] Computed 46 place invariants in 1 ms
[2023-03-21 17:44:01] [INFO ] Implicit Places using invariants in 190 ms returned []
[2023-03-21 17:44:01] [INFO ] Invariant cache hit.
[2023-03-21 17:44:01] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
[2023-03-21 17:44:01] [INFO ] Invariant cache hit.
[2023-03-21 17:44:01] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 268/277 places, 263/272 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 555 ms. Remains : 268/277 places, 263/272 transitions.
Stuttering acceptance computed with spot in 145 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s189 1), p1:(EQ s112 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-005B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005B-LTLFireability-03 finished in 715 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&(p1||F(p2))))))'
Support contains 6 out of 277 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 272/272 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 268 transition count 263
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 268 transition count 263
Applied a total of 18 rules in 6 ms. Remains 268 /277 variables (removed 9) and now considering 263/272 (removed 9) transitions.
// Phase 1: matrix 263 rows 268 cols
[2023-03-21 17:44:01] [INFO ] Computed 46 place invariants in 1 ms
[2023-03-21 17:44:01] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-21 17:44:01] [INFO ] Invariant cache hit.
[2023-03-21 17:44:02] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
[2023-03-21 17:44:02] [INFO ] Invariant cache hit.
[2023-03-21 17:44:02] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 268/277 places, 263/272 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 416 ms. Remains : 268/277 places, 263/272 transitions.
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s258 1) (AND (EQ s132 1) (EQ s142 1) (EQ s161 1))), p1:(AND (EQ s190 1) (EQ s234 1)), p2:(EQ s258 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 3911 reset in 139 ms.
Product exploration explored 100000 steps with 3895 reset in 206 ms.
Computed a total of 60 stabilizing places and 60 stable transitions
Computed a total of 60 stabilizing places and 60 stable transitions
Detected a total of 60/268 stabilizing places and 60/263 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 296 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Finished random walk after 236 steps, including 0 resets, run visited all 3 properties in 16 ms. (steps per millisecond=14 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (F p0), (F (AND p0 (NOT p2) (NOT p1)))]
Knowledge based reduction with 7 factoid took 332 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
[2023-03-21 17:44:03] [INFO ] Invariant cache hit.
[2023-03-21 17:44:03] [INFO ] [Real]Absence check using 46 positive place invariants in 49 ms returned sat
[2023-03-21 17:44:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 17:44:04] [INFO ] [Real]Absence check using state equation in 258 ms returned sat
[2023-03-21 17:44:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 17:44:04] [INFO ] [Nat]Absence check using 46 positive place invariants in 26 ms returned sat
[2023-03-21 17:44:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 17:44:04] [INFO ] [Nat]Absence check using state equation in 196 ms returned sat
[2023-03-21 17:44:04] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 3 ms to minimize.
[2023-03-21 17:44:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2023-03-21 17:44:04] [INFO ] Computed and/alt/rep : 262/588/262 causal constraints (skipped 0 transitions) in 14 ms.
[2023-03-21 17:44:06] [INFO ] Added : 244 causal constraints over 52 iterations in 2200 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-21 17:44:06] [INFO ] Invariant cache hit.
[2023-03-21 17:44:07] [INFO ] [Real]Absence check using 46 positive place invariants in 31 ms returned sat
[2023-03-21 17:44:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 17:44:07] [INFO ] [Real]Absence check using state equation in 297 ms returned sat
[2023-03-21 17:44:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 17:44:07] [INFO ] [Nat]Absence check using 46 positive place invariants in 13 ms returned sat
[2023-03-21 17:44:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 17:44:07] [INFO ] [Nat]Absence check using state equation in 194 ms returned sat
[2023-03-21 17:44:07] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2023-03-21 17:44:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2023-03-21 17:44:07] [INFO ] Computed and/alt/rep : 262/588/262 causal constraints (skipped 0 transitions) in 19 ms.
[2023-03-21 17:44:09] [INFO ] Added : 262 causal constraints over 54 iterations in 1894 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 6 out of 268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 263/263 transitions.
Applied a total of 0 rules in 2 ms. Remains 268 /268 variables (removed 0) and now considering 263/263 (removed 0) transitions.
[2023-03-21 17:44:09] [INFO ] Invariant cache hit.
[2023-03-21 17:44:09] [INFO ] Implicit Places using invariants in 169 ms returned []
[2023-03-21 17:44:09] [INFO ] Invariant cache hit.
[2023-03-21 17:44:10] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 510 ms to find 0 implicit places.
[2023-03-21 17:44:10] [INFO ] Invariant cache hit.
[2023-03-21 17:44:10] [INFO ] Dead Transitions using invariants and state equation in 220 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 733 ms. Remains : 268/268 places, 263/263 transitions.
Computed a total of 60 stabilizing places and 60 stable transitions
Computed a total of 60 stabilizing places and 60 stable transitions
Detected a total of 60/268 stabilizing places and 60/263 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 349 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Finished random walk after 1520 steps, including 2 resets, run visited all 3 properties in 8 ms. (steps per millisecond=190 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT p0))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (F p0), (F (AND p0 (NOT p2) (NOT p1)))]
Knowledge based reduction with 7 factoid took 353 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
[2023-03-21 17:44:11] [INFO ] Invariant cache hit.
[2023-03-21 17:44:11] [INFO ] [Real]Absence check using 46 positive place invariants in 17 ms returned sat
[2023-03-21 17:44:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 17:44:12] [INFO ] [Real]Absence check using state equation in 295 ms returned sat
[2023-03-21 17:44:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 17:44:12] [INFO ] [Nat]Absence check using 46 positive place invariants in 28 ms returned sat
[2023-03-21 17:44:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 17:44:12] [INFO ] [Nat]Absence check using state equation in 206 ms returned sat
[2023-03-21 17:44:12] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2023-03-21 17:44:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2023-03-21 17:44:12] [INFO ] Computed and/alt/rep : 262/588/262 causal constraints (skipped 0 transitions) in 16 ms.
[2023-03-21 17:44:14] [INFO ] Added : 244 causal constraints over 52 iterations in 1981 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-21 17:44:14] [INFO ] Invariant cache hit.
[2023-03-21 17:44:14] [INFO ] [Real]Absence check using 46 positive place invariants in 17 ms returned sat
[2023-03-21 17:44:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 17:44:15] [INFO ] [Real]Absence check using state equation in 249 ms returned sat
[2023-03-21 17:44:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 17:44:15] [INFO ] [Nat]Absence check using 46 positive place invariants in 18 ms returned sat
[2023-03-21 17:44:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 17:44:15] [INFO ] [Nat]Absence check using state equation in 273 ms returned sat
[2023-03-21 17:44:15] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 4 ms to minimize.
[2023-03-21 17:44:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2023-03-21 17:44:15] [INFO ] Computed and/alt/rep : 262/588/262 causal constraints (skipped 0 transitions) in 49 ms.
[2023-03-21 17:44:17] [INFO ] Added : 262 causal constraints over 54 iterations in 1799 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 3931 reset in 165 ms.
Product exploration explored 100000 steps with 3887 reset in 162 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Support contains 6 out of 268 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 268/268 places, 263/263 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 268 transition count 263
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 13 Pre rules applied. Total rules applied 23 place count 268 transition count 267
Deduced a syphon composed of 36 places in 1 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 36 place count 268 transition count 267
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 136 places in 0 ms
Iterating global reduction 1 with 100 rules applied. Total rules applied 136 place count 268 transition count 267
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 168 place count 236 transition count 235
Deduced a syphon composed of 104 places in 0 ms
Iterating global reduction 1 with 32 rules applied. Total rules applied 200 place count 236 transition count 235
Deduced a syphon composed of 104 places in 0 ms
Applied a total of 200 rules in 50 ms. Remains 236 /268 variables (removed 32) and now considering 235/263 (removed 28) transitions.
[2023-03-21 17:44:18] [INFO ] Redundant transitions in 41 ms returned [234]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 234 rows 236 cols
[2023-03-21 17:44:18] [INFO ] Computed 46 place invariants in 2 ms
[2023-03-21 17:44:18] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 236/268 places, 234/263 transitions.
Deduced a syphon composed of 104 places in 0 ms
Applied a total of 0 rules in 7 ms. Remains 236 /236 variables (removed 0) and now considering 234/234 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 238 ms. Remains : 236/268 places, 234/263 transitions.
Support contains 6 out of 268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 263/263 transitions.
Applied a total of 0 rules in 4 ms. Remains 268 /268 variables (removed 0) and now considering 263/263 (removed 0) transitions.
// Phase 1: matrix 263 rows 268 cols
[2023-03-21 17:44:18] [INFO ] Computed 46 place invariants in 2 ms
[2023-03-21 17:44:18] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-21 17:44:18] [INFO ] Invariant cache hit.
[2023-03-21 17:44:18] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
[2023-03-21 17:44:18] [INFO ] Invariant cache hit.
[2023-03-21 17:44:18] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 418 ms. Remains : 268/268 places, 263/263 transitions.
Treatment of property ShieldIIPs-PT-005B-LTLFireability-04 finished in 17112 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)) U G(p1)))'
Support contains 2 out of 277 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 277/277 places, 272/272 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 276 transition count 246
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 251 transition count 246
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 50 place count 251 transition count 220
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 102 place count 225 transition count 220
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 111 place count 216 transition count 211
Iterating global reduction 2 with 9 rules applied. Total rules applied 120 place count 216 transition count 211
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 120 place count 216 transition count 208
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 126 place count 213 transition count 208
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 84
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 294 place count 129 transition count 124
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 296 place count 127 transition count 122
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 297 place count 126 transition count 122
Applied a total of 297 rules in 28 ms. Remains 126 /277 variables (removed 151) and now considering 122/272 (removed 150) transitions.
// Phase 1: matrix 122 rows 126 cols
[2023-03-21 17:44:18] [INFO ] Computed 45 place invariants in 1 ms
[2023-03-21 17:44:19] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-03-21 17:44:19] [INFO ] Invariant cache hit.
[2023-03-21 17:44:19] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
[2023-03-21 17:44:19] [INFO ] Redundant transitions in 22 ms returned [121]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 121 rows 126 cols
[2023-03-21 17:44:19] [INFO ] Computed 45 place invariants in 0 ms
[2023-03-21 17:44:19] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 126/277 places, 121/272 transitions.
Applied a total of 0 rules in 16 ms. Remains 126 /126 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 416 ms. Remains : 126/277 places, 121/272 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (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=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(NEQ s21 1), p0:(EQ s43 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 799 steps with 2 reset in 2 ms.
FORMULA ShieldIIPs-PT-005B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005B-LTLFireability-05 finished in 579 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U ((!p1||G((p2&&X(!p1)))) U !p2)))'
Support contains 3 out of 277 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 277/277 places, 272/272 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 276 transition count 246
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 251 transition count 246
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 50 place count 251 transition count 222
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 98 place count 227 transition count 222
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 107 place count 218 transition count 213
Iterating global reduction 2 with 9 rules applied. Total rules applied 116 place count 218 transition count 213
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 116 place count 218 transition count 209
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 124 place count 214 transition count 209
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 0 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 164 rules applied. Total rules applied 288 place count 132 transition count 127
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 290 place count 130 transition count 125
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 291 place count 129 transition count 125
Applied a total of 291 rules in 34 ms. Remains 129 /277 variables (removed 148) and now considering 125/272 (removed 147) transitions.
// Phase 1: matrix 125 rows 129 cols
[2023-03-21 17:44:19] [INFO ] Computed 45 place invariants in 1 ms
[2023-03-21 17:44:19] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-21 17:44:19] [INFO ] Invariant cache hit.
[2023-03-21 17:44:19] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2023-03-21 17:44:19] [INFO ] Redundant transitions in 25 ms returned [124]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 124 rows 129 cols
[2023-03-21 17:44:19] [INFO ] Computed 45 place invariants in 0 ms
[2023-03-21 17:44:19] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 129/277 places, 124/272 transitions.
Applied a total of 0 rules in 12 ms. Remains 129 /129 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 375 ms. Remains : 129/277 places, 124/272 transitions.
Stuttering acceptance computed with spot in 100 ms :[true, p2, p2]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p2 p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p2 p0), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND p2 p1), acceptance={0} source=2 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p2:(NEQ s51 1), p1:(EQ s43 1), p0:(EQ s89 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 3 steps with 1 reset in 0 ms.
FORMULA ShieldIIPs-PT-005B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005B-LTLFireability-06 finished in 508 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)||((p1 U ((p2||X(p2)) U (G((p2||X(p2)))||(p3&&(p2||X(p2)))))) U G(!p3))))'
Support contains 6 out of 277 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 272/272 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 267 transition count 262
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 267 transition count 262
Applied a total of 20 rules in 4 ms. Remains 267 /277 variables (removed 10) and now considering 262/272 (removed 10) transitions.
// Phase 1: matrix 262 rows 267 cols
[2023-03-21 17:44:20] [INFO ] Computed 46 place invariants in 14 ms
[2023-03-21 17:44:20] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-21 17:44:20] [INFO ] Invariant cache hit.
[2023-03-21 17:44:20] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
[2023-03-21 17:44:20] [INFO ] Invariant cache hit.
[2023-03-21 17:44:20] [INFO ] Dead Transitions using invariants and state equation in 163 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 267/277 places, 262/272 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 457 ms. Remains : 267/277 places, 262/272 transitions.
Stuttering acceptance computed with spot in 723 ms :[(AND (NOT p0) p3), (AND p3 (NOT p2) (NOT p0)), (AND (NOT p2) p3 p1 (NOT p0)), (AND (NOT p0) p3), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2) (NOT p3)), true, p3, (NOT p2), (AND p3 (NOT p2)), (AND (NOT p2) p3 p1), p3, (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=(AND p3 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 4}, { cond=(AND p3 (NOT p2) p1), acceptance={} source=0 dest: 5}], [{ cond=(AND p3 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 6}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 7}], [{ cond=(AND p3 (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 8}, { cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 9}, { cond=(AND (NOT p3) p1 (NOT p0)), acceptance={} source=2 dest: 10}], [{ cond=(AND p3 (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 8}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 9}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 10}, { cond=(NOT p0), acceptance={} source=3 dest: 11}, { cond=(AND p3 (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 12}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 8}, { cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={} source=5 dest: 12}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 13}, { cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={} source=5 dest: 14}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=p3, acceptance={} source=7 dest: 6}, { cond=(NOT p3), acceptance={} source=7 dest: 7}], [{ cond=(NOT p2), acceptance={} source=8 dest: 6}], [{ cond=(AND p3 (NOT p2)), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=9 dest: 7}], [{ cond=(AND p3 (NOT p2) p1), acceptance={} source=10 dest: 8}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=10 dest: 9}, { cond=(AND (NOT p3) p1), acceptance={} source=10 dest: 10}], [{ cond=(AND p3 (NOT p2) (NOT p1)), acceptance={} source=11 dest: 8}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=11 dest: 9}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=11 dest: 10}, { cond=(NOT p3), acceptance={} source=11 dest: 11}, { cond=p3, acceptance={0} source=11 dest: 11}, { cond=(AND p3 (NOT p2) p1), acceptance={} source=11 dest: 12}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=12 dest: 8}, { cond=(AND (NOT p2) p1), acceptance={0} source=12 dest: 12}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=12 dest: 13}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=12 dest: 14}], [{ cond=(NOT p2), acceptance={} source=13 dest: 8}, { cond=(NOT p3), acceptance={} source=13 dest: 13}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=14 dest: 8}, { cond=(AND (NOT p2) p1), acceptance={0} source=14 dest: 12}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=14 dest: 13}, { cond=(AND (NOT p3) p1), acceptance={} source=14 dest: 14}]], initial=0, aps=[p3:(NEQ s165 1), p2:(NEQ s84 1), p1:(AND (EQ s76 1) (EQ s100 1)), p0:(AND (EQ s126 1) (EQ s141 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 183 steps with 5 reset in 0 ms.
FORMULA ShieldIIPs-PT-005B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005B-LTLFireability-08 finished in 1235 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) U G(p1)))'
Support contains 2 out of 277 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 277/277 places, 272/272 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 276 transition count 245
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 250 transition count 245
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 52 place count 250 transition count 219
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 104 place count 224 transition count 219
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 114 place count 214 transition count 209
Iterating global reduction 2 with 10 rules applied. Total rules applied 124 place count 214 transition count 209
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 124 place count 214 transition count 205
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 132 place count 210 transition count 205
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 290 place count 131 transition count 126
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 292 place count 129 transition count 124
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 293 place count 128 transition count 124
Applied a total of 293 rules in 38 ms. Remains 128 /277 variables (removed 149) and now considering 124/272 (removed 148) transitions.
// Phase 1: matrix 124 rows 128 cols
[2023-03-21 17:44:21] [INFO ] Computed 45 place invariants in 0 ms
[2023-03-21 17:44:21] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-21 17:44:21] [INFO ] Invariant cache hit.
[2023-03-21 17:44:21] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2023-03-21 17:44:21] [INFO ] Redundant transitions in 45 ms returned [123]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 123 rows 128 cols
[2023-03-21 17:44:21] [INFO ] Computed 45 place invariants in 1 ms
[2023-03-21 17:44:21] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 128/277 places, 123/272 transitions.
Applied a total of 0 rules in 2 ms. Remains 128 /128 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 439 ms. Remains : 128/277 places, 123/272 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), p0]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(NEQ s64 1), p0:(EQ s91 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 506 reset in 246 ms.
Product exploration explored 100000 steps with 506 reset in 267 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/128 stabilizing places and 4/123 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 383 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), p0]
Finished random walk after 253 steps, including 1 resets, run visited all 3 properties in 1 ms. (steps per millisecond=253 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F p0), (F (AND (NOT p1) p0))]
Knowledge based reduction with 4 factoid took 688 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), p0]
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), p0]
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 123/123 transitions.
Applied a total of 0 rules in 2 ms. Remains 128 /128 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2023-03-21 17:44:23] [INFO ] Invariant cache hit.
[2023-03-21 17:44:23] [INFO ] Implicit Places using invariants in 117 ms returned []
[2023-03-21 17:44:23] [INFO ] Invariant cache hit.
[2023-03-21 17:44:24] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
[2023-03-21 17:44:24] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-21 17:44:24] [INFO ] Invariant cache hit.
[2023-03-21 17:44:24] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 517 ms. Remains : 128/128 places, 123/123 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/128 stabilizing places and 4/123 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 495 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), p0]
Finished random walk after 277 steps, including 1 resets, run visited all 3 properties in 1 ms. (steps per millisecond=277 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F p0), (F (AND (NOT p1) p0))]
Knowledge based reduction with 4 factoid took 458 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), p0]
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), p0]
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), p0]
Product exploration explored 100000 steps with 505 reset in 224 ms.
Product exploration explored 100000 steps with 489 reset in 236 ms.
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 123/123 transitions.
Applied a total of 0 rules in 9 ms. Remains 128 /128 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2023-03-21 17:44:26] [INFO ] Invariant cache hit.
[2023-03-21 17:44:26] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-21 17:44:26] [INFO ] Invariant cache hit.
[2023-03-21 17:44:26] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2023-03-21 17:44:26] [INFO ] Redundant transitions in 36 ms returned []
[2023-03-21 17:44:26] [INFO ] Invariant cache hit.
[2023-03-21 17:44:26] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 339 ms. Remains : 128/128 places, 123/123 transitions.
Treatment of property ShieldIIPs-PT-005B-LTLFireability-09 finished in 5230 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||F(p1)||G(p2)))))'
Support contains 3 out of 277 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 272/272 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 268 transition count 263
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 268 transition count 263
Applied a total of 18 rules in 4 ms. Remains 268 /277 variables (removed 9) and now considering 263/272 (removed 9) transitions.
// Phase 1: matrix 263 rows 268 cols
[2023-03-21 17:44:26] [INFO ] Computed 46 place invariants in 1 ms
[2023-03-21 17:44:26] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-21 17:44:26] [INFO ] Invariant cache hit.
[2023-03-21 17:44:26] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
[2023-03-21 17:44:26] [INFO ] Invariant cache hit.
[2023-03-21 17:44:27] [INFO ] Dead Transitions using invariants and state equation in 225 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 268/277 places, 263/272 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 649 ms. Remains : 268/277 places, 263/272 transitions.
Stuttering acceptance computed with spot in 228 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(EQ s107 1), p2:(EQ s141 1), p0:(EQ s72 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 101 ms.
Product exploration explored 100000 steps with 33333 reset in 111 ms.
Computed a total of 59 stabilizing places and 59 stable transitions
Computed a total of 59 stabilizing places and 59 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p0) (NOT p1) p2))))
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-005B-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-005B-LTLFireability-10 finished in 1224 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 277 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 277/277 places, 272/272 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 276 transition count 245
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 250 transition count 245
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 52 place count 250 transition count 219
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 104 place count 224 transition count 219
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 113 place count 215 transition count 210
Iterating global reduction 2 with 9 rules applied. Total rules applied 122 place count 215 transition count 210
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 122 place count 215 transition count 207
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 128 place count 212 transition count 207
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 294 place count 129 transition count 124
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 296 place count 127 transition count 122
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 297 place count 126 transition count 122
Applied a total of 297 rules in 18 ms. Remains 126 /277 variables (removed 151) and now considering 122/272 (removed 150) transitions.
// Phase 1: matrix 122 rows 126 cols
[2023-03-21 17:44:27] [INFO ] Computed 45 place invariants in 0 ms
[2023-03-21 17:44:27] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-21 17:44:27] [INFO ] Invariant cache hit.
[2023-03-21 17:44:28] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
[2023-03-21 17:44:28] [INFO ] Redundant transitions in 85 ms returned [121]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 121 rows 126 cols
[2023-03-21 17:44:28] [INFO ] Computed 45 place invariants in 1 ms
[2023-03-21 17:44:28] [INFO ] Dead Transitions using invariants and state equation in 177 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 126/277 places, 121/272 transitions.
Applied a total of 0 rules in 2 ms. Remains 126 /126 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 680 ms. Remains : 126/277 places, 121/272 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s49 1) (NEQ s37 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1790 reset in 177 ms.
Product exploration explored 100000 steps with 1808 reset in 214 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 157 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (NOT p0)]
Finished random walk after 54 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=54 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 121/121 transitions.
Applied a total of 0 rules in 1 ms. Remains 126 /126 variables (removed 0) and now considering 121/121 (removed 0) transitions.
[2023-03-21 17:44:29] [INFO ] Invariant cache hit.
[2023-03-21 17:44:29] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-21 17:44:29] [INFO ] Invariant cache hit.
[2023-03-21 17:44:29] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
[2023-03-21 17:44:29] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-21 17:44:29] [INFO ] Invariant cache hit.
[2023-03-21 17:44:29] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 358 ms. Remains : 126/126 places, 121/121 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 147 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Finished random walk after 52 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=52 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1791 reset in 183 ms.
Product exploration explored 100000 steps with 1805 reset in 197 ms.
Support contains 2 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 121/121 transitions.
Applied a total of 0 rules in 2 ms. Remains 126 /126 variables (removed 0) and now considering 121/121 (removed 0) transitions.
[2023-03-21 17:44:30] [INFO ] Invariant cache hit.
[2023-03-21 17:44:31] [INFO ] Implicit Places using invariants in 318 ms returned []
[2023-03-21 17:44:31] [INFO ] Invariant cache hit.
[2023-03-21 17:44:31] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 449 ms to find 0 implicit places.
[2023-03-21 17:44:31] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-21 17:44:31] [INFO ] Invariant cache hit.
[2023-03-21 17:44:31] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 555 ms. Remains : 126/126 places, 121/121 transitions.
Treatment of property ShieldIIPs-PT-005B-LTLFireability-11 finished in 3729 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 G((p1 U !p0)))&&F((p2 U (p3||G(p2))))))'
Support contains 4 out of 277 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 277/277 places, 272/272 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 276 transition count 245
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 250 transition count 245
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 52 place count 250 transition count 220
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 102 place count 225 transition count 220
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 111 place count 216 transition count 211
Iterating global reduction 2 with 9 rules applied. Total rules applied 120 place count 216 transition count 211
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 120 place count 216 transition count 208
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 126 place count 213 transition count 208
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 1 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 164 rules applied. Total rules applied 290 place count 131 transition count 126
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 292 place count 129 transition count 124
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 293 place count 128 transition count 124
Applied a total of 293 rules in 18 ms. Remains 128 /277 variables (removed 149) and now considering 124/272 (removed 148) transitions.
// Phase 1: matrix 124 rows 128 cols
[2023-03-21 17:44:31] [INFO ] Computed 45 place invariants in 1 ms
[2023-03-21 17:44:31] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-21 17:44:31] [INFO ] Invariant cache hit.
[2023-03-21 17:44:31] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
[2023-03-21 17:44:31] [INFO ] Redundant transitions in 53 ms returned [123]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 123 rows 128 cols
[2023-03-21 17:44:31] [INFO ] Computed 45 place invariants in 1 ms
[2023-03-21 17:44:31] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 128/277 places, 123/272 transitions.
Applied a total of 0 rules in 2 ms. Remains 128 /128 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 470 ms. Remains : 128/277 places, 123/272 transitions.
Stuttering acceptance computed with spot in 274 ms :[(OR p0 (AND (NOT p2) (NOT p3))), p0, p0, (AND (NOT p3) (NOT p2)), p0, true, p0]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p3), acceptance={} source=0 dest: 3}, { cond=(AND p0 p1), acceptance={} source=0 dest: 4}], [{ cond=(OR (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 5}, { cond=(AND p0 p1), acceptance={} source=1 dest: 6}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p3) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p0 p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s25 1), p3:(AND (NEQ s71 1) (NEQ s127 1)), p1:(EQ s88 1), p2:(NEQ s127 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 39 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-005B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005B-LTLFireability-12 finished in 780 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(G(p1))&&p0))))'
Support contains 3 out of 277 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 272/272 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 268 transition count 263
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 268 transition count 263
Applied a total of 18 rules in 4 ms. Remains 268 /277 variables (removed 9) and now considering 263/272 (removed 9) transitions.
// Phase 1: matrix 263 rows 268 cols
[2023-03-21 17:44:32] [INFO ] Computed 46 place invariants in 1 ms
[2023-03-21 17:44:32] [INFO ] Implicit Places using invariants in 125 ms returned []
[2023-03-21 17:44:32] [INFO ] Invariant cache hit.
[2023-03-21 17:44:32] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
[2023-03-21 17:44:32] [INFO ] Invariant cache hit.
[2023-03-21 17:44:32] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 268/277 places, 263/272 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 579 ms. Remains : 268/277 places, 263/272 transitions.
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s150 1) (EQ s238 1)), p1:(EQ s230 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 763 steps with 0 reset in 2 ms.
FORMULA ShieldIIPs-PT-005B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005B-LTLFireability-13 finished in 770 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((!(p1 U (p0 U p2))&&G(p3)))))'
Support contains 5 out of 277 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 272/272 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 268 transition count 263
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 268 transition count 263
Applied a total of 18 rules in 3 ms. Remains 268 /277 variables (removed 9) and now considering 263/272 (removed 9) transitions.
// Phase 1: matrix 263 rows 268 cols
[2023-03-21 17:44:32] [INFO ] Computed 46 place invariants in 1 ms
[2023-03-21 17:44:33] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-03-21 17:44:33] [INFO ] Invariant cache hit.
[2023-03-21 17:44:33] [INFO ] Implicit Places using invariants and state equation in 446 ms returned []
Implicit Place search using SMT with State Equation took 583 ms to find 0 implicit places.
[2023-03-21 17:44:33] [INFO ] Invariant cache hit.
[2023-03-21 17:44:33] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 268/277 places, 263/272 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 717 ms. Remains : 268/277 places, 263/272 transitions.
Stuttering acceptance computed with spot in 246 ms :[true, (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) p2)), (NOT p3), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) p2)), (OR (NOT p3) p2), (OR (NOT p3) p2)]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p3), acceptance={} source=2 dest: 0}, { cond=p3, acceptance={} source=2 dest: 2}], [{ cond=(OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p3))), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) p3), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2) p3), acceptance={} source=3 dest: 5}], [{ cond=(OR p2 (NOT p3)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p3), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p2) p3), acceptance={} source=4 dest: 4}], [{ cond=(OR p2 (NOT p3)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) p3), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2) p3), acceptance={} source=5 dest: 4}, { cond=(AND p1 (NOT p2) p3), acceptance={} source=5 dest: 5}]], initial=1, aps=[p3:(EQ s10 1), p0:(EQ s191 1), p2:(AND (EQ s233 1) (EQ s257 1)), p1:(EQ s219 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-005B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005B-LTLFireability-14 finished in 977 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)||(p1&&F(!p2)&&X(p3)))))'
Support contains 4 out of 277 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 272/272 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 268 transition count 263
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 268 transition count 263
Applied a total of 18 rules in 3 ms. Remains 268 /277 variables (removed 9) and now considering 263/272 (removed 9) transitions.
// Phase 1: matrix 263 rows 268 cols
[2023-03-21 17:44:33] [INFO ] Computed 46 place invariants in 1 ms
[2023-03-21 17:44:34] [INFO ] Implicit Places using invariants in 124 ms returned []
[2023-03-21 17:44:34] [INFO ] Invariant cache hit.
[2023-03-21 17:44:34] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
[2023-03-21 17:44:34] [INFO ] Invariant cache hit.
[2023-03-21 17:44:34] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 268/277 places, 263/272 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 575 ms. Remains : 268/277 places, 263/272 transitions.
Stuttering acceptance computed with spot in 352 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) p2)), true, (NOT p0), p2, (NOT p3), (AND (NOT p0) (NOT p3)), (AND p2 (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 5}, { cond=(AND p0 p1), acceptance={} source=1 dest: 6}, { cond=(AND p0 p1 p2), acceptance={} source=1 dest: 7}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=p2, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={} source=5 dest: 2}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=6 dest: 2}, { cond=(AND p0 (NOT p3)), acceptance={} source=6 dest: 3}], [{ cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 4}, { cond=(AND p0 p2), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(EQ s161 1), p1:(EQ s56 1), p2:(NEQ s84 1), p3:(EQ s196 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-005B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005B-LTLFireability-15 finished in 941 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) U p1)||G(p2)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&(p1||F(p2))))))'
Found a Shortening insensitive property : ShieldIIPs-PT-005B-LTLFireability-04
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Support contains 6 out of 277 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 277/277 places, 272/272 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 276 transition count 247
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 252 transition count 247
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 48 place count 252 transition count 221
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 100 place count 226 transition count 221
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 109 place count 217 transition count 212
Iterating global reduction 2 with 9 rules applied. Total rules applied 118 place count 217 transition count 212
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 118 place count 217 transition count 209
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 124 place count 214 transition count 209
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Deduced a syphon composed of 81 places in 0 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 2 with 162 rules applied. Total rules applied 286 place count 133 transition count 128
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 288 place count 131 transition count 126
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 289 place count 130 transition count 126
Applied a total of 289 rules in 32 ms. Remains 130 /277 variables (removed 147) and now considering 126/272 (removed 146) transitions.
// Phase 1: matrix 126 rows 130 cols
[2023-03-21 17:44:35] [INFO ] Computed 45 place invariants in 1 ms
[2023-03-21 17:44:35] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-21 17:44:35] [INFO ] Invariant cache hit.
[2023-03-21 17:44:35] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
[2023-03-21 17:44:35] [INFO ] Invariant cache hit.
[2023-03-21 17:44:35] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 130/277 places, 126/272 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 450 ms. Remains : 130/277 places, 126/272 transitions.
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s125 1) (AND (EQ s60 1) (EQ s67 1) (EQ s77 1))), p1:(AND (EQ s90 1) (EQ s112 1)), p2:(EQ s125 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33361 reset in 127 ms.
Product exploration explored 100000 steps with 33351 reset in 151 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Detected a total of 3/130 stabilizing places and 3/126 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 4 factoid took 304 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Finished random walk after 151 steps, including 0 resets, run visited all 3 properties in 15 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))))), (X (X (NOT p0))), (X (X p0)), (F p0), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (F (AND p0 (NOT p2) (NOT p1)))]
Knowledge based reduction with 4 factoid took 468 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
[2023-03-21 17:44:37] [INFO ] Invariant cache hit.
[2023-03-21 17:44:37] [INFO ] [Real]Absence check using 45 positive place invariants in 10 ms returned sat
[2023-03-21 17:44:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 17:44:37] [INFO ] [Real]Absence check using state equation in 266 ms returned sat
[2023-03-21 17:44:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 17:44:37] [INFO ] [Nat]Absence check using 45 positive place invariants in 9 ms returned sat
[2023-03-21 17:44:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 17:44:37] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2023-03-21 17:44:37] [INFO ] Computed and/alt/rep : 123/313/123 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-21 17:44:38] [INFO ] Added : 94 causal constraints over 21 iterations in 426 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-21 17:44:38] [INFO ] Invariant cache hit.
[2023-03-21 17:44:38] [INFO ] [Real]Absence check using 45 positive place invariants in 15 ms returned sat
[2023-03-21 17:44:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 17:44:38] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2023-03-21 17:44:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 17:44:38] [INFO ] [Nat]Absence check using 45 positive place invariants in 7 ms returned sat
[2023-03-21 17:44:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 17:44:38] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2023-03-21 17:44:38] [INFO ] Computed and/alt/rep : 123/313/123 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-21 17:44:39] [INFO ] Added : 98 causal constraints over 25 iterations in 528 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 6 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 126/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 130 /130 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2023-03-21 17:44:39] [INFO ] Invariant cache hit.
[2023-03-21 17:44:39] [INFO ] Implicit Places using invariants in 222 ms returned []
[2023-03-21 17:44:39] [INFO ] Invariant cache hit.
[2023-03-21 17:44:39] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 586 ms to find 0 implicit places.
[2023-03-21 17:44:39] [INFO ] Invariant cache hit.
[2023-03-21 17:44:39] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 663 ms. Remains : 130/130 places, 126/126 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Detected a total of 3/130 stabilizing places and 3/126 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))))]
Knowledge based reduction with 4 factoid took 236 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Finished random walk after 1275 steps, including 4 resets, run visited all 3 properties in 5 ms. (steps per millisecond=255 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))))), (F p0), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (F (AND p0 (NOT p2) (NOT p1)))]
Knowledge based reduction with 4 factoid took 342 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
[2023-03-21 17:44:40] [INFO ] Invariant cache hit.
[2023-03-21 17:44:40] [INFO ] [Real]Absence check using 45 positive place invariants in 15 ms returned sat
[2023-03-21 17:44:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 17:44:40] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2023-03-21 17:44:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 17:44:41] [INFO ] [Nat]Absence check using 45 positive place invariants in 14 ms returned sat
[2023-03-21 17:44:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 17:44:41] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2023-03-21 17:44:41] [INFO ] Computed and/alt/rep : 123/313/123 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-21 17:44:41] [INFO ] Added : 94 causal constraints over 21 iterations in 406 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-21 17:44:41] [INFO ] Invariant cache hit.
[2023-03-21 17:44:41] [INFO ] [Real]Absence check using 45 positive place invariants in 22 ms returned sat
[2023-03-21 17:44:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 17:44:41] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2023-03-21 17:44:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 17:44:41] [INFO ] [Nat]Absence check using 45 positive place invariants in 16 ms returned sat
[2023-03-21 17:44:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 17:44:42] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2023-03-21 17:44:42] [INFO ] Computed and/alt/rep : 123/313/123 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-21 17:44:42] [INFO ] Added : 98 causal constraints over 25 iterations in 473 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 33428 reset in 165 ms.
Product exploration explored 100000 steps with 33349 reset in 245 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Support contains 6 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 126/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 130 /130 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2023-03-21 17:44:43] [INFO ] Redundant transitions in 33 ms returned [125]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 125 rows 130 cols
[2023-03-21 17:44:43] [INFO ] Computed 45 place invariants in 1 ms
[2023-03-21 17:44:43] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 130/130 places, 125/126 transitions.
Applied a total of 0 rules in 2 ms. Remains 130 /130 variables (removed 0) and now considering 125/125 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 166 ms. Remains : 130/130 places, 125/126 transitions.
Support contains 6 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 126/126 transitions.
Applied a total of 0 rules in 0 ms. Remains 130 /130 variables (removed 0) and now considering 126/126 (removed 0) transitions.
// Phase 1: matrix 126 rows 130 cols
[2023-03-21 17:44:43] [INFO ] Computed 45 place invariants in 0 ms
[2023-03-21 17:44:43] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-21 17:44:43] [INFO ] Invariant cache hit.
[2023-03-21 17:44:43] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2023-03-21 17:44:43] [INFO ] Invariant cache hit.
[2023-03-21 17:44:43] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 341 ms. Remains : 130/130 places, 126/126 transitions.
Treatment of property ShieldIIPs-PT-005B-LTLFireability-04 finished in 8855 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) U 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' '!(G(F(p0)))'
[2023-03-21 17:44:43] [INFO ] Flatten gal took : 15 ms
[2023-03-21 17:44:43] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-21 17:44:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 277 places, 272 transitions and 844 arcs took 3 ms.
Total runtime 56306 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2403/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2403/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2403/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2403/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldIIPs-PT-005B-LTLFireability-02
Could not compute solution for formula : ShieldIIPs-PT-005B-LTLFireability-04
Could not compute solution for formula : ShieldIIPs-PT-005B-LTLFireability-09
Could not compute solution for formula : ShieldIIPs-PT-005B-LTLFireability-11

BK_STOP 1679420685007

--------------------
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
mcc2023
ltl formula name ShieldIIPs-PT-005B-LTLFireability-02
ltl formula formula --ltl=/tmp/2403/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 277 places, 272 transitions and 844 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2403/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2403/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.010 user 0.030 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2403/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2403/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name ShieldIIPs-PT-005B-LTLFireability-04
ltl formula formula --ltl=/tmp/2403/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 277 places, 272 transitions and 844 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2403/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2403/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2403/ltl_1_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.030 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2403/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
corrupted size vs. prev_size in fastbins
ltl formula name ShieldIIPs-PT-005B-LTLFireability-09
ltl formula formula --ltl=/tmp/2403/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 277 places, 272 transitions and 844 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2403/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2403/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2403/ltl_2_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.010 user 0.030 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2403/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name ShieldIIPs-PT-005B-LTLFireability-11
ltl formula formula --ltl=/tmp/2403/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 277 places, 272 transitions and 844 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2403/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2403/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2403/ltl_3_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.020 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2403/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x555ab6b163f4]
1: pnml2lts-mc(+0xa2496) [0x555ab6b16496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f2d76c84140]
3: pnml2lts-mc(+0x405be5) [0x555ab6e79be5]
4: pnml2lts-mc(+0x16b3f9) [0x555ab6bdf3f9]
5: pnml2lts-mc(+0x164ac4) [0x555ab6bd8ac4]
6: pnml2lts-mc(+0x272e0a) [0x555ab6ce6e0a]
7: pnml2lts-mc(+0xb61f0) [0x555ab6b2a1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f2d76ad74d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f2d76ad767a]
10: pnml2lts-mc(+0xa1581) [0x555ab6b15581]
11: pnml2lts-mc(+0xa1910) [0x555ab6b15910]
12: pnml2lts-mc(+0xa32a2) [0x555ab6b172a2]
13: pnml2lts-mc(+0xa50f4) [0x555ab6b190f4]
14: pnml2lts-mc(+0xa516b) [0x555ab6b1916b]
15: pnml2lts-mc(+0x3f34b3) [0x555ab6e674b3]
16: pnml2lts-mc(+0x7c63d) [0x555ab6af063d]
17: pnml2lts-mc(+0x67d86) [0x555ab6adbd86]
18: pnml2lts-mc(+0x60a8a) [0x555ab6ad4a8a]
19: pnml2lts-mc(+0x5eb15) [0x555ab6ad2b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f2d76abfd0a]
21: pnml2lts-mc(+0x6075e) [0x555ab6ad475e]

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPs-PT-005B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ShieldIIPs-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 r393-oct2-167903716600076"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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