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-167903716800236.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 ShieldIIPt-PT-004B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903716800236
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 9.1K Feb 25 17:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 25 17:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 25 17:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 17:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 17:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Feb 25 17:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 17:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 17:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:56 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 67K 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 ShieldIIPt-PT-004B-LTLFireability-00
FORMULA_NAME ShieldIIPt-PT-004B-LTLFireability-01
FORMULA_NAME ShieldIIPt-PT-004B-LTLFireability-02
FORMULA_NAME ShieldIIPt-PT-004B-LTLFireability-03
FORMULA_NAME ShieldIIPt-PT-004B-LTLFireability-04
FORMULA_NAME ShieldIIPt-PT-004B-LTLFireability-05
FORMULA_NAME ShieldIIPt-PT-004B-LTLFireability-06
FORMULA_NAME ShieldIIPt-PT-004B-LTLFireability-07
FORMULA_NAME ShieldIIPt-PT-004B-LTLFireability-08
FORMULA_NAME ShieldIIPt-PT-004B-LTLFireability-09
FORMULA_NAME ShieldIIPt-PT-004B-LTLFireability-10
FORMULA_NAME ShieldIIPt-PT-004B-LTLFireability-11
FORMULA_NAME ShieldIIPt-PT-004B-LTLFireability-12
FORMULA_NAME ShieldIIPt-PT-004B-LTLFireability-13
FORMULA_NAME ShieldIIPt-PT-004B-LTLFireability-14
FORMULA_NAME ShieldIIPt-PT-004B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679434753492

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=ShieldIIPt-PT-004B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 21:39:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 21:39:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 21:39:16] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2023-03-21 21:39:16] [INFO ] Transformed 283 places.
[2023-03-21 21:39:16] [INFO ] Transformed 263 transitions.
[2023-03-21 21:39:16] [INFO ] Found NUPN structural information;
[2023-03-21 21:39:16] [INFO ] Parsed PT model containing 283 places and 263 transitions and 654 arcs in 232 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ShieldIIPt-PT-004B-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 263/263 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 249 transition count 229
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 249 transition count 229
Applied a total of 68 rules in 55 ms. Remains 249 /283 variables (removed 34) and now considering 229/263 (removed 34) transitions.
// Phase 1: matrix 229 rows 249 cols
[2023-03-21 21:39:16] [INFO ] Computed 37 place invariants in 8 ms
[2023-03-21 21:39:17] [INFO ] Implicit Places using invariants in 476 ms returned []
[2023-03-21 21:39:17] [INFO ] Invariant cache hit.
[2023-03-21 21:39:17] [INFO ] Implicit Places using invariants and state equation in 535 ms returned []
Implicit Place search using SMT with State Equation took 1042 ms to find 0 implicit places.
[2023-03-21 21:39:17] [INFO ] Invariant cache hit.
[2023-03-21 21:39:17] [INFO ] Dead Transitions using invariants and state equation in 275 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 249/283 places, 229/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1379 ms. Remains : 249/283 places, 229/263 transitions.
Support contains 38 out of 249 places after structural reductions.
[2023-03-21 21:39:18] [INFO ] Flatten gal took : 42 ms
[2023-03-21 21:39:18] [INFO ] Flatten gal took : 16 ms
[2023-03-21 21:39:18] [INFO ] Input system was already deterministic with 229 transitions.
Support contains 37 out of 249 places (down from 38) after GAL structural reductions.
Finished random walk after 3938 steps, including 1 resets, run visited all 34 properties in 123 ms. (steps per millisecond=32 )
Computed a total of 65 stabilizing places and 65 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' '!(F(G(p0)))'
Support contains 2 out of 249 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 249/249 places, 229/229 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 248 transition count 178
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 100 place count 198 transition count 178
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 100 place count 198 transition count 150
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 156 place count 170 transition count 150
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 162 place count 164 transition count 144
Iterating global reduction 2 with 6 rules applied. Total rules applied 168 place count 164 transition count 144
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 168 place count 164 transition count 140
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 176 place count 160 transition count 140
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 134 rules applied. Total rules applied 310 place count 93 transition count 73
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 311 place count 93 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 313 place count 92 transition count 71
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 335 place count 81 transition count 78
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 337 place count 79 transition count 76
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 339 place count 77 transition count 76
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 339 place count 77 transition count 75
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 341 place count 76 transition count 75
Applied a total of 341 rules in 90 ms. Remains 76 /249 variables (removed 173) and now considering 75/229 (removed 154) transitions.
// Phase 1: matrix 75 rows 76 cols
[2023-03-21 21:39:19] [INFO ] Computed 35 place invariants in 1 ms
[2023-03-21 21:39:19] [INFO ] Implicit Places using invariants in 65 ms returned [64]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 73 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 75/249 places, 75/229 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 74 transition count 74
Applied a total of 2 rules in 4 ms. Remains 74 /75 variables (removed 1) and now considering 74/75 (removed 1) transitions.
// Phase 1: matrix 74 rows 74 cols
[2023-03-21 21:39:19] [INFO ] Computed 34 place invariants in 0 ms
[2023-03-21 21:39:19] [INFO ] Implicit Places using invariants in 218 ms returned []
[2023-03-21 21:39:19] [INFO ] Invariant cache hit.
[2023-03-21 21:39:19] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 74/249 places, 74/229 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 512 ms. Remains : 74/249 places, 74/229 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-004B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s60 0) (EQ s72 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 324 ms.
Stack based approach found an accepted trace after 31 steps with 0 reset with depth 32 and stack size 32 in 1 ms.
FORMULA ShieldIIPt-PT-004B-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-004B-LTLFireability-00 finished in 1065 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&&F(p1)&&G(p2))))'
Support contains 3 out of 249 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 249/249 places, 229/229 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 239 transition count 219
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 239 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 238 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 238 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 237 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 237 transition count 217
Applied a total of 24 rules in 31 ms. Remains 237 /249 variables (removed 12) and now considering 217/229 (removed 12) transitions.
// Phase 1: matrix 217 rows 237 cols
[2023-03-21 21:39:19] [INFO ] Computed 37 place invariants in 2 ms
[2023-03-21 21:39:20] [INFO ] Implicit Places using invariants in 144 ms returned []
[2023-03-21 21:39:20] [INFO ] Invariant cache hit.
[2023-03-21 21:39:20] [INFO ] Implicit Places using invariants and state equation in 634 ms returned []
Implicit Place search using SMT with State Equation took 784 ms to find 0 implicit places.
[2023-03-21 21:39:20] [INFO ] Invariant cache hit.
[2023-03-21 21:39:21] [INFO ] Dead Transitions using invariants and state equation in 242 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 237/249 places, 217/229 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1086 ms. Remains : 237/249 places, 217/229 transitions.
Stuttering acceptance computed with spot in 267 ms :[(NOT p2), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1) (NOT p0)), true]
Running random walk in product with property : ShieldIIPt-PT-004B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 4}], [{ cond=(AND p0 p1 p2), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=(OR (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p2:(EQ s103 1), p1:(EQ s102 1), p0:(EQ s151 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-004B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-004B-LTLFireability-01 finished in 1393 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) U ((X(p1) U p0) U p1))))'
Support contains 3 out of 249 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 249/249 places, 229/229 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 239 transition count 219
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 239 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 238 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 238 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 237 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 237 transition count 217
Applied a total of 24 rules in 35 ms. Remains 237 /249 variables (removed 12) and now considering 217/229 (removed 12) transitions.
[2023-03-21 21:39:21] [INFO ] Invariant cache hit.
[2023-03-21 21:39:21] [INFO ] Implicit Places using invariants in 122 ms returned []
[2023-03-21 21:39:21] [INFO ] Invariant cache hit.
[2023-03-21 21:39:21] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
[2023-03-21 21:39:21] [INFO ] Invariant cache hit.
[2023-03-21 21:39:21] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 237/249 places, 217/229 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 465 ms. Remains : 237/249 places, 217/229 transitions.
Stuttering acceptance computed with spot in 266 ms :[true, p1, (AND p0 p1), (AND p0 p1), p1, p1]
Running random walk in product with property : ShieldIIPt-PT-004B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=p1, acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}]], initial=1, aps=[p0:(EQ s185 1), p1:(AND (EQ s21 1) (EQ s38 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]]
Product exploration explored 100000 steps with 33333 reset in 311 ms.
Product exploration explored 100000 steps with 33333 reset in 253 ms.
Computed a total of 62 stabilizing places and 62 stable transitions
Computed a total of 62 stabilizing places and 62 stable transitions
Detected a total of 62/237 stabilizing places and 62/217 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p0) p1))))
Knowledge based reduction with 11 factoid took 379 ms. Reduced automaton from 6 states, 13 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-004B-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-004B-LTLFireability-02 finished in 1727 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 249 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 249/249 places, 229/229 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 239 transition count 219
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 239 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 238 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 238 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 237 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 237 transition count 217
Applied a total of 24 rules in 10 ms. Remains 237 /249 variables (removed 12) and now considering 217/229 (removed 12) transitions.
[2023-03-21 21:39:23] [INFO ] Invariant cache hit.
[2023-03-21 21:39:23] [INFO ] Implicit Places using invariants in 191 ms returned []
[2023-03-21 21:39:23] [INFO ] Invariant cache hit.
[2023-03-21 21:39:23] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
[2023-03-21 21:39:23] [INFO ] Invariant cache hit.
[2023-03-21 21:39:23] [INFO ] Dead Transitions using invariants and state equation in 241 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 237/249 places, 217/229 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 604 ms. Remains : 237/249 places, 217/229 transitions.
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-004B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s102 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-004B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-004B-LTLFireability-03 finished in 732 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p1))&&X(G(p2))))'
Support contains 3 out of 249 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 249/249 places, 229/229 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 241 transition count 221
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 241 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 240 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 240 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 239 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 239 transition count 219
Applied a total of 20 rules in 40 ms. Remains 239 /249 variables (removed 10) and now considering 219/229 (removed 10) transitions.
// Phase 1: matrix 219 rows 239 cols
[2023-03-21 21:39:23] [INFO ] Computed 37 place invariants in 2 ms
[2023-03-21 21:39:24] [INFO ] Implicit Places using invariants in 239 ms returned []
[2023-03-21 21:39:24] [INFO ] Invariant cache hit.
[2023-03-21 21:39:24] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
[2023-03-21 21:39:24] [INFO ] Invariant cache hit.
[2023-03-21 21:39:24] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 239/249 places, 219/229 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 650 ms. Remains : 239/249 places, 219/229 transitions.
Stuttering acceptance computed with spot in 300 ms :[true, (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-004B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p1 p2), acceptance={} source=4 dest: 3}]], initial=1, aps=[p0:(EQ s156 1), p2:(EQ s42 1), p1:(EQ s186 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-004B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-004B-LTLFireability-04 finished in 981 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(!p0)))||G(!p2)||(!p2&&F(G(p3)))))'
Support contains 4 out of 249 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 249/249 places, 229/229 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 248 transition count 179
Reduce places removed 49 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 51 rules applied. Total rules applied 100 place count 199 transition count 177
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 102 place count 197 transition count 177
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 102 place count 197 transition count 149
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 158 place count 169 transition count 149
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 164 place count 163 transition count 143
Iterating global reduction 3 with 6 rules applied. Total rules applied 170 place count 163 transition count 143
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 170 place count 163 transition count 140
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 176 place count 160 transition count 140
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 310 place count 93 transition count 73
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 311 place count 93 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 313 place count 92 transition count 71
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 333 place count 82 transition count 77
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 335 place count 80 transition count 75
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 337 place count 78 transition count 75
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 337 place count 78 transition count 74
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 339 place count 77 transition count 74
Applied a total of 339 rules in 93 ms. Remains 77 /249 variables (removed 172) and now considering 74/229 (removed 155) transitions.
// Phase 1: matrix 74 rows 77 cols
[2023-03-21 21:39:24] [INFO ] Computed 35 place invariants in 0 ms
[2023-03-21 21:39:25] [INFO ] Implicit Places using invariants in 500 ms returned [64]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 504 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 76/249 places, 74/229 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 75 transition count 73
Applied a total of 2 rules in 7 ms. Remains 75 /76 variables (removed 1) and now considering 73/74 (removed 1) transitions.
// Phase 1: matrix 73 rows 75 cols
[2023-03-21 21:39:25] [INFO ] Computed 34 place invariants in 2 ms
[2023-03-21 21:39:25] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-21 21:39:25] [INFO ] Invariant cache hit.
[2023-03-21 21:39:25] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-21 21:39:25] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 75/249 places, 73/229 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1058 ms. Remains : 75/249 places, 73/229 transitions.
Stuttering acceptance computed with spot in 488 ms :[(AND p0 (NOT p1) p2), true, (AND (NOT p1) p0), (AND p2 (NOT p1) p0 (NOT p3)), (AND p2 (NOT p3)), (NOT p3), (AND (NOT p3) (NOT p1) p0)]
Running random walk in product with property : ShieldIIPt-PT-004B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=3 dest: 4}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=3 dest: 5}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 6}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}, { cond=p2, acceptance={} source=4 dest: 5}], [{ cond=p3, acceptance={} source=5 dest: 5}, { cond=(NOT p3), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(AND (EQ s46 1) (EQ s48 1)), p1:(AND (EQ s3 1) (NOT (AND (EQ s46 1) (EQ s48 1) (EQ s72 1)))), p0:(AND (EQ s46 1) (EQ s48 1) (EQ s72 1)), p3:(EQ s72 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 18934 steps with 1940 reset in 56 ms.
FORMULA ShieldIIPt-PT-004B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-004B-LTLFireability-05 finished in 1661 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 249 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 249/249 places, 229/229 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 248 transition count 178
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 100 place count 198 transition count 178
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 100 place count 198 transition count 151
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 154 place count 171 transition count 151
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 160 place count 165 transition count 145
Iterating global reduction 2 with 6 rules applied. Total rules applied 166 place count 165 transition count 145
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 166 place count 165 transition count 142
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 172 place count 162 transition count 142
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 312 place count 92 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 313 place count 92 transition count 71
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 315 place count 91 transition count 70
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 333 place count 82 transition count 75
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 335 place count 80 transition count 73
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 337 place count 78 transition count 73
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 337 place count 78 transition count 72
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 339 place count 77 transition count 72
Applied a total of 339 rules in 48 ms. Remains 77 /249 variables (removed 172) and now considering 72/229 (removed 157) transitions.
// Phase 1: matrix 72 rows 77 cols
[2023-03-21 21:39:26] [INFO ] Computed 35 place invariants in 1 ms
[2023-03-21 21:39:26] [INFO ] Implicit Places using invariants in 168 ms returned [66]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 182 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 76/249 places, 72/229 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 75 transition count 71
Applied a total of 2 rules in 3 ms. Remains 75 /76 variables (removed 1) and now considering 71/72 (removed 1) transitions.
// Phase 1: matrix 71 rows 75 cols
[2023-03-21 21:39:26] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-21 21:39:26] [INFO ] Implicit Places using invariants in 305 ms returned []
[2023-03-21 21:39:26] [INFO ] Invariant cache hit.
[2023-03-21 21:39:27] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 428 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 75/249 places, 71/229 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 662 ms. Remains : 75/249 places, 71/229 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-004B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s60 1) (EQ s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-004B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-004B-LTLFireability-06 finished in 747 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(!p0)||(!p0&&G(p1)))) U (G(!p0)||((!p0 U (G(!p0)||(!p0&&G(p1))))&&(G((p2||F(p3)))||(F(p2)&&(p2||F(p3))))))))'
Support contains 4 out of 249 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 249/249 places, 229/229 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 248 transition count 179
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 98 place count 199 transition count 179
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 98 place count 199 transition count 151
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 154 place count 171 transition count 151
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 160 place count 165 transition count 145
Iterating global reduction 2 with 6 rules applied. Total rules applied 166 place count 165 transition count 145
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 166 place count 165 transition count 141
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 174 place count 161 transition count 141
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 304 place count 96 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 305 place count 96 transition count 75
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 307 place count 95 transition count 74
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 327 place count 85 transition count 80
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 329 place count 83 transition count 78
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 330 place count 82 transition count 78
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 330 place count 82 transition count 77
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 332 place count 81 transition count 77
Applied a total of 332 rules in 24 ms. Remains 81 /249 variables (removed 168) and now considering 77/229 (removed 152) transitions.
// Phase 1: matrix 77 rows 81 cols
[2023-03-21 21:39:27] [INFO ] Computed 36 place invariants in 0 ms
[2023-03-21 21:39:27] [INFO ] Implicit Places using invariants in 137 ms returned [69]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 160 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 80/249 places, 77/229 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 79 transition count 76
Applied a total of 2 rules in 3 ms. Remains 79 /80 variables (removed 1) and now considering 76/77 (removed 1) transitions.
// Phase 1: matrix 76 rows 79 cols
[2023-03-21 21:39:27] [INFO ] Computed 35 place invariants in 1 ms
[2023-03-21 21:39:27] [INFO ] Implicit Places using invariants in 140 ms returned []
[2023-03-21 21:39:27] [INFO ] Invariant cache hit.
[2023-03-21 21:39:27] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-21 21:39:27] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 79/249 places, 76/229 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 541 ms. Remains : 79/249 places, 76/229 transitions.
Stuttering acceptance computed with spot in 799 ms :[p0, true, (AND p0 (NOT p3)), (AND p0 (NOT p2) (NOT p3)), p0, (AND p0 (NOT p1)), (NOT p3), (AND p0 (NOT p3)), (AND (NOT p3) p0 (NOT p1)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p3) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-004B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p3)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p0) p2 (NOT p3) (NOT p1)), acceptance={} source=2 dest: 7}, { cond=(AND (NOT p0) p2 (NOT p3) p1), acceptance={} source=2 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={} source=3 dest: 9}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 10}], [{ cond=p0, acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 5}, { cond=(AND p0 p1), acceptance={} source=5 dest: 11}], [{ cond=(NOT p3), acceptance={0} source=6 dest: 6}], [{ cond=(AND p0 (NOT p3)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p0) (NOT p3) p1), acceptance={} source=7 dest: 8}], [{ cond=(AND p0 (NOT p3) (NOT p1)), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p0) (NOT p3) p1), acceptance={} source=8 dest: 8}, { cond=(AND p0 (NOT p3) p1), acceptance={} source=8 dest: 12}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=9 dest: 9}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=10 dest: 9}, { cond=(NOT p2), acceptance={} source=10 dest: 10}], [{ cond=(NOT p1), acceptance={} source=11 dest: 1}, { cond=p1, acceptance={} source=11 dest: 11}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=12 dest: 6}, { cond=(AND (NOT p3) p1), acceptance={} source=12 dest: 12}]], initial=0, aps=[p0:(OR (EQ s31 1) (EQ s14 1)), p2:(NEQ s31 1), p3:(NEQ s59 1), p1:(NEQ s65 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 2 reset in 264 ms.
Product exploration explored 100000 steps with 1 reset in 464 ms.
Computed a total of 5 stabilizing places and 4 stable transitions
Computed a total of 5 stabilizing places and 4 stable transitions
Detected a total of 5/79 stabilizing places and 4/76 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 p3 p1), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p2 (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p3)))), (X (NOT (AND p0 (NOT p2) (NOT p3)))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3) p1)))), (X (X (NOT (AND p0 p1)))), true, (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X p2)), (X (X (NOT (AND p0 (NOT p3) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3) p1)))), (X (X (NOT p0))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p2 (NOT p3) p1)), (X (NOT (AND (NOT p0) p2 (NOT p3) p1))), (X (X (NOT p3))), (X (X p3)), (X (X (AND (NOT p0) p2 (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3) (NOT p1))))), (X (X (AND (NOT p0) (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 27 factoid took 2309 ms. Reduced automaton from 13 states, 35 edges and 4 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 336 ms :[true, (AND p0 (NOT p1)), p0, (NOT p1), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-21 21:39:32] [INFO ] Invariant cache hit.
[2023-03-21 21:39:32] [INFO ] [Real]Absence check using 35 positive place invariants in 13 ms returned sat
[2023-03-21 21:39:32] [INFO ] After 175ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 21:39:32] [INFO ] [Nat]Absence check using 35 positive place invariants in 51 ms returned sat
[2023-03-21 21:39:32] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 21:39:32] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-21 21:39:32] [INFO ] After 25ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 21:39:32] [INFO ] After 48ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-21 21:39:32] [INFO ] After 193ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 76/76 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 79 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 78 transition count 74
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 78 transition count 73
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 77 transition count 73
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 6 place count 76 transition count 72
Applied a total of 6 rules in 6 ms. Remains 76 /79 variables (removed 3) and now considering 72/76 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 76/79 places, 72/76 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Finished Best-First random walk after 3447 steps, including 1 resets, run visited all 1 properties in 5 ms. (steps per millisecond=689 )
Knowledge obtained : [(AND (NOT p0) p2 p3 p1), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p2 (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p3)))), (X (NOT (AND p0 (NOT p2) (NOT p3)))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3) p1)))), (X (X (NOT (AND p0 p1)))), true, (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X p2)), (X (X (NOT (AND p0 (NOT p3) p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3) p1)))), (X (X (NOT p0))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p2 (NOT p3) p1)), (X (NOT (AND (NOT p0) p2 (NOT p3) p1))), (X (X (NOT p3))), (X (X p3)), (X (X (AND (NOT p0) p2 (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3) (NOT p1))))), (X (X (AND (NOT p0) (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND p0 (NOT p1))), (F (NOT p1)), (F (AND p0 p1)), (F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 27 factoid took 2048 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[true, (AND p0 (NOT p1)), p0, (NOT p1), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 233 ms :[true, (AND p0 (NOT p1)), p0, (NOT p1), (AND p0 (NOT p1))]
Support contains 3 out of 79 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 76/76 transitions.
Applied a total of 0 rules in 14 ms. Remains 79 /79 variables (removed 0) and now considering 76/76 (removed 0) transitions.
[2023-03-21 21:39:35] [INFO ] Invariant cache hit.
[2023-03-21 21:39:35] [INFO ] Implicit Places using invariants in 142 ms returned []
[2023-03-21 21:39:35] [INFO ] Invariant cache hit.
[2023-03-21 21:39:35] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-21 21:39:35] [INFO ] Implicit Places using invariants and state equation in 560 ms returned []
Implicit Place search using SMT with State Equation took 718 ms to find 0 implicit places.
[2023-03-21 21:39:35] [INFO ] Invariant cache hit.
[2023-03-21 21:39:35] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 806 ms. Remains : 79/79 places, 76/76 transitions.
Computed a total of 5 stabilizing places and 4 stable transitions
Computed a total of 5 stabilizing places and 4 stable transitions
Detected a total of 5/79 stabilizing places and 4/76 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 8 factoid took 835 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 353 ms :[true, (AND p0 (NOT p1)), p0, (NOT p1), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-21 21:39:37] [INFO ] Invariant cache hit.
[2023-03-21 21:39:37] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-21 21:39:37] [INFO ] After 155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 21:39:37] [INFO ] [Nat]Absence check using 35 positive place invariants in 41 ms returned sat
[2023-03-21 21:39:37] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 21:39:37] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-21 21:39:37] [INFO ] After 11ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 21:39:37] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-21 21:39:37] [INFO ] After 156ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 76/76 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 79 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 78 transition count 74
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 78 transition count 73
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 77 transition count 73
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 6 place count 76 transition count 72
Applied a total of 6 rules in 6 ms. Remains 76 /79 variables (removed 3) and now considering 72/76 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 76/79 places, 72/76 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1312428 steps, run timeout after 3001 ms. (steps per millisecond=437 ) properties seen :{}
Probabilistic random walk after 1312428 steps, saw 822944 distinct states, run finished after 3004 ms. (steps per millisecond=436 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 72 rows 76 cols
[2023-03-21 21:39:40] [INFO ] Computed 35 place invariants in 3 ms
[2023-03-21 21:39:40] [INFO ] [Real]Absence check using 35 positive place invariants in 30 ms returned sat
[2023-03-21 21:39:40] [INFO ] After 144ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 21:39:40] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-21 21:39:40] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 21:39:40] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-21 21:39:40] [INFO ] After 5ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 21:39:40] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-21 21:39:40] [INFO ] After 87ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 72/72 transitions.
Applied a total of 0 rules in 1 ms. Remains 76 /76 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 76/76 places, 72/72 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 72/72 transitions.
Applied a total of 0 rules in 1 ms. Remains 76 /76 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2023-03-21 21:39:40] [INFO ] Invariant cache hit.
[2023-03-21 21:39:40] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-21 21:39:40] [INFO ] Invariant cache hit.
[2023-03-21 21:39:40] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-21 21:39:41] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2023-03-21 21:39:41] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-21 21:39:41] [INFO ] Invariant cache hit.
[2023-03-21 21:39:41] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 432 ms. Remains : 76/76 places, 72/72 transitions.
Graph (complete) has 179 edges and 76 vertex of which 75 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 11 place count 75 transition count 72
Applied a total of 11 rules in 3 ms. Remains 75 /76 variables (removed 1) and now considering 72/72 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 72 rows 75 cols
[2023-03-21 21:39:41] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-21 21:39:41] [INFO ] [Real]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-21 21:39:41] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 21:39:41] [INFO ] [Nat]Absence check using 34 positive place invariants in 5 ms returned sat
[2023-03-21 21:39:41] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 21:39:41] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-21 21:39:41] [INFO ] After 4ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 21:39:41] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-21 21:39:41] [INFO ] After 109ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT p1)), (F (AND p0 p1)), (F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 8 factoid took 928 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[true, (AND p0 (NOT p1)), p0, (NOT p1), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 315 ms :[true, (AND p0 (NOT p1)), p0, (NOT p1), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 280 ms :[true, (AND p0 (NOT p1)), p0, (NOT p1), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 255 ms.
Product exploration explored 100000 steps with 1 reset in 397 ms.
Applying partial POR strategy [true, false, true, true, true]
Stuttering acceptance computed with spot in 319 ms :[true, (AND p0 (NOT p1)), p0, (NOT p1), (AND p0 (NOT p1))]
Support contains 3 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 76/76 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 79 transition count 76
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 23 ms. Remains 79 /79 variables (removed 0) and now considering 76/76 (removed 0) transitions.
[2023-03-21 21:39:44] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 76 rows 79 cols
[2023-03-21 21:39:44] [INFO ] Computed 35 place invariants in 0 ms
[2023-03-21 21:39:44] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 79/79 places, 76/76 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 163 ms. Remains : 79/79 places, 76/76 transitions.
Support contains 3 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 76/76 transitions.
Applied a total of 0 rules in 14 ms. Remains 79 /79 variables (removed 0) and now considering 76/76 (removed 0) transitions.
// Phase 1: matrix 76 rows 79 cols
[2023-03-21 21:39:44] [INFO ] Computed 35 place invariants in 1 ms
[2023-03-21 21:39:44] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-21 21:39:44] [INFO ] Invariant cache hit.
[2023-03-21 21:39:44] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-21 21:39:44] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
[2023-03-21 21:39:44] [INFO ] Invariant cache hit.
[2023-03-21 21:39:44] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 400 ms. Remains : 79/79 places, 76/76 transitions.
Treatment of property ShieldIIPt-PT-004B-LTLFireability-07 finished in 17769 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&&X(G(p1))) U p2) U p3))'
Support contains 4 out of 249 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 249/249 places, 229/229 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 241 transition count 221
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 241 transition count 221
Applied a total of 16 rules in 22 ms. Remains 241 /249 variables (removed 8) and now considering 221/229 (removed 8) transitions.
// Phase 1: matrix 221 rows 241 cols
[2023-03-21 21:39:44] [INFO ] Computed 37 place invariants in 1 ms
[2023-03-21 21:39:45] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-21 21:39:45] [INFO ] Invariant cache hit.
[2023-03-21 21:39:45] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
[2023-03-21 21:39:45] [INFO ] Invariant cache hit.
[2023-03-21 21:39:45] [INFO ] Dead Transitions using invariants and state equation in 262 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 241/249 places, 221/229 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 573 ms. Remains : 241/249 places, 221/229 transitions.
Stuttering acceptance computed with spot in 189 ms :[(NOT p3), true, (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldIIPt-PT-004B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p3) p2) (AND (NOT p3) p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p3:(EQ s9 1), p2:(NEQ s117 1), p0:(NEQ s209 1), p1:(EQ s44 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3331 reset in 202 ms.
Product exploration explored 100000 steps with 3347 reset in 198 ms.
Computed a total of 64 stabilizing places and 64 stable transitions
Computed a total of 64 stabilizing places and 64 stable transitions
Detected a total of 64/241 stabilizing places and 64/221 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p3) p2 p0 (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (OR (AND (NOT p3) p2) (AND (NOT p3) p0))), (X (NOT p1)), (X (NOT (AND (NOT p3) (NOT p2) p0))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), true, (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (OR (AND (NOT p3) p2) (AND (NOT p3) p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 795 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter sensitive) to 4 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 248 ms :[(NOT p3), true, (NOT p1), (NOT p2)]
Finished random walk after 3075 steps, including 0 resets, run visited all 6 properties in 63 ms. (steps per millisecond=48 )
Knowledge obtained : [(AND (NOT p3) p2 p0 (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (OR (AND (NOT p3) p2) (AND (NOT p3) p0))), (X (NOT p1)), (X (NOT (AND (NOT p3) (NOT p2) p0))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), true, (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (OR (AND (NOT p3) p2) (AND (NOT p3) p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p3) (NOT p2) p0)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F p1), (F (AND p0 (NOT p2))), (F (NOT (OR (AND p0 (NOT p3)) (AND (NOT p3) p2)))), (F (AND p0 (NOT p3) (NOT p2))), (F (AND (NOT p0) (NOT p3) (NOT p2)))]
Knowledge based reduction with 15 factoid took 960 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter sensitive) to 4 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[(NOT p3), true, (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 205 ms :[(NOT p3), true, (NOT p1), (NOT p2)]
[2023-03-21 21:39:48] [INFO ] Invariant cache hit.
[2023-03-21 21:39:48] [INFO ] [Real]Absence check using 37 positive place invariants in 50 ms returned sat
[2023-03-21 21:39:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 21:39:49] [INFO ] [Real]Absence check using state equation in 193 ms returned sat
[2023-03-21 21:39:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 21:39:49] [INFO ] [Nat]Absence check using 37 positive place invariants in 11 ms returned sat
[2023-03-21 21:39:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 21:39:49] [INFO ] [Nat]Absence check using state equation in 203 ms returned sat
[2023-03-21 21:39:49] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2023-03-21 21:39:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2023-03-21 21:39:49] [INFO ] Computed and/alt/rep : 220/331/220 causal constraints (skipped 0 transitions) in 18 ms.
[2023-03-21 21:39:50] [INFO ] Added : 196 causal constraints over 40 iterations in 1077 ms. Result :sat
Could not prove EG (NOT p3)
Support contains 4 out of 241 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 241/241 places, 221/221 transitions.
Applied a total of 0 rules in 4 ms. Remains 241 /241 variables (removed 0) and now considering 221/221 (removed 0) transitions.
[2023-03-21 21:39:50] [INFO ] Invariant cache hit.
[2023-03-21 21:39:50] [INFO ] Implicit Places using invariants in 144 ms returned []
[2023-03-21 21:39:50] [INFO ] Invariant cache hit.
[2023-03-21 21:39:51] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
[2023-03-21 21:39:51] [INFO ] Invariant cache hit.
[2023-03-21 21:39:51] [INFO ] Dead Transitions using invariants and state equation in 217 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 719 ms. Remains : 241/241 places, 221/221 transitions.
Computed a total of 64 stabilizing places and 64 stable transitions
Computed a total of 64 stabilizing places and 64 stable transitions
Detected a total of 64/241 stabilizing places and 64/221 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p3) p2 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p1)), (X (OR (AND p0 (NOT p3)) (AND (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND p0 (NOT p3) (NOT p2)))), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p1))), (X (X (OR (AND p0 (NOT p3)) (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 902 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter sensitive) to 4 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p3), true, (NOT p1), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 6) seen :4
Finished Best-First random walk after 1809 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=452 )
Knowledge obtained : [(AND p0 (NOT p3) p2 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p1)), (X (OR (AND p0 (NOT p3)) (AND (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND p0 (NOT p3) (NOT p2)))), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p1))), (X (X (OR (AND p0 (NOT p3)) (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F p1), (F (AND p0 (NOT p2))), (F (NOT (OR (AND p0 (NOT p3)) (AND (NOT p3) p2)))), (F (AND p0 (NOT p3) (NOT p2))), (F (AND (NOT p0) (NOT p3) (NOT p2)))]
Knowledge based reduction with 15 factoid took 1243 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter sensitive) to 4 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 265 ms :[(NOT p3), true, (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 286 ms :[(NOT p3), true, (NOT p1), (NOT p2)]
[2023-03-21 21:39:54] [INFO ] Invariant cache hit.
[2023-03-21 21:39:54] [INFO ] [Real]Absence check using 37 positive place invariants in 25 ms returned sat
[2023-03-21 21:39:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 21:39:54] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2023-03-21 21:39:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 21:39:54] [INFO ] [Nat]Absence check using 37 positive place invariants in 12 ms returned sat
[2023-03-21 21:39:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 21:39:55] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2023-03-21 21:39:55] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2023-03-21 21:39:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2023-03-21 21:39:55] [INFO ] Computed and/alt/rep : 220/331/220 causal constraints (skipped 0 transitions) in 23 ms.
[2023-03-21 21:39:56] [INFO ] Added : 196 causal constraints over 40 iterations in 1273 ms. Result :sat
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 208 ms :[(NOT p3), true, (NOT p1), (NOT p2)]
Product exploration explored 100000 steps with 3292 reset in 187 ms.
Stack based approach found an accepted trace after 60520 steps with 2007 reset with depth 36 and stack size 36 in 114 ms.
FORMULA ShieldIIPt-PT-004B-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-004B-LTLFireability-09 finished in 11977 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(p1)))))'
Support contains 2 out of 249 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 249/249 places, 229/229 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 240 transition count 220
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 240 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 239 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 239 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 238 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 238 transition count 218
Applied a total of 22 rules in 18 ms. Remains 238 /249 variables (removed 11) and now considering 218/229 (removed 11) transitions.
// Phase 1: matrix 218 rows 238 cols
[2023-03-21 21:39:56] [INFO ] Computed 37 place invariants in 2 ms
[2023-03-21 21:39:57] [INFO ] Implicit Places using invariants in 118 ms returned []
[2023-03-21 21:39:57] [INFO ] Invariant cache hit.
[2023-03-21 21:39:57] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
[2023-03-21 21:39:57] [INFO ] Invariant cache hit.
[2023-03-21 21:39:57] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 238/249 places, 218/229 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 506 ms. Remains : 238/249 places, 218/229 transitions.
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-004B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s157 0), p1:(EQ s120 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 149 ms.
Product exploration explored 100000 steps with 50000 reset in 157 ms.
Computed a total of 62 stabilizing places and 62 stable transitions
Computed a total of 62 stabilizing places and 62 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-004B-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-004B-LTLFireability-10 finished in 1070 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))'
Support contains 1 out of 249 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 249/249 places, 229/229 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 248 transition count 178
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 100 place count 198 transition count 178
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 100 place count 198 transition count 151
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 154 place count 171 transition count 151
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 160 place count 165 transition count 145
Iterating global reduction 2 with 6 rules applied. Total rules applied 166 place count 165 transition count 145
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 166 place count 165 transition count 141
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 174 place count 161 transition count 141
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 314 place count 91 transition count 71
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 315 place count 91 transition count 70
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 317 place count 90 transition count 69
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 337 place count 80 transition count 75
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 339 place count 78 transition count 73
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 341 place count 76 transition count 73
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 341 place count 76 transition count 72
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 343 place count 75 transition count 72
Applied a total of 343 rules in 43 ms. Remains 75 /249 variables (removed 174) and now considering 72/229 (removed 157) transitions.
// Phase 1: matrix 72 rows 75 cols
[2023-03-21 21:39:58] [INFO ] Computed 35 place invariants in 0 ms
[2023-03-21 21:39:58] [INFO ] Implicit Places using invariants in 411 ms returned [62]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 413 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 74/249 places, 72/229 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 73 transition count 71
Applied a total of 2 rules in 10 ms. Remains 73 /74 variables (removed 1) and now considering 71/72 (removed 1) transitions.
// Phase 1: matrix 71 rows 73 cols
[2023-03-21 21:39:58] [INFO ] Computed 34 place invariants in 0 ms
[2023-03-21 21:39:58] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-21 21:39:58] [INFO ] Invariant cache hit.
[2023-03-21 21:39:58] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 73/249 places, 71/229 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 662 ms. Remains : 73/249 places, 71/229 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-004B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s72 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 27122 reset in 125 ms.
Product exploration explored 100000 steps with 27090 reset in 153 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 : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 204 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 157 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
[2023-03-21 21:39:59] [INFO ] Invariant cache hit.
[2023-03-21 21:39:59] [INFO ] [Real]Absence check using 34 positive place invariants in 6 ms returned sat
[2023-03-21 21:39:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 21:39:59] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2023-03-21 21:39:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 21:39:59] [INFO ] [Nat]Absence check using 34 positive place invariants in 5 ms returned sat
[2023-03-21 21:39:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 21:39:59] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2023-03-21 21:39:59] [INFO ] Computed and/alt/rep : 69/102/69 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-21 21:39:59] [INFO ] Added : 53 causal constraints over 11 iterations in 80 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 71/71 transitions.
Applied a total of 0 rules in 4 ms. Remains 73 /73 variables (removed 0) and now considering 71/71 (removed 0) transitions.
[2023-03-21 21:39:59] [INFO ] Invariant cache hit.
[2023-03-21 21:39:59] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-21 21:39:59] [INFO ] Invariant cache hit.
[2023-03-21 21:40:00] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
[2023-03-21 21:40:00] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-21 21:40:00] [INFO ] Invariant cache hit.
[2023-03-21 21:40:00] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 436 ms. Remains : 73/73 places, 71/71 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 : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 143 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 225 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
[2023-03-21 21:40:00] [INFO ] Invariant cache hit.
[2023-03-21 21:40:00] [INFO ] [Real]Absence check using 34 positive place invariants in 5 ms returned sat
[2023-03-21 21:40:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-21 21:40:00] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2023-03-21 21:40:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-21 21:40:00] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2023-03-21 21:40:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-21 21:40:00] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2023-03-21 21:40:01] [INFO ] Computed and/alt/rep : 69/102/69 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-21 21:40:01] [INFO ] Added : 53 causal constraints over 11 iterations in 153 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration explored 100000 steps with 27146 reset in 116 ms.
Product exploration explored 100000 steps with 27071 reset in 134 ms.
Support contains 1 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 71/71 transitions.
Applied a total of 0 rules in 2 ms. Remains 73 /73 variables (removed 0) and now considering 71/71 (removed 0) transitions.
[2023-03-21 21:40:01] [INFO ] Invariant cache hit.
[2023-03-21 21:40:01] [INFO ] Implicit Places using invariants in 104 ms returned []
[2023-03-21 21:40:01] [INFO ] Invariant cache hit.
[2023-03-21 21:40:01] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
[2023-03-21 21:40:01] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-21 21:40:01] [INFO ] Invariant cache hit.
[2023-03-21 21:40:01] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 421 ms. Remains : 73/73 places, 71/71 transitions.
Treatment of property ShieldIIPt-PT-004B-LTLFireability-11 finished in 3923 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((G(p0)||(p0&&G(F(!p1)))))))'
Support contains 3 out of 249 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 249/249 places, 229/229 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 248 transition count 180
Reduce places removed 48 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 49 rules applied. Total rules applied 97 place count 200 transition count 179
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 98 place count 199 transition count 179
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 98 place count 199 transition count 150
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 156 place count 170 transition count 150
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 161 place count 165 transition count 145
Iterating global reduction 3 with 5 rules applied. Total rules applied 166 place count 165 transition count 145
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 166 place count 165 transition count 142
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 172 place count 162 transition count 142
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 304 place count 96 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 305 place count 96 transition count 75
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 307 place count 95 transition count 74
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 329 place count 84 transition count 81
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 331 place count 82 transition count 79
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 333 place count 80 transition count 79
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 333 place count 80 transition count 78
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 335 place count 79 transition count 78
Applied a total of 335 rules in 13 ms. Remains 79 /249 variables (removed 170) and now considering 78/229 (removed 151) transitions.
// Phase 1: matrix 78 rows 79 cols
[2023-03-21 21:40:01] [INFO ] Computed 35 place invariants in 1 ms
[2023-03-21 21:40:02] [INFO ] Implicit Places using invariants in 90 ms returned [66]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 93 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 78/249 places, 78/229 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 77 transition count 77
Applied a total of 2 rules in 3 ms. Remains 77 /78 variables (removed 1) and now considering 77/78 (removed 1) transitions.
// Phase 1: matrix 77 rows 77 cols
[2023-03-21 21:40:02] [INFO ] Computed 34 place invariants in 0 ms
[2023-03-21 21:40:02] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-21 21:40:02] [INFO ] Invariant cache hit.
[2023-03-21 21:40:02] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-21 21:40:02] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 77/249 places, 77/229 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 261 ms. Remains : 77/249 places, 77/229 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (AND p1 (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-004B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s39 1) (EQ s74 1)), p0:(NEQ s54 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 2 reset in 206 ms.
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-004B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-004B-LTLFireability-12 finished in 614 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((F(p1)&&F(p2)))&&p0)))'
Support contains 4 out of 249 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 249/249 places, 229/229 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 241 transition count 221
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 241 transition count 221
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 240 transition count 220
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 240 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 239 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 239 transition count 219
Applied a total of 20 rules in 7 ms. Remains 239 /249 variables (removed 10) and now considering 219/229 (removed 10) transitions.
// Phase 1: matrix 219 rows 239 cols
[2023-03-21 21:40:02] [INFO ] Computed 37 place invariants in 1 ms
[2023-03-21 21:40:02] [INFO ] Implicit Places using invariants in 125 ms returned []
[2023-03-21 21:40:02] [INFO ] Invariant cache hit.
[2023-03-21 21:40:03] [INFO ] Implicit Places using invariants and state equation in 557 ms returned []
Implicit Place search using SMT with State Equation took 695 ms to find 0 implicit places.
[2023-03-21 21:40:03] [INFO ] Invariant cache hit.
[2023-03-21 21:40:03] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 239/249 places, 219/229 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 921 ms. Remains : 239/249 places, 219/229 transitions.
Stuttering acceptance computed with spot in 311 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-004B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=p0, acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}, { cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s196 1) (EQ s212 1)), p1:(EQ s228 1), p2:(EQ s155 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-004B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-004B-LTLFireability-13 finished in 1273 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 249 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 249/249 places, 229/229 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 248 transition count 179
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 98 place count 199 transition count 179
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 98 place count 199 transition count 152
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 152 place count 172 transition count 152
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 157 place count 167 transition count 147
Iterating global reduction 2 with 5 rules applied. Total rules applied 162 place count 167 transition count 147
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 162 place count 167 transition count 144
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 168 place count 164 transition count 144
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 308 place count 94 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 309 place count 94 transition count 73
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 311 place count 93 transition count 72
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 331 place count 83 transition count 77
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 332 place count 83 transition count 77
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 334 place count 81 transition count 75
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 336 place count 79 transition count 75
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 336 place count 79 transition count 74
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 338 place count 78 transition count 74
Applied a total of 338 rules in 31 ms. Remains 78 /249 variables (removed 171) and now considering 74/229 (removed 155) transitions.
// Phase 1: matrix 74 rows 78 cols
[2023-03-21 21:40:03] [INFO ] Computed 35 place invariants in 3 ms
[2023-03-21 21:40:03] [INFO ] Implicit Places using invariants in 109 ms returned [67]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 110 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 77/249 places, 74/229 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 76 transition count 73
Applied a total of 2 rules in 1 ms. Remains 76 /77 variables (removed 1) and now considering 73/74 (removed 1) transitions.
// Phase 1: matrix 73 rows 76 cols
[2023-03-21 21:40:03] [INFO ] Computed 34 place invariants in 0 ms
[2023-03-21 21:40:04] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-21 21:40:04] [INFO ] Invariant cache hit.
[2023-03-21 21:40:04] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 76/249 places, 73/229 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 434 ms. Remains : 76/249 places, 73/229 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-004B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s13 1), p1:(AND (EQ s56 1) (EQ s41 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-004B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-004B-LTLFireability-14 finished in 565 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||G(F(p1))))))'
Support contains 2 out of 249 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 249/249 places, 229/229 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 240 transition count 220
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 240 transition count 220
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 239 transition count 219
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 239 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 238 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 238 transition count 218
Applied a total of 22 rules in 7 ms. Remains 238 /249 variables (removed 11) and now considering 218/229 (removed 11) transitions.
// Phase 1: matrix 218 rows 238 cols
[2023-03-21 21:40:04] [INFO ] Computed 37 place invariants in 1 ms
[2023-03-21 21:40:04] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-21 21:40:04] [INFO ] Invariant cache hit.
[2023-03-21 21:40:04] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
[2023-03-21 21:40:04] [INFO ] Invariant cache hit.
[2023-03-21 21:40:04] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 238/249 places, 218/229 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 552 ms. Remains : 238/249 places, 218/229 transitions.
Stuttering acceptance computed with spot in 270 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-004B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s100 1), p1:(EQ s236 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1221 reset in 188 ms.
Product exploration explored 100000 steps with 1229 reset in 200 ms.
Computed a total of 62 stabilizing places and 62 stable transitions
Computed a total of 62 stabilizing places and 62 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 175 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1)]
Finished random walk after 22 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 177 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 75 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p1), (NOT p1)]
Support contains 1 out of 238 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 238/238 places, 218/218 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 237 transition count 171
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 92 place count 191 transition count 171
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 92 place count 191 transition count 140
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 154 place count 160 transition count 140
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 136 rules applied. Total rules applied 290 place count 92 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 291 place count 92 transition count 71
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 293 place count 91 transition count 70
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 313 place count 81 transition count 76
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 315 place count 79 transition count 74
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 317 place count 77 transition count 74
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 317 place count 77 transition count 73
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 319 place count 76 transition count 73
Applied a total of 319 rules in 15 ms. Remains 76 /238 variables (removed 162) and now considering 73/218 (removed 145) transitions.
// Phase 1: matrix 73 rows 76 cols
[2023-03-21 21:40:06] [INFO ] Computed 35 place invariants in 0 ms
[2023-03-21 21:40:06] [INFO ] Implicit Places using invariants in 95 ms returned [63]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 96 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 75/238 places, 73/218 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 74 transition count 72
Applied a total of 2 rules in 9 ms. Remains 74 /75 variables (removed 1) and now considering 72/73 (removed 1) transitions.
// Phase 1: matrix 72 rows 74 cols
[2023-03-21 21:40:06] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-21 21:40:06] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-21 21:40:06] [INFO ] Invariant cache hit.
[2023-03-21 21:40:06] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 74/238 places, 72/218 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 329 ms. Remains : 74/238 places, 72/218 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 : [p1, (X p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 173 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 78 ms :[(NOT p1), (NOT p1)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [p1, (X p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 148 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 80 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 9811 reset in 181 ms.
Product exploration explored 100000 steps with 9703 reset in 201 ms.
Support contains 1 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 72/72 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 73 transition count 71
Applied a total of 2 rules in 2 ms. Remains 73 /74 variables (removed 1) and now considering 71/72 (removed 1) transitions.
// Phase 1: matrix 71 rows 73 cols
[2023-03-21 21:40:07] [INFO ] Computed 34 place invariants in 0 ms
[2023-03-21 21:40:07] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-21 21:40:07] [INFO ] Invariant cache hit.
[2023-03-21 21:40:07] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2023-03-21 21:40:07] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-21 21:40:07] [INFO ] Invariant cache hit.
[2023-03-21 21:40:07] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 73/74 places, 71/72 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 313 ms. Remains : 73/74 places, 71/72 transitions.
Treatment of property ShieldIIPt-PT-004B-LTLFireability-15 finished in 3544 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(!p0)||(!p0&&G(p1)))) U (G(!p0)||((!p0 U (G(!p0)||(!p0&&G(p1))))&&(G((p2||F(p3)))||(F(p2)&&(p2||F(p3))))))))'
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))'
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||G(F(p1))))))'
[2023-03-21 21:40:08] [INFO ] Flatten gal took : 51 ms
[2023-03-21 21:40:08] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2023-03-21 21:40:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 249 places, 229 transitions and 586 arcs took 7 ms.
Total runtime 52289 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2133/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2133/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2133/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldIIPt-PT-004B-LTLFireability-07
Could not compute solution for formula : ShieldIIPt-PT-004B-LTLFireability-11
Could not compute solution for formula : ShieldIIPt-PT-004B-LTLFireability-15

BK_STOP 1679434809343

--------------------
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:
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ 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 ShieldIIPt-PT-004B-LTLFireability-07
ltl formula formula --ltl=/tmp/2133/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
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 249 places, 229 transitions and 586 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.020 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2133/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2133/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2133/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2133/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 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 ShieldIIPt-PT-004B-LTLFireability-11
ltl formula formula --ltl=/tmp/2133/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: =============================================================================
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
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 249 places, 229 transitions and 586 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.020 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2133/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2133/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2133/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2133/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 1 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) [0x56314b1753f4]
1: pnml2lts-mc(+0xa2496) [0x56314b175496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7fce988cc140]
3: pnml2lts-mc(+0x405be5) [0x56314b4d8be5]
4: pnml2lts-mc(+0x16b3f9) [0x56314b23e3f9]
5: pnml2lts-mc(+0x164ac4) [0x56314b237ac4]
6: pnml2lts-mc(+0x272e0a) [0x56314b345e0a]
7: pnml2lts-mc(+0xb61f0) [0x56314b1891f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7fce9871f4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7fce9871f67a]
10: pnml2lts-mc(+0xa1581) [0x56314b174581]
11: pnml2lts-mc(+0xa1910) [0x56314b174910]
12: pnml2lts-mc(+0xa32a2) [0x56314b1762a2]
13: pnml2lts-mc(+0xa50f4) [0x56314b1780f4]
14: pnml2lts-mc(+0x3f34b3) [0x56314b4c64b3]
15: pnml2lts-mc(+0x7c63d) [0x56314b14f63d]
16: pnml2lts-mc(+0x67d86) [0x56314b13ad86]
17: pnml2lts-mc(+0x60a8a) [0x56314b133a8a]
18: pnml2lts-mc(+0x5eb15) [0x56314b131b15]
19: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7fce98707d0a]
20: pnml2lts-mc(+0x6075e) [0x56314b13375e]
ltl formula name ShieldIIPt-PT-004B-LTLFireability-15
ltl formula formula --ltl=/tmp/2133/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: =============================================================================
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
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 249 places, 229 transitions and 586 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.010 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2133/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2133/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2133/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2133/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 5 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:

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-PT-004B"
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 ShieldIIPt-PT-004B, 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-167903716800236"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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