Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 804K
-rw-r--r-- 1 mcc users 8.4K Feb 25 23:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 25 23:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 23:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 23:08 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.4K Feb 25 17:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 23:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 23:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 23:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 25 23:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:04 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 364K 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 ShieldRVt-PT-030B-LTLCardinality-00
FORMULA_NAME ShieldRVt-PT-030B-LTLCardinality-01
FORMULA_NAME ShieldRVt-PT-030B-LTLCardinality-02
FORMULA_NAME ShieldRVt-PT-030B-LTLCardinality-03
FORMULA_NAME ShieldRVt-PT-030B-LTLCardinality-04
FORMULA_NAME ShieldRVt-PT-030B-LTLCardinality-05
FORMULA_NAME ShieldRVt-PT-030B-LTLCardinality-06
FORMULA_NAME ShieldRVt-PT-030B-LTLCardinality-07
FORMULA_NAME ShieldRVt-PT-030B-LTLCardinality-08
FORMULA_NAME ShieldRVt-PT-030B-LTLCardinality-09
FORMULA_NAME ShieldRVt-PT-030B-LTLCardinality-10
FORMULA_NAME ShieldRVt-PT-030B-LTLCardinality-11
FORMULA_NAME ShieldRVt-PT-030B-LTLCardinality-12
FORMULA_NAME ShieldRVt-PT-030B-LTLCardinality-13
FORMULA_NAME ShieldRVt-PT-030B-LTLCardinality-14
FORMULA_NAME ShieldRVt-PT-030B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679309536044

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-030B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 10:52:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 10:52:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 10:52:17] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2023-03-20 10:52:17] [INFO ] Transformed 1503 places.
[2023-03-20 10:52:17] [INFO ] Transformed 1503 transitions.
[2023-03-20 10:52:17] [INFO ] Found NUPN structural information;
[2023-03-20 10:52:17] [INFO ] Parsed PT model containing 1503 places and 1503 transitions and 3546 arcs in 181 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldRVt-PT-030B-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030B-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030B-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030B-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030B-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030B-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030B-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030B-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030B-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 1503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1503/1503 places, 1503/1503 transitions.
Discarding 321 places :
Symmetric choice reduction at 0 with 321 rule applications. Total rules 321 place count 1182 transition count 1182
Iterating global reduction 0 with 321 rules applied. Total rules applied 642 place count 1182 transition count 1182
Applied a total of 642 rules in 259 ms. Remains 1182 /1503 variables (removed 321) and now considering 1182/1503 (removed 321) transitions.
// Phase 1: matrix 1182 rows 1182 cols
[2023-03-20 10:52:18] [INFO ] Computed 121 place invariants in 30 ms
[2023-03-20 10:52:18] [INFO ] Implicit Places using invariants in 437 ms returned []
[2023-03-20 10:52:18] [INFO ] Invariant cache hit.
[2023-03-20 10:52:19] [INFO ] Implicit Places using invariants and state equation in 885 ms returned []
Implicit Place search using SMT with State Equation took 1349 ms to find 0 implicit places.
[2023-03-20 10:52:19] [INFO ] Invariant cache hit.
[2023-03-20 10:52:20] [INFO ] Dead Transitions using invariants and state equation in 632 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1182/1503 places, 1182/1503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2241 ms. Remains : 1182/1503 places, 1182/1503 transitions.
Support contains 23 out of 1182 places after structural reductions.
[2023-03-20 10:52:20] [INFO ] Flatten gal took : 107 ms
[2023-03-20 10:52:20] [INFO ] Flatten gal took : 50 ms
[2023-03-20 10:52:20] [INFO ] Input system was already deterministic with 1182 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 462 ms. (steps per millisecond=21 ) properties (out of 15) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-20 10:52:21] [INFO ] Invariant cache hit.
[2023-03-20 10:52:21] [INFO ] After 249ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-20 10:52:21] [INFO ] [Nat]Absence check using 121 positive place invariants in 40 ms returned sat
[2023-03-20 10:52:22] [INFO ] After 689ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-20 10:52:22] [INFO ] Deduced a trap composed of 20 places in 195 ms of which 5 ms to minimize.
[2023-03-20 10:52:23] [INFO ] Deduced a trap composed of 21 places in 199 ms of which 1 ms to minimize.
[2023-03-20 10:52:23] [INFO ] Deduced a trap composed of 32 places in 228 ms of which 1 ms to minimize.
[2023-03-20 10:52:23] [INFO ] Deduced a trap composed of 24 places in 224 ms of which 2 ms to minimize.
[2023-03-20 10:52:23] [INFO ] Deduced a trap composed of 29 places in 154 ms of which 1 ms to minimize.
[2023-03-20 10:52:24] [INFO ] Deduced a trap composed of 29 places in 155 ms of which 1 ms to minimize.
[2023-03-20 10:52:24] [INFO ] Deduced a trap composed of 39 places in 183 ms of which 2 ms to minimize.
[2023-03-20 10:52:24] [INFO ] Deduced a trap composed of 40 places in 188 ms of which 2 ms to minimize.
[2023-03-20 10:52:24] [INFO ] Deduced a trap composed of 21 places in 155 ms of which 1 ms to minimize.
[2023-03-20 10:52:24] [INFO ] Deduced a trap composed of 44 places in 138 ms of which 1 ms to minimize.
[2023-03-20 10:52:25] [INFO ] Deduced a trap composed of 28 places in 127 ms of which 0 ms to minimize.
[2023-03-20 10:52:25] [INFO ] Deduced a trap composed of 53 places in 223 ms of which 1 ms to minimize.
[2023-03-20 10:52:25] [INFO ] Deduced a trap composed of 46 places in 141 ms of which 1 ms to minimize.
[2023-03-20 10:52:25] [INFO ] Deduced a trap composed of 45 places in 104 ms of which 1 ms to minimize.
[2023-03-20 10:52:25] [INFO ] Deduced a trap composed of 39 places in 128 ms of which 0 ms to minimize.
[2023-03-20 10:52:25] [INFO ] Deduced a trap composed of 53 places in 120 ms of which 1 ms to minimize.
[2023-03-20 10:52:26] [INFO ] Deduced a trap composed of 45 places in 131 ms of which 1 ms to minimize.
[2023-03-20 10:52:26] [INFO ] Deduced a trap composed of 46 places in 161 ms of which 1 ms to minimize.
[2023-03-20 10:52:26] [INFO ] Deduced a trap composed of 47 places in 130 ms of which 0 ms to minimize.
[2023-03-20 10:52:26] [INFO ] Deduced a trap composed of 39 places in 132 ms of which 0 ms to minimize.
[2023-03-20 10:52:26] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 4080 ms
[2023-03-20 10:52:27] [INFO ] After 5171ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 333 ms.
[2023-03-20 10:52:27] [INFO ] After 5915ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 301 ms.
Support contains 10 out of 1182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1182/1182 places, 1182/1182 transitions.
Drop transitions removed 327 transitions
Trivial Post-agglo rules discarded 327 transitions
Performed 327 trivial Post agglomeration. Transition count delta: 327
Iterating post reduction 0 with 327 rules applied. Total rules applied 327 place count 1182 transition count 855
Reduce places removed 327 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 329 rules applied. Total rules applied 656 place count 855 transition count 853
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 658 place count 854 transition count 852
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 659 place count 853 transition count 852
Performed 232 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 232 Pre rules applied. Total rules applied 659 place count 853 transition count 620
Deduced a syphon composed of 232 places in 2 ms
Reduce places removed 232 places and 0 transitions.
Iterating global reduction 4 with 464 rules applied. Total rules applied 1123 place count 621 transition count 620
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1127 place count 617 transition count 616
Iterating global reduction 4 with 4 rules applied. Total rules applied 1131 place count 617 transition count 616
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 1131 place count 617 transition count 613
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1137 place count 614 transition count 613
Performed 272 Post agglomeration using F-continuation condition.Transition count delta: 272
Deduced a syphon composed of 272 places in 0 ms
Reduce places removed 272 places and 0 transitions.
Iterating global reduction 4 with 544 rules applied. Total rules applied 1681 place count 342 transition count 341
Renaming transitions due to excessive name length > 1024 char.
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: -81
Deduced a syphon composed of 87 places in 0 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 4 with 174 rules applied. Total rules applied 1855 place count 255 transition count 422
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1856 place count 255 transition count 421
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1857 place count 255 transition count 420
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1858 place count 254 transition count 420
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 1859 place count 254 transition count 419
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1860 place count 253 transition count 418
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1861 place count 252 transition count 418
Applied a total of 1861 rules in 211 ms. Remains 252 /1182 variables (removed 930) and now considering 418/1182 (removed 764) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 211 ms. Remains : 252/1182 places, 418/1182 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 418 rows 252 cols
[2023-03-20 10:52:28] [INFO ] Computed 120 place invariants in 1 ms
[2023-03-20 10:52:28] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 10:52:28] [INFO ] [Nat]Absence check using 120 positive place invariants in 15 ms returned sat
[2023-03-20 10:52:28] [INFO ] After 128ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 10:52:28] [INFO ] After 183ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-20 10:52:28] [INFO ] After 294ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 64 ms.
Support contains 6 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 418/418 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 1 rules applied. Total rules applied 1 place count 252 transition count 417
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 251 transition count 417
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 2 with 2 rules applied. Total rules applied 4 place count 250 transition count 416
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -2
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 10 place count 247 transition count 418
Applied a total of 10 rules in 26 ms. Remains 247 /252 variables (removed 5) and now considering 418/418 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 247/252 places, 418/418 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Finished probabilistic random walk after 154602 steps, run visited all 3 properties in 2041 ms. (steps per millisecond=75 )
Probabilistic random walk after 154602 steps, saw 107193 distinct states, run finished after 2041 ms. (steps per millisecond=75 ) properties seen :3
Computed a total of 362 stabilizing places and 362 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p0) U p1))))'
Support contains 3 out of 1182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1182/1182 places, 1182/1182 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1174 transition count 1174
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1174 transition count 1174
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1173 transition count 1173
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1173 transition count 1173
Applied a total of 18 rules in 174 ms. Remains 1173 /1182 variables (removed 9) and now considering 1173/1182 (removed 9) transitions.
// Phase 1: matrix 1173 rows 1173 cols
[2023-03-20 10:52:31] [INFO ] Computed 121 place invariants in 28 ms
[2023-03-20 10:52:31] [INFO ] Implicit Places using invariants in 367 ms returned []
[2023-03-20 10:52:31] [INFO ] Invariant cache hit.
[2023-03-20 10:52:32] [INFO ] Implicit Places using invariants and state equation in 931 ms returned []
Implicit Place search using SMT with State Equation took 1305 ms to find 0 implicit places.
[2023-03-20 10:52:32] [INFO ] Invariant cache hit.
[2023-03-20 10:52:33] [INFO ] Dead Transitions using invariants and state equation in 490 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1173/1182 places, 1173/1182 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1980 ms. Remains : 1173/1182 places, 1173/1182 transitions.
Stuttering acceptance computed with spot in 260 ms :[(NOT p1), (NOT p1), true, (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-030B-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s723 1), p0:(OR (EQ s272 0) (EQ s583 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 544 ms.
Product exploration explored 100000 steps with 3 reset in 681 ms.
Computed a total of 358 stabilizing places and 358 stable transitions
Computed a total of 358 stabilizing places and 358 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), (X (AND (NOT p1) p0)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (OR p1 p0))), (X (X (AND (NOT p1) p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 461 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), true, (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-20 10:52:35] [INFO ] Invariant cache hit.
[2023-03-20 10:52:35] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 10:52:36] [INFO ] [Nat]Absence check using 121 positive place invariants in 29 ms returned sat
[2023-03-20 10:52:36] [INFO ] After 461ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 10:52:36] [INFO ] Deduced a trap composed of 26 places in 209 ms of which 1 ms to minimize.
[2023-03-20 10:52:37] [INFO ] Deduced a trap composed of 46 places in 165 ms of which 2 ms to minimize.
[2023-03-20 10:52:37] [INFO ] Deduced a trap composed of 39 places in 172 ms of which 1 ms to minimize.
[2023-03-20 10:52:37] [INFO ] Deduced a trap composed of 30 places in 185 ms of which 1 ms to minimize.
[2023-03-20 10:52:37] [INFO ] Deduced a trap composed of 38 places in 143 ms of which 1 ms to minimize.
[2023-03-20 10:52:37] [INFO ] Deduced a trap composed of 34 places in 142 ms of which 0 ms to minimize.
[2023-03-20 10:52:38] [INFO ] Deduced a trap composed of 34 places in 145 ms of which 1 ms to minimize.
[2023-03-20 10:52:38] [INFO ] Deduced a trap composed of 27 places in 198 ms of which 1 ms to minimize.
[2023-03-20 10:52:38] [INFO ] Deduced a trap composed of 34 places in 180 ms of which 0 ms to minimize.
[2023-03-20 10:52:38] [INFO ] Deduced a trap composed of 25 places in 147 ms of which 0 ms to minimize.
[2023-03-20 10:52:38] [INFO ] Deduced a trap composed of 44 places in 142 ms of which 1 ms to minimize.
[2023-03-20 10:52:39] [INFO ] Deduced a trap composed of 42 places in 138 ms of which 2 ms to minimize.
[2023-03-20 10:52:39] [INFO ] Deduced a trap composed of 36 places in 122 ms of which 1 ms to minimize.
[2023-03-20 10:52:39] [INFO ] Deduced a trap composed of 45 places in 120 ms of which 0 ms to minimize.
[2023-03-20 10:52:39] [INFO ] Deduced a trap composed of 38 places in 119 ms of which 1 ms to minimize.
[2023-03-20 10:52:39] [INFO ] Deduced a trap composed of 40 places in 116 ms of which 1 ms to minimize.
[2023-03-20 10:52:39] [INFO ] Deduced a trap composed of 39 places in 111 ms of which 0 ms to minimize.
[2023-03-20 10:52:39] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 3200 ms
[2023-03-20 10:52:40] [INFO ] Deduced a trap composed of 43 places in 148 ms of which 2 ms to minimize.
[2023-03-20 10:52:40] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 0 ms to minimize.
[2023-03-20 10:52:40] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 2 ms to minimize.
[2023-03-20 10:52:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 538 ms
[2023-03-20 10:52:40] [INFO ] After 4312ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 107 ms.
[2023-03-20 10:52:40] [INFO ] After 4666ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 86 ms.
Support contains 3 out of 1173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1173/1173 places, 1173/1173 transitions.
Drop transitions removed 326 transitions
Trivial Post-agglo rules discarded 326 transitions
Performed 326 trivial Post agglomeration. Transition count delta: 326
Iterating post reduction 0 with 326 rules applied. Total rules applied 326 place count 1173 transition count 847
Reduce places removed 326 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 327 rules applied. Total rules applied 653 place count 847 transition count 846
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 654 place count 846 transition count 846
Performed 239 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 239 Pre rules applied. Total rules applied 654 place count 846 transition count 607
Deduced a syphon composed of 239 places in 1 ms
Reduce places removed 239 places and 0 transitions.
Iterating global reduction 3 with 478 rules applied. Total rules applied 1132 place count 607 transition count 607
Performed 271 Post agglomeration using F-continuation condition.Transition count delta: 271
Deduced a syphon composed of 271 places in 0 ms
Reduce places removed 271 places and 0 transitions.
Iterating global reduction 3 with 542 rules applied. Total rules applied 1674 place count 336 transition count 336
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1675 place count 336 transition count 335
Renaming transitions due to excessive name length > 1024 char.
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 1677 place count 335 transition count 334
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -86
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 4 with 178 rules applied. Total rules applied 1855 place count 246 transition count 420
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1856 place count 246 transition count 419
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1857 place count 245 transition count 418
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1858 place count 244 transition count 418
Applied a total of 1858 rules in 83 ms. Remains 244 /1173 variables (removed 929) and now considering 418/1173 (removed 755) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 244/1173 places, 418/1173 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 255803 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :{}
Probabilistic random walk after 255803 steps, saw 168213 distinct states, run finished after 3002 ms. (steps per millisecond=85 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 418 rows 244 cols
[2023-03-20 10:52:44] [INFO ] Computed 120 place invariants in 1 ms
[2023-03-20 10:52:44] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 10:52:44] [INFO ] [Nat]Absence check using 120 positive place invariants in 12 ms returned sat
[2023-03-20 10:52:44] [INFO ] After 103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 10:52:44] [INFO ] After 145ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-20 10:52:44] [INFO ] After 252ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 584 steps, including 32 resets, run visited all 3 properties in 6 ms. (steps per millisecond=97 )
Parikh walk visited 3 properties in 41 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), (X (AND (NOT p1) p0)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (OR p1 p0))), (X (X (AND (NOT p1) p0)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 9 factoid took 332 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), true, (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), true, (NOT p0), (NOT p1)]
// Phase 1: matrix 1173 rows 1173 cols
[2023-03-20 10:52:45] [INFO ] Computed 121 place invariants in 7 ms
[2023-03-20 10:52:45] [INFO ] [Real]Absence check using 121 positive place invariants in 62 ms returned sat
[2023-03-20 10:52:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 10:52:47] [INFO ] [Real]Absence check using state equation in 1954 ms returned sat
[2023-03-20 10:52:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 10:52:48] [INFO ] [Nat]Absence check using 121 positive place invariants in 83 ms returned sat
[2023-03-20 10:52:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 10:52:50] [INFO ] [Nat]Absence check using state equation in 2220 ms returned sat
[2023-03-20 10:52:50] [INFO ] Computed and/alt/rep : 1172/1713/1172 causal constraints (skipped 0 transitions) in 109 ms.
[2023-03-20 10:53:03] [INFO ] Deduced a trap composed of 16 places in 482 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 10:53:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Support contains 3 out of 1173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1173/1173 places, 1173/1173 transitions.
Applied a total of 0 rules in 67 ms. Remains 1173 /1173 variables (removed 0) and now considering 1173/1173 (removed 0) transitions.
[2023-03-20 10:53:03] [INFO ] Invariant cache hit.
[2023-03-20 10:53:03] [INFO ] Implicit Places using invariants in 342 ms returned []
[2023-03-20 10:53:03] [INFO ] Invariant cache hit.
[2023-03-20 10:53:04] [INFO ] Implicit Places using invariants and state equation in 823 ms returned []
Implicit Place search using SMT with State Equation took 1169 ms to find 0 implicit places.
[2023-03-20 10:53:04] [INFO ] Invariant cache hit.
[2023-03-20 10:53:04] [INFO ] Dead Transitions using invariants and state equation in 565 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1803 ms. Remains : 1173/1173 places, 1173/1173 transitions.
Computed a total of 358 stabilizing places and 358 stable transitions
Computed a total of 358 stabilizing places and 358 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (OR p0 p1)), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (AND p0 (NOT p1)))), (X (X (OR p0 p1))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 314 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), true, (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 218580 steps, run timeout after 3032 ms. (steps per millisecond=72 ) properties seen :{}
Probabilistic random walk after 218580 steps, saw 98727 distinct states, run finished after 3032 ms. (steps per millisecond=72 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-20 10:53:08] [INFO ] Invariant cache hit.
[2023-03-20 10:53:08] [INFO ] After 197ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 10:53:09] [INFO ] [Nat]Absence check using 121 positive place invariants in 34 ms returned sat
[2023-03-20 10:53:09] [INFO ] After 511ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 10:53:10] [INFO ] Deduced a trap composed of 28 places in 265 ms of which 1 ms to minimize.
[2023-03-20 10:53:10] [INFO ] Deduced a trap composed of 40 places in 227 ms of which 0 ms to minimize.
[2023-03-20 10:53:10] [INFO ] Deduced a trap composed of 26 places in 200 ms of which 0 ms to minimize.
[2023-03-20 10:53:10] [INFO ] Deduced a trap composed of 20 places in 196 ms of which 1 ms to minimize.
[2023-03-20 10:53:10] [INFO ] Deduced a trap composed of 39 places in 190 ms of which 1 ms to minimize.
[2023-03-20 10:53:11] [INFO ] Deduced a trap composed of 36 places in 196 ms of which 2 ms to minimize.
[2023-03-20 10:53:11] [INFO ] Deduced a trap composed of 39 places in 186 ms of which 1 ms to minimize.
[2023-03-20 10:53:11] [INFO ] Deduced a trap composed of 35 places in 183 ms of which 0 ms to minimize.
[2023-03-20 10:53:11] [INFO ] Deduced a trap composed of 25 places in 167 ms of which 1 ms to minimize.
[2023-03-20 10:53:12] [INFO ] Deduced a trap composed of 45 places in 171 ms of which 0 ms to minimize.
[2023-03-20 10:53:12] [INFO ] Deduced a trap composed of 34 places in 181 ms of which 1 ms to minimize.
[2023-03-20 10:53:12] [INFO ] Deduced a trap composed of 40 places in 172 ms of which 1 ms to minimize.
[2023-03-20 10:53:12] [INFO ] Deduced a trap composed of 50 places in 145 ms of which 1 ms to minimize.
[2023-03-20 10:53:12] [INFO ] Deduced a trap composed of 49 places in 157 ms of which 0 ms to minimize.
[2023-03-20 10:53:13] [INFO ] Deduced a trap composed of 38 places in 194 ms of which 1 ms to minimize.
[2023-03-20 10:53:13] [INFO ] Deduced a trap composed of 24 places in 202 ms of which 1 ms to minimize.
[2023-03-20 10:53:13] [INFO ] Deduced a trap composed of 23 places in 221 ms of which 0 ms to minimize.
[2023-03-20 10:53:13] [INFO ] Deduced a trap composed of 41 places in 158 ms of which 0 ms to minimize.
[2023-03-20 10:53:13] [INFO ] Deduced a trap composed of 38 places in 148 ms of which 1 ms to minimize.
[2023-03-20 10:53:14] [INFO ] Deduced a trap composed of 42 places in 150 ms of which 2 ms to minimize.
[2023-03-20 10:53:14] [INFO ] Deduced a trap composed of 57 places in 195 ms of which 0 ms to minimize.
[2023-03-20 10:53:14] [INFO ] Deduced a trap composed of 41 places in 140 ms of which 2 ms to minimize.
[2023-03-20 10:53:14] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 4905 ms
[2023-03-20 10:53:15] [INFO ] Deduced a trap composed of 48 places in 173 ms of which 10 ms to minimize.
[2023-03-20 10:53:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 279 ms
[2023-03-20 10:53:15] [INFO ] After 5978ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 179 ms.
[2023-03-20 10:53:15] [INFO ] After 6475ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 118 ms.
Support contains 3 out of 1173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1173/1173 places, 1173/1173 transitions.
Drop transitions removed 326 transitions
Trivial Post-agglo rules discarded 326 transitions
Performed 326 trivial Post agglomeration. Transition count delta: 326
Iterating post reduction 0 with 326 rules applied. Total rules applied 326 place count 1173 transition count 847
Reduce places removed 326 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 327 rules applied. Total rules applied 653 place count 847 transition count 846
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 654 place count 846 transition count 846
Performed 239 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 239 Pre rules applied. Total rules applied 654 place count 846 transition count 607
Deduced a syphon composed of 239 places in 1 ms
Reduce places removed 239 places and 0 transitions.
Iterating global reduction 3 with 478 rules applied. Total rules applied 1132 place count 607 transition count 607
Performed 271 Post agglomeration using F-continuation condition.Transition count delta: 271
Deduced a syphon composed of 271 places in 0 ms
Reduce places removed 271 places and 0 transitions.
Iterating global reduction 3 with 542 rules applied. Total rules applied 1674 place count 336 transition count 336
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1675 place count 336 transition count 335
Renaming transitions due to excessive name length > 1024 char.
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 1677 place count 335 transition count 334
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -86
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 4 with 178 rules applied. Total rules applied 1855 place count 246 transition count 420
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1856 place count 246 transition count 419
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1857 place count 245 transition count 418
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1858 place count 244 transition count 418
Applied a total of 1858 rules in 95 ms. Remains 244 /1173 variables (removed 929) and now considering 418/1173 (removed 755) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 244/1173 places, 418/1173 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 418 rows 244 cols
[2023-03-20 10:53:15] [INFO ] Computed 120 place invariants in 1 ms
[2023-03-20 10:53:15] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 10:53:16] [INFO ] [Nat]Absence check using 120 positive place invariants in 12 ms returned sat
[2023-03-20 10:53:16] [INFO ] After 105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 10:53:16] [INFO ] After 148ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-20 10:53:16] [INFO ] After 271ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 1311 steps, including 69 resets, run visited all 3 properties in 15 ms. (steps per millisecond=87 )
Parikh walk visited 3 properties in 22 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (OR p0 p1)), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (AND p0 (NOT p1)))), (X (X (OR p0 p1))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 10 factoid took 502 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), true, (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), true, (NOT p0), (NOT p1)]
// Phase 1: matrix 1173 rows 1173 cols
[2023-03-20 10:53:17] [INFO ] Computed 121 place invariants in 4 ms
[2023-03-20 10:53:17] [INFO ] [Real]Absence check using 121 positive place invariants in 69 ms returned sat
[2023-03-20 10:53:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 10:53:19] [INFO ] [Real]Absence check using state equation in 2257 ms returned sat
[2023-03-20 10:53:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 10:53:20] [INFO ] [Nat]Absence check using 121 positive place invariants in 83 ms returned sat
[2023-03-20 10:53:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 10:53:22] [INFO ] [Nat]Absence check using state equation in 2419 ms returned sat
[2023-03-20 10:53:23] [INFO ] Computed and/alt/rep : 1172/1713/1172 causal constraints (skipped 0 transitions) in 86 ms.
[2023-03-20 10:53:35] [INFO ] Deduced a trap composed of 16 places in 463 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 10:53:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), true, (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 363 ms.
Product exploration explored 100000 steps with 1 reset in 500 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), true, (NOT p0), (NOT p1)]
Support contains 3 out of 1173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1173/1173 places, 1173/1173 transitions.
Performed 327 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 327 rules applied. Total rules applied 327 place count 1173 transition count 1173
Performed 121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 121 Pre rules applied. Total rules applied 327 place count 1173 transition count 1294
Deduced a syphon composed of 448 places in 2 ms
Iterating global reduction 1 with 121 rules applied. Total rules applied 448 place count 1173 transition count 1294
Performed 360 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 808 places in 1 ms
Iterating global reduction 1 with 360 rules applied. Total rules applied 808 place count 1173 transition count 1294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 809 place count 1173 transition count 1293
Renaming transitions due to excessive name length > 1024 char.
Discarding 238 places :
Symmetric choice reduction at 2 with 238 rule applications. Total rules 1047 place count 935 transition count 1055
Deduced a syphon composed of 570 places in 1 ms
Iterating global reduction 2 with 238 rules applied. Total rules applied 1285 place count 935 transition count 1055
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 571 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1286 place count 935 transition count 1055
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1288 place count 933 transition count 1053
Deduced a syphon composed of 569 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1290 place count 933 transition count 1053
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -722
Deduced a syphon composed of 670 places in 1 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1391 place count 933 transition count 1775
Discarding 103 places :
Symmetric choice reduction at 2 with 103 rule applications. Total rules 1494 place count 830 transition count 1569
Deduced a syphon composed of 567 places in 1 ms
Iterating global reduction 2 with 103 rules applied. Total rules applied 1597 place count 830 transition count 1569
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -123
Deduced a syphon composed of 584 places in 1 ms
Iterating global reduction 2 with 17 rules applied. Total rules applied 1614 place count 830 transition count 1692
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1631 place count 813 transition count 1658
Deduced a syphon composed of 567 places in 0 ms
Iterating global reduction 2 with 17 rules applied. Total rules applied 1648 place count 813 transition count 1658
Deduced a syphon composed of 567 places in 0 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 1651 place count 813 transition count 1655
Deduced a syphon composed of 567 places in 1 ms
Applied a total of 1651 rules in 836 ms. Remains 813 /1173 variables (removed 360) and now considering 1655/1173 (removed -482) transitions.
[2023-03-20 10:53:37] [INFO ] Redundant transitions in 133 ms returned []
// Phase 1: matrix 1655 rows 813 cols
[2023-03-20 10:53:37] [INFO ] Computed 121 place invariants in 16 ms
[2023-03-20 10:53:38] [INFO ] Dead Transitions using invariants and state equation in 697 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 813/1173 places, 1655/1173 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1677 ms. Remains : 813/1173 places, 1655/1173 transitions.
Support contains 3 out of 1173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1173/1173 places, 1173/1173 transitions.
Applied a total of 0 rules in 52 ms. Remains 1173 /1173 variables (removed 0) and now considering 1173/1173 (removed 0) transitions.
// Phase 1: matrix 1173 rows 1173 cols
[2023-03-20 10:53:38] [INFO ] Computed 121 place invariants in 10 ms
[2023-03-20 10:53:38] [INFO ] Implicit Places using invariants in 310 ms returned []
[2023-03-20 10:53:38] [INFO ] Invariant cache hit.
[2023-03-20 10:53:39] [INFO ] Implicit Places using invariants and state equation in 920 ms returned []
Implicit Place search using SMT with State Equation took 1245 ms to find 0 implicit places.
[2023-03-20 10:53:39] [INFO ] Invariant cache hit.
[2023-03-20 10:53:40] [INFO ] Dead Transitions using invariants and state equation in 520 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1819 ms. Remains : 1173/1173 places, 1173/1173 transitions.
Treatment of property ShieldRVt-PT-030B-LTLCardinality-01 finished in 69198 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(!((X(F(p0))&&p1) U !(X(G(p0))||p2)))'
Support contains 6 out of 1182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1182/1182 places, 1182/1182 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1174 transition count 1174
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1174 transition count 1174
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1173 transition count 1173
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1173 transition count 1173
Applied a total of 18 rules in 78 ms. Remains 1173 /1182 variables (removed 9) and now considering 1173/1182 (removed 9) transitions.
// Phase 1: matrix 1173 rows 1173 cols
[2023-03-20 10:53:40] [INFO ] Computed 121 place invariants in 3 ms
[2023-03-20 10:53:40] [INFO ] Implicit Places using invariants in 297 ms returned []
[2023-03-20 10:53:40] [INFO ] Invariant cache hit.
[2023-03-20 10:53:41] [INFO ] Implicit Places using invariants and state equation in 814 ms returned []
Implicit Place search using SMT with State Equation took 1113 ms to find 0 implicit places.
[2023-03-20 10:53:41] [INFO ] Invariant cache hit.
[2023-03-20 10:53:42] [INFO ] Dead Transitions using invariants and state equation in 510 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1173/1182 places, 1173/1182 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1703 ms. Remains : 1173/1182 places, 1173/1182 transitions.
Stuttering acceptance computed with spot in 212 ms :[true, (AND (NOT p0) (NOT p2)), false, false, (NOT p0), p0]
Running random walk in product with property : ShieldRVt-PT-030B-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 p2), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 4}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 0}, { cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=1, aps=[p1:(OR (EQ s573 0) (EQ s677 1)), p2:(OR (EQ s1020 0) (EQ s922 1)), p0:(OR (EQ s95 0) (EQ s318 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 0 reset in 295 ms.
Product exploration explored 100000 steps with 3 reset in 487 ms.
Computed a total of 358 stabilizing places and 358 stable transitions
Computed a total of 358 stabilizing places and 358 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (AND p1 p2)), (X (NOT (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) (NOT p0))))), true, (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 400 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 228 ms :[true, false, (NOT p0), p0, false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-20 10:53:44] [INFO ] Invariant cache hit.
[2023-03-20 10:53:44] [INFO ] After 175ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 10:53:44] [INFO ] [Nat]Absence check using 121 positive place invariants in 36 ms returned sat
[2023-03-20 10:53:45] [INFO ] After 539ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 10:53:45] [INFO ] Deduced a trap composed of 22 places in 361 ms of which 1 ms to minimize.
[2023-03-20 10:53:45] [INFO ] Deduced a trap composed of 20 places in 284 ms of which 1 ms to minimize.
[2023-03-20 10:53:46] [INFO ] Deduced a trap composed of 30 places in 367 ms of which 1 ms to minimize.
[2023-03-20 10:53:46] [INFO ] Deduced a trap composed of 38 places in 510 ms of which 1 ms to minimize.
[2023-03-20 10:53:47] [INFO ] Deduced a trap composed of 40 places in 358 ms of which 2 ms to minimize.
[2023-03-20 10:53:47] [INFO ] Deduced a trap composed of 35 places in 262 ms of which 0 ms to minimize.
[2023-03-20 10:53:47] [INFO ] Deduced a trap composed of 23 places in 214 ms of which 1 ms to minimize.
[2023-03-20 10:53:47] [INFO ] Deduced a trap composed of 31 places in 200 ms of which 1 ms to minimize.
[2023-03-20 10:53:48] [INFO ] Deduced a trap composed of 44 places in 345 ms of which 2 ms to minimize.
[2023-03-20 10:53:48] [INFO ] Deduced a trap composed of 34 places in 181 ms of which 1 ms to minimize.
[2023-03-20 10:53:48] [INFO ] Deduced a trap composed of 36 places in 214 ms of which 1 ms to minimize.
[2023-03-20 10:53:49] [INFO ] Deduced a trap composed of 41 places in 196 ms of which 0 ms to minimize.
[2023-03-20 10:53:49] [INFO ] Deduced a trap composed of 24 places in 166 ms of which 0 ms to minimize.
[2023-03-20 10:53:49] [INFO ] Deduced a trap composed of 39 places in 212 ms of which 0 ms to minimize.
[2023-03-20 10:53:49] [INFO ] Deduced a trap composed of 43 places in 215 ms of which 1 ms to minimize.
[2023-03-20 10:53:50] [INFO ] Deduced a trap composed of 39 places in 265 ms of which 1 ms to minimize.
[2023-03-20 10:53:50] [INFO ] Deduced a trap composed of 32 places in 207 ms of which 1 ms to minimize.
[2023-03-20 10:53:50] [INFO ] Deduced a trap composed of 39 places in 166 ms of which 0 ms to minimize.
[2023-03-20 10:53:50] [INFO ] Deduced a trap composed of 50 places in 185 ms of which 1 ms to minimize.
[2023-03-20 10:53:50] [INFO ] Deduced a trap composed of 31 places in 158 ms of which 1 ms to minimize.
[2023-03-20 10:53:51] [INFO ] Deduced a trap composed of 49 places in 175 ms of which 1 ms to minimize.
[2023-03-20 10:53:51] [INFO ] Deduced a trap composed of 49 places in 158 ms of which 0 ms to minimize.
[2023-03-20 10:53:51] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 6288 ms
[2023-03-20 10:53:51] [INFO ] After 6910ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 63 ms.
[2023-03-20 10:53:51] [INFO ] After 7190ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 20 ms.
Support contains 4 out of 1173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1173/1173 places, 1173/1173 transitions.
Drop transitions removed 326 transitions
Trivial Post-agglo rules discarded 326 transitions
Performed 326 trivial Post agglomeration. Transition count delta: 326
Iterating post reduction 0 with 326 rules applied. Total rules applied 326 place count 1173 transition count 847
Reduce places removed 326 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 328 rules applied. Total rules applied 654 place count 847 transition count 845
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 656 place count 845 transition count 845
Performed 237 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 237 Pre rules applied. Total rules applied 656 place count 845 transition count 608
Deduced a syphon composed of 237 places in 1 ms
Reduce places removed 237 places and 0 transitions.
Iterating global reduction 3 with 474 rules applied. Total rules applied 1130 place count 608 transition count 608
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1131 place count 607 transition count 607
Iterating global reduction 3 with 1 rules applied. Total rules applied 1132 place count 607 transition count 607
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1132 place count 607 transition count 606
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1134 place count 606 transition count 606
Performed 269 Post agglomeration using F-continuation condition.Transition count delta: 269
Deduced a syphon composed of 269 places in 0 ms
Reduce places removed 269 places and 0 transitions.
Iterating global reduction 3 with 538 rules applied. Total rules applied 1672 place count 337 transition count 337
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1673 place count 337 transition count 336
Renaming transitions due to excessive name length > 1024 char.
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 1675 place count 336 transition count 335
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -86
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 4 with 176 rules applied. Total rules applied 1851 place count 248 transition count 421
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1852 place count 248 transition count 420
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1853 place count 247 transition count 419
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1854 place count 246 transition count 419
Applied a total of 1854 rules in 129 ms. Remains 246 /1173 variables (removed 927) and now considering 419/1173 (removed 754) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 246/1173 places, 419/1173 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Finished probabilistic random walk after 24181 steps, run visited all 2 properties in 188 ms. (steps per millisecond=128 )
Probabilistic random walk after 24181 steps, saw 15475 distinct states, run finished after 188 ms. (steps per millisecond=128 ) properties seen :2
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (AND p1 p2)), (X (NOT (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) (NOT p0))))), true, (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p1 p2))), (F (AND (NOT p2) (NOT p0))), (F (AND (NOT p2) p0))]
Knowledge based reduction with 10 factoid took 384 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[true, false, (NOT p0), p0, false, false]
Stuttering acceptance computed with spot in 225 ms :[true, false, (NOT p0), p0, false, false]
Support contains 6 out of 1173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1173/1173 places, 1173/1173 transitions.
Applied a total of 0 rules in 26 ms. Remains 1173 /1173 variables (removed 0) and now considering 1173/1173 (removed 0) transitions.
[2023-03-20 10:53:52] [INFO ] Invariant cache hit.
[2023-03-20 10:53:53] [INFO ] Implicit Places using invariants in 362 ms returned []
[2023-03-20 10:53:53] [INFO ] Invariant cache hit.
[2023-03-20 10:53:54] [INFO ] Implicit Places using invariants and state equation in 878 ms returned []
Implicit Place search using SMT with State Equation took 1254 ms to find 0 implicit places.
[2023-03-20 10:53:54] [INFO ] Invariant cache hit.
[2023-03-20 10:53:54] [INFO ] Dead Transitions using invariants and state equation in 569 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1854 ms. Remains : 1173/1173 places, 1173/1173 transitions.
Computed a total of 358 stabilizing places and 358 stable transitions
Computed a total of 358 stabilizing places and 358 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p1 p2)), (X (NOT (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p2) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 298 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[true, false, (NOT p0), p0, false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-20 10:53:55] [INFO ] Invariant cache hit.
[2023-03-20 10:53:55] [INFO ] After 235ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 10:53:55] [INFO ] [Nat]Absence check using 121 positive place invariants in 35 ms returned sat
[2023-03-20 10:53:56] [INFO ] After 500ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 10:53:56] [INFO ] Deduced a trap composed of 22 places in 246 ms of which 1 ms to minimize.
[2023-03-20 10:53:56] [INFO ] Deduced a trap composed of 20 places in 209 ms of which 1 ms to minimize.
[2023-03-20 10:53:57] [INFO ] Deduced a trap composed of 30 places in 189 ms of which 2 ms to minimize.
[2023-03-20 10:53:57] [INFO ] Deduced a trap composed of 38 places in 212 ms of which 0 ms to minimize.
[2023-03-20 10:53:57] [INFO ] Deduced a trap composed of 40 places in 208 ms of which 0 ms to minimize.
[2023-03-20 10:53:57] [INFO ] Deduced a trap composed of 35 places in 204 ms of which 0 ms to minimize.
[2023-03-20 10:53:57] [INFO ] Deduced a trap composed of 23 places in 198 ms of which 0 ms to minimize.
[2023-03-20 10:53:58] [INFO ] Deduced a trap composed of 31 places in 205 ms of which 1 ms to minimize.
[2023-03-20 10:53:58] [INFO ] Deduced a trap composed of 44 places in 203 ms of which 0 ms to minimize.
[2023-03-20 10:53:58] [INFO ] Deduced a trap composed of 34 places in 222 ms of which 1 ms to minimize.
[2023-03-20 10:53:58] [INFO ] Deduced a trap composed of 36 places in 214 ms of which 0 ms to minimize.
[2023-03-20 10:53:59] [INFO ] Deduced a trap composed of 41 places in 206 ms of which 0 ms to minimize.
[2023-03-20 10:53:59] [INFO ] Deduced a trap composed of 24 places in 186 ms of which 0 ms to minimize.
[2023-03-20 10:53:59] [INFO ] Deduced a trap composed of 39 places in 207 ms of which 0 ms to minimize.
[2023-03-20 10:53:59] [INFO ] Deduced a trap composed of 43 places in 191 ms of which 0 ms to minimize.
[2023-03-20 10:54:00] [INFO ] Deduced a trap composed of 39 places in 172 ms of which 0 ms to minimize.
[2023-03-20 10:54:00] [INFO ] Deduced a trap composed of 32 places in 176 ms of which 0 ms to minimize.
[2023-03-20 10:54:00] [INFO ] Deduced a trap composed of 39 places in 160 ms of which 1 ms to minimize.
[2023-03-20 10:54:00] [INFO ] Deduced a trap composed of 50 places in 159 ms of which 0 ms to minimize.
[2023-03-20 10:54:00] [INFO ] Deduced a trap composed of 31 places in 159 ms of which 1 ms to minimize.
[2023-03-20 10:54:01] [INFO ] Deduced a trap composed of 49 places in 137 ms of which 1 ms to minimize.
[2023-03-20 10:54:01] [INFO ] Deduced a trap composed of 49 places in 145 ms of which 0 ms to minimize.
[2023-03-20 10:54:01] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 5027 ms
[2023-03-20 10:54:01] [INFO ] After 5611ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 68 ms.
[2023-03-20 10:54:01] [INFO ] After 5896ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 40 ms.
Support contains 4 out of 1173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1173/1173 places, 1173/1173 transitions.
Drop transitions removed 326 transitions
Trivial Post-agglo rules discarded 326 transitions
Performed 326 trivial Post agglomeration. Transition count delta: 326
Iterating post reduction 0 with 326 rules applied. Total rules applied 326 place count 1173 transition count 847
Reduce places removed 326 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 328 rules applied. Total rules applied 654 place count 847 transition count 845
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 656 place count 845 transition count 845
Performed 237 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 237 Pre rules applied. Total rules applied 656 place count 845 transition count 608
Deduced a syphon composed of 237 places in 1 ms
Reduce places removed 237 places and 0 transitions.
Iterating global reduction 3 with 474 rules applied. Total rules applied 1130 place count 608 transition count 608
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1131 place count 607 transition count 607
Iterating global reduction 3 with 1 rules applied. Total rules applied 1132 place count 607 transition count 607
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1132 place count 607 transition count 606
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1134 place count 606 transition count 606
Performed 269 Post agglomeration using F-continuation condition.Transition count delta: 269
Deduced a syphon composed of 269 places in 0 ms
Reduce places removed 269 places and 0 transitions.
Iterating global reduction 3 with 538 rules applied. Total rules applied 1672 place count 337 transition count 337
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1673 place count 337 transition count 336
Renaming transitions due to excessive name length > 1024 char.
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 1675 place count 336 transition count 335
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -86
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 4 with 176 rules applied. Total rules applied 1851 place count 248 transition count 421
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1852 place count 248 transition count 420
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1853 place count 247 transition count 419
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1854 place count 246 transition count 419
Applied a total of 1854 rules in 116 ms. Remains 246 /1173 variables (removed 927) and now considering 419/1173 (removed 754) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 246/1173 places, 419/1173 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 2) seen :0
Finished probabilistic random walk after 24181 steps, run visited all 2 properties in 239 ms. (steps per millisecond=101 )
Probabilistic random walk after 24181 steps, saw 15475 distinct states, run finished after 239 ms. (steps per millisecond=101 ) properties seen :2
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p1 p2)), (X (NOT (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p2) p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p1 p2))), (F (AND (NOT p0) (NOT p2))), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 8 factoid took 434 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[true, false, (NOT p0), p0, false, false]
Stuttering acceptance computed with spot in 145 ms :[true, false, (NOT p0), p0, false, false]
Stuttering acceptance computed with spot in 138 ms :[true, false, (NOT p0), p0, false, false]
Product exploration explored 100000 steps with 2 reset in 288 ms.
Product exploration explored 100000 steps with 1 reset in 412 ms.
Applying partial POR strategy [true, false, true, true, false, true]
Stuttering acceptance computed with spot in 197 ms :[true, false, (NOT p0), p0, false, false]
Support contains 6 out of 1173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1173/1173 places, 1173/1173 transitions.
Performed 327 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 327 rules applied. Total rules applied 327 place count 1173 transition count 1173
Performed 120 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 120 Pre rules applied. Total rules applied 327 place count 1173 transition count 1292
Deduced a syphon composed of 447 places in 2 ms
Iterating global reduction 1 with 120 rules applied. Total rules applied 447 place count 1173 transition count 1292
Performed 358 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 805 places in 0 ms
Iterating global reduction 1 with 358 rules applied. Total rules applied 805 place count 1173 transition count 1293
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 806 place count 1173 transition count 1292
Renaming transitions due to excessive name length > 1024 char.
Discarding 238 places :
Symmetric choice reduction at 2 with 238 rule applications. Total rules 1044 place count 935 transition count 1054
Deduced a syphon composed of 567 places in 1 ms
Iterating global reduction 2 with 238 rules applied. Total rules applied 1282 place count 935 transition count 1054
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 568 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1283 place count 935 transition count 1054
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1285 place count 933 transition count 1052
Deduced a syphon composed of 566 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1287 place count 933 transition count 1052
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -734
Deduced a syphon composed of 667 places in 0 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1388 place count 933 transition count 1786
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 1489 place count 832 transition count 1584
Deduced a syphon composed of 566 places in 0 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1590 place count 832 transition count 1584
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -103
Deduced a syphon composed of 581 places in 1 ms
Iterating global reduction 2 with 15 rules applied. Total rules applied 1605 place count 832 transition count 1687
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 1620 place count 817 transition count 1657
Deduced a syphon composed of 566 places in 0 ms
Iterating global reduction 2 with 15 rules applied. Total rules applied 1635 place count 817 transition count 1657
Deduced a syphon composed of 566 places in 1 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 1638 place count 817 transition count 1654
Deduced a syphon composed of 566 places in 0 ms
Applied a total of 1638 rules in 482 ms. Remains 817 /1173 variables (removed 356) and now considering 1654/1173 (removed -481) transitions.
[2023-03-20 10:54:04] [INFO ] Redundant transitions in 28 ms returned []
// Phase 1: matrix 1654 rows 817 cols
[2023-03-20 10:54:04] [INFO ] Computed 121 place invariants in 6 ms
[2023-03-20 10:54:05] [INFO ] Dead Transitions using invariants and state equation in 695 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 817/1173 places, 1654/1173 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1242 ms. Remains : 817/1173 places, 1654/1173 transitions.
Support contains 6 out of 1173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1173/1173 places, 1173/1173 transitions.
Applied a total of 0 rules in 24 ms. Remains 1173 /1173 variables (removed 0) and now considering 1173/1173 (removed 0) transitions.
// Phase 1: matrix 1173 rows 1173 cols
[2023-03-20 10:54:05] [INFO ] Computed 121 place invariants in 3 ms
[2023-03-20 10:54:05] [INFO ] Implicit Places using invariants in 263 ms returned []
[2023-03-20 10:54:05] [INFO ] Invariant cache hit.
[2023-03-20 10:54:06] [INFO ] Implicit Places using invariants and state equation in 664 ms returned []
Implicit Place search using SMT with State Equation took 951 ms to find 0 implicit places.
[2023-03-20 10:54:06] [INFO ] Invariant cache hit.
[2023-03-20 10:54:06] [INFO ] Dead Transitions using invariants and state equation in 549 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1526 ms. Remains : 1173/1173 places, 1173/1173 transitions.
Treatment of property ShieldRVt-PT-030B-LTLCardinality-03 finished in 26316 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) U X(X(G(p1)))))'
Support contains 3 out of 1182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1182/1182 places, 1182/1182 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1174 transition count 1174
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1174 transition count 1174
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1173 transition count 1173
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1173 transition count 1173
Applied a total of 18 rules in 103 ms. Remains 1173 /1182 variables (removed 9) and now considering 1173/1182 (removed 9) transitions.
// Phase 1: matrix 1173 rows 1173 cols
[2023-03-20 10:54:06] [INFO ] Computed 121 place invariants in 4 ms
[2023-03-20 10:54:07] [INFO ] Implicit Places using invariants in 303 ms returned []
[2023-03-20 10:54:07] [INFO ] Invariant cache hit.
[2023-03-20 10:54:08] [INFO ] Implicit Places using invariants and state equation in 953 ms returned []
Implicit Place search using SMT with State Equation took 1258 ms to find 0 implicit places.
[2023-03-20 10:54:08] [INFO ] Invariant cache hit.
[2023-03-20 10:54:08] [INFO ] Dead Transitions using invariants and state equation in 517 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1173/1182 places, 1173/1182 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1892 ms. Remains : 1173/1182 places, 1173/1182 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-030B-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 1}, { cond=p1, acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 5}]], initial=5, aps=[p1:(OR (EQ s457 0) (EQ s942 1)), p0:(EQ s586 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 309 ms.
Product exploration explored 100000 steps with 2 reset in 380 ms.
Computed a total of 359 stabilizing places and 359 stable transitions
Computed a total of 359 stabilizing places and 359 stable transitions
Detected a total of 359/1173 stabilizing places and 359/1173 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p1), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 408 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 6 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 167249 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :{}
Probabilistic random walk after 167249 steps, saw 78405 distinct states, run finished after 3001 ms. (steps per millisecond=55 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-20 10:54:13] [INFO ] Invariant cache hit.
[2023-03-20 10:54:13] [INFO ] After 133ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 10:54:13] [INFO ] [Nat]Absence check using 121 positive place invariants in 30 ms returned sat
[2023-03-20 10:54:14] [INFO ] After 428ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 10:54:14] [INFO ] Deduced a trap composed of 32 places in 196 ms of which 1 ms to minimize.
[2023-03-20 10:54:14] [INFO ] Deduced a trap composed of 23 places in 209 ms of which 0 ms to minimize.
[2023-03-20 10:54:14] [INFO ] Deduced a trap composed of 31 places in 227 ms of which 1 ms to minimize.
[2023-03-20 10:54:15] [INFO ] Deduced a trap composed of 25 places in 228 ms of which 0 ms to minimize.
[2023-03-20 10:54:15] [INFO ] Deduced a trap composed of 22 places in 218 ms of which 1 ms to minimize.
[2023-03-20 10:54:15] [INFO ] Deduced a trap composed of 42 places in 225 ms of which 14 ms to minimize.
[2023-03-20 10:54:15] [INFO ] Deduced a trap composed of 36 places in 202 ms of which 1 ms to minimize.
[2023-03-20 10:54:16] [INFO ] Deduced a trap composed of 24 places in 236 ms of which 1 ms to minimize.
[2023-03-20 10:54:16] [INFO ] Deduced a trap composed of 39 places in 190 ms of which 0 ms to minimize.
[2023-03-20 10:54:16] [INFO ] Deduced a trap composed of 30 places in 185 ms of which 0 ms to minimize.
[2023-03-20 10:54:16] [INFO ] Deduced a trap composed of 55 places in 188 ms of which 1 ms to minimize.
[2023-03-20 10:54:17] [INFO ] Deduced a trap composed of 48 places in 196 ms of which 1 ms to minimize.
[2023-03-20 10:54:17] [INFO ] Deduced a trap composed of 29 places in 182 ms of which 0 ms to minimize.
[2023-03-20 10:54:17] [INFO ] Deduced a trap composed of 25 places in 200 ms of which 1 ms to minimize.
[2023-03-20 10:54:17] [INFO ] Deduced a trap composed of 38 places in 179 ms of which 0 ms to minimize.
[2023-03-20 10:54:17] [INFO ] Deduced a trap composed of 40 places in 190 ms of which 0 ms to minimize.
[2023-03-20 10:54:18] [INFO ] Deduced a trap composed of 46 places in 171 ms of which 1 ms to minimize.
[2023-03-20 10:54:18] [INFO ] Deduced a trap composed of 20 places in 206 ms of which 1 ms to minimize.
[2023-03-20 10:54:18] [INFO ] Deduced a trap composed of 46 places in 169 ms of which 1 ms to minimize.
[2023-03-20 10:54:18] [INFO ] Deduced a trap composed of 39 places in 174 ms of which 0 ms to minimize.
[2023-03-20 10:54:18] [INFO ] Deduced a trap composed of 44 places in 155 ms of which 0 ms to minimize.
[2023-03-20 10:54:19] [INFO ] Deduced a trap composed of 39 places in 152 ms of which 1 ms to minimize.
[2023-03-20 10:54:19] [INFO ] Deduced a trap composed of 33 places in 151 ms of which 0 ms to minimize.
[2023-03-20 10:54:19] [INFO ] Deduced a trap composed of 33 places in 148 ms of which 0 ms to minimize.
[2023-03-20 10:54:19] [INFO ] Deduced a trap composed of 35 places in 175 ms of which 2 ms to minimize.
[2023-03-20 10:54:19] [INFO ] Deduced a trap composed of 58 places in 159 ms of which 0 ms to minimize.
[2023-03-20 10:54:20] [INFO ] Deduced a trap composed of 40 places in 146 ms of which 1 ms to minimize.
[2023-03-20 10:54:20] [INFO ] Deduced a trap composed of 41 places in 137 ms of which 0 ms to minimize.
[2023-03-20 10:54:20] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 6245 ms
[2023-03-20 10:54:20] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 0 ms to minimize.
[2023-03-20 10:54:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 220 ms
[2023-03-20 10:54:20] [INFO ] After 7021ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 91 ms.
[2023-03-20 10:54:20] [INFO ] After 7329ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 68 ms.
Support contains 3 out of 1173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1173/1173 places, 1173/1173 transitions.
Drop transitions removed 327 transitions
Trivial Post-agglo rules discarded 327 transitions
Performed 327 trivial Post agglomeration. Transition count delta: 327
Iterating post reduction 0 with 327 rules applied. Total rules applied 327 place count 1173 transition count 846
Reduce places removed 327 places and 0 transitions.
Iterating post reduction 1 with 327 rules applied. Total rules applied 654 place count 846 transition count 846
Performed 239 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 239 Pre rules applied. Total rules applied 654 place count 846 transition count 607
Deduced a syphon composed of 239 places in 1 ms
Reduce places removed 239 places and 0 transitions.
Iterating global reduction 2 with 478 rules applied. Total rules applied 1132 place count 607 transition count 607
Performed 271 Post agglomeration using F-continuation condition.Transition count delta: 271
Deduced a syphon composed of 271 places in 0 ms
Reduce places removed 271 places and 0 transitions.
Iterating global reduction 2 with 542 rules applied. Total rules applied 1674 place count 336 transition count 336
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1675 place count 336 transition count 335
Renaming transitions due to excessive name length > 1024 char.
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 1677 place count 335 transition count 334
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -86
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 1853 place count 247 transition count 420
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1854 place count 247 transition count 419
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1855 place count 247 transition count 418
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1856 place count 246 transition count 418
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1857 place count 246 transition count 417
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1858 place count 245 transition count 416
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1859 place count 244 transition count 416
Applied a total of 1859 rules in 83 ms. Remains 244 /1173 variables (removed 929) and now considering 416/1173 (removed 757) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 244/1173 places, 416/1173 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 416 rows 244 cols
[2023-03-20 10:54:21] [INFO ] Computed 120 place invariants in 1 ms
[2023-03-20 10:54:21] [INFO ] After 129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 10:54:21] [INFO ] [Nat]Absence check using 120 positive place invariants in 175 ms returned sat
[2023-03-20 10:54:21] [INFO ] After 94ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 10:54:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 10:54:21] [INFO ] After 9ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 10:54:21] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-20 10:54:21] [INFO ] After 435ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 3 out of 244 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 244/244 places, 416/416 transitions.
Applied a total of 0 rules in 5 ms. Remains 244 /244 variables (removed 0) and now considering 416/416 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 244/244 places, 416/416 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 678591 steps, run timeout after 3001 ms. (steps per millisecond=226 ) properties seen :{}
Probabilistic random walk after 678591 steps, saw 440822 distinct states, run finished after 3001 ms. (steps per millisecond=226 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 10:54:24] [INFO ] Invariant cache hit.
[2023-03-20 10:54:24] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 10:54:24] [INFO ] [Nat]Absence check using 120 positive place invariants in 22 ms returned sat
[2023-03-20 10:54:25] [INFO ] After 133ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 10:54:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 10:54:25] [INFO ] After 12ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 10:54:25] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-20 10:54:25] [INFO ] After 279ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 347 steps, including 2 resets, run visited all 1 properties in 3 ms. (steps per millisecond=115 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p1), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (NOT p1)), (F (AND (NOT p1) p0))]
Knowledge based reduction with 9 factoid took 507 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 6 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 216 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1)]
Support contains 3 out of 1173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1173/1173 places, 1173/1173 transitions.
Applied a total of 0 rules in 43 ms. Remains 1173 /1173 variables (removed 0) and now considering 1173/1173 (removed 0) transitions.
// Phase 1: matrix 1173 rows 1173 cols
[2023-03-20 10:54:26] [INFO ] Computed 121 place invariants in 10 ms
[2023-03-20 10:54:26] [INFO ] Implicit Places using invariants in 310 ms returned []
[2023-03-20 10:54:26] [INFO ] Invariant cache hit.
[2023-03-20 10:54:27] [INFO ] Implicit Places using invariants and state equation in 934 ms returned []
Implicit Place search using SMT with State Equation took 1259 ms to find 0 implicit places.
[2023-03-20 10:54:27] [INFO ] Invariant cache hit.
[2023-03-20 10:54:28] [INFO ] Dead Transitions using invariants and state equation in 572 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1876 ms. Remains : 1173/1173 places, 1173/1173 transitions.
Computed a total of 359 stabilizing places and 359 stable transitions
Computed a total of 359 stabilizing places and 359 stable transitions
Detected a total of 359/1173 stabilizing places and 359/1173 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p1), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 448 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 6 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 180545 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :{}
Probabilistic random walk after 180545 steps, saw 83712 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-20 10:54:31] [INFO ] Invariant cache hit.
[2023-03-20 10:54:32] [INFO ] After 160ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 10:54:32] [INFO ] [Nat]Absence check using 121 positive place invariants in 30 ms returned sat
[2023-03-20 10:54:32] [INFO ] After 428ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 10:54:32] [INFO ] Deduced a trap composed of 32 places in 231 ms of which 1 ms to minimize.
[2023-03-20 10:54:33] [INFO ] Deduced a trap composed of 23 places in 212 ms of which 0 ms to minimize.
[2023-03-20 10:54:33] [INFO ] Deduced a trap composed of 31 places in 206 ms of which 1 ms to minimize.
[2023-03-20 10:54:33] [INFO ] Deduced a trap composed of 25 places in 204 ms of which 1 ms to minimize.
[2023-03-20 10:54:33] [INFO ] Deduced a trap composed of 22 places in 215 ms of which 0 ms to minimize.
[2023-03-20 10:54:34] [INFO ] Deduced a trap composed of 42 places in 217 ms of which 0 ms to minimize.
[2023-03-20 10:54:34] [INFO ] Deduced a trap composed of 36 places in 224 ms of which 1 ms to minimize.
[2023-03-20 10:54:34] [INFO ] Deduced a trap composed of 24 places in 212 ms of which 1 ms to minimize.
[2023-03-20 10:54:34] [INFO ] Deduced a trap composed of 39 places in 186 ms of which 1 ms to minimize.
[2023-03-20 10:54:35] [INFO ] Deduced a trap composed of 30 places in 223 ms of which 1 ms to minimize.
[2023-03-20 10:54:35] [INFO ] Deduced a trap composed of 55 places in 201 ms of which 1 ms to minimize.
[2023-03-20 10:54:35] [INFO ] Deduced a trap composed of 48 places in 198 ms of which 1 ms to minimize.
[2023-03-20 10:54:35] [INFO ] Deduced a trap composed of 29 places in 192 ms of which 1 ms to minimize.
[2023-03-20 10:54:36] [INFO ] Deduced a trap composed of 25 places in 177 ms of which 1 ms to minimize.
[2023-03-20 10:54:36] [INFO ] Deduced a trap composed of 38 places in 160 ms of which 0 ms to minimize.
[2023-03-20 10:54:36] [INFO ] Deduced a trap composed of 40 places in 235 ms of which 1 ms to minimize.
[2023-03-20 10:54:36] [INFO ] Deduced a trap composed of 46 places in 197 ms of which 1 ms to minimize.
[2023-03-20 10:54:36] [INFO ] Deduced a trap composed of 20 places in 171 ms of which 0 ms to minimize.
[2023-03-20 10:54:37] [INFO ] Deduced a trap composed of 46 places in 192 ms of which 1 ms to minimize.
[2023-03-20 10:54:37] [INFO ] Deduced a trap composed of 39 places in 153 ms of which 1 ms to minimize.
[2023-03-20 10:54:37] [INFO ] Deduced a trap composed of 44 places in 168 ms of which 0 ms to minimize.
[2023-03-20 10:54:37] [INFO ] Deduced a trap composed of 39 places in 149 ms of which 0 ms to minimize.
[2023-03-20 10:54:37] [INFO ] Deduced a trap composed of 33 places in 152 ms of which 0 ms to minimize.
[2023-03-20 10:54:38] [INFO ] Deduced a trap composed of 33 places in 187 ms of which 1 ms to minimize.
[2023-03-20 10:54:38] [INFO ] Deduced a trap composed of 35 places in 152 ms of which 1 ms to minimize.
[2023-03-20 10:54:38] [INFO ] Deduced a trap composed of 58 places in 158 ms of which 0 ms to minimize.
[2023-03-20 10:54:38] [INFO ] Deduced a trap composed of 40 places in 141 ms of which 1 ms to minimize.
[2023-03-20 10:54:38] [INFO ] Deduced a trap composed of 41 places in 144 ms of which 1 ms to minimize.
[2023-03-20 10:54:38] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 6245 ms
[2023-03-20 10:54:39] [INFO ] Deduced a trap composed of 27 places in 148 ms of which 1 ms to minimize.
[2023-03-20 10:54:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
[2023-03-20 10:54:39] [INFO ] After 7001ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 95 ms.
[2023-03-20 10:54:39] [INFO ] After 7307ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 48 ms.
Support contains 3 out of 1173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1173/1173 places, 1173/1173 transitions.
Drop transitions removed 327 transitions
Trivial Post-agglo rules discarded 327 transitions
Performed 327 trivial Post agglomeration. Transition count delta: 327
Iterating post reduction 0 with 327 rules applied. Total rules applied 327 place count 1173 transition count 846
Reduce places removed 327 places and 0 transitions.
Iterating post reduction 1 with 327 rules applied. Total rules applied 654 place count 846 transition count 846
Performed 239 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 239 Pre rules applied. Total rules applied 654 place count 846 transition count 607
Deduced a syphon composed of 239 places in 1 ms
Reduce places removed 239 places and 0 transitions.
Iterating global reduction 2 with 478 rules applied. Total rules applied 1132 place count 607 transition count 607
Performed 271 Post agglomeration using F-continuation condition.Transition count delta: 271
Deduced a syphon composed of 271 places in 0 ms
Reduce places removed 271 places and 0 transitions.
Iterating global reduction 2 with 542 rules applied. Total rules applied 1674 place count 336 transition count 336
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1675 place count 336 transition count 335
Renaming transitions due to excessive name length > 1024 char.
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 1677 place count 335 transition count 334
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -86
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 1853 place count 247 transition count 420
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1854 place count 247 transition count 419
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1855 place count 247 transition count 418
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1856 place count 246 transition count 418
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1857 place count 246 transition count 417
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1858 place count 245 transition count 416
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1859 place count 244 transition count 416
Applied a total of 1859 rules in 69 ms. Remains 244 /1173 variables (removed 929) and now considering 416/1173 (removed 757) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 244/1173 places, 416/1173 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 388290 steps, run timeout after 3001 ms. (steps per millisecond=129 ) properties seen :{0=1, 2=1}
Probabilistic random walk after 388290 steps, saw 253575 distinct states, run finished after 3001 ms. (steps per millisecond=129 ) properties seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 416 rows 244 cols
[2023-03-20 10:54:42] [INFO ] Computed 120 place invariants in 2 ms
[2023-03-20 10:54:42] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 10:54:42] [INFO ] [Nat]Absence check using 120 positive place invariants in 13 ms returned sat
[2023-03-20 10:54:43] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 10:54:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 10:54:43] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 10:54:43] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-20 10:54:43] [INFO ] After 226ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 3 out of 244 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 244/244 places, 416/416 transitions.
Applied a total of 0 rules in 4 ms. Remains 244 /244 variables (removed 0) and now considering 416/416 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 244/244 places, 416/416 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 618774 steps, run timeout after 3001 ms. (steps per millisecond=206 ) properties seen :{}
Probabilistic random walk after 618774 steps, saw 401545 distinct states, run finished after 3001 ms. (steps per millisecond=206 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 10:54:46] [INFO ] Invariant cache hit.
[2023-03-20 10:54:46] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 10:54:46] [INFO ] [Nat]Absence check using 120 positive place invariants in 13 ms returned sat
[2023-03-20 10:54:46] [INFO ] After 91ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 10:54:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 10:54:46] [INFO ] After 9ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 10:54:46] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-20 10:54:46] [INFO ] After 204ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 73 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=73 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p1), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (NOT p1)), (F (AND (NOT p1) p0))]
Knowledge based reduction with 9 factoid took 412 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 6 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 156 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1)]
Entered a terminal (fully accepting) state of product in 76535 steps with 4 reset in 336 ms.
FORMULA ShieldRVt-PT-030B-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLCardinality-05 finished in 40866 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U X(p1))||F((X(p3)&&p2))))'
Support contains 5 out of 1182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1182/1182 places, 1182/1182 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1174 transition count 1174
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1174 transition count 1174
Applied a total of 16 rules in 81 ms. Remains 1174 /1182 variables (removed 8) and now considering 1174/1182 (removed 8) transitions.
// Phase 1: matrix 1174 rows 1174 cols
[2023-03-20 10:54:47] [INFO ] Computed 121 place invariants in 9 ms
[2023-03-20 10:54:48] [INFO ] Implicit Places using invariants in 313 ms returned []
[2023-03-20 10:54:48] [INFO ] Invariant cache hit.
[2023-03-20 10:54:48] [INFO ] Implicit Places using invariants and state equation in 803 ms returned []
Implicit Place search using SMT with State Equation took 1131 ms to find 0 implicit places.
[2023-03-20 10:54:48] [INFO ] Invariant cache hit.
[2023-03-20 10:54:49] [INFO ] Dead Transitions using invariants and state equation in 524 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1174/1182 places, 1174/1182 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1751 ms. Remains : 1174/1182 places, 1174/1182 transitions.
Stuttering acceptance computed with spot in 225 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : ShieldRVt-PT-030B-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 3}, { cond=p2, acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) p2 (NOT p1) (NOT p3)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1) (NOT p3)), acceptance={} source=4 dest: 3}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(OR (EQ s1104 0) (EQ s1143 1)), p2:(AND (EQ s1143 0) (EQ s1104 1)), p1:(EQ s1002 1), p3:(OR (EQ s645 0) (EQ s395 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 745 reset in 354 ms.
Product exploration explored 100000 steps with 734 reset in 293 ms.
Computed a total of 360 stabilizing places and 360 stable transitions
Computed a total of 360 stabilizing places and 360 stable transitions
Detected a total of 360/1174 stabilizing places and 360/1174 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1) p3), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) p2 (NOT p1) (NOT p3)))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p2 (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1) (NOT p3))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 1006 ms. Reduced automaton from 7 states, 20 edges and 4 AP (stutter sensitive) to 7 states, 17 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 310 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 265 ms. (steps per millisecond=37 ) properties (out of 12) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-20 10:54:52] [INFO ] Invariant cache hit.
[2023-03-20 10:54:52] [INFO ] After 270ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-20 10:54:52] [INFO ] [Nat]Absence check using 121 positive place invariants in 36 ms returned sat
[2023-03-20 10:54:53] [INFO ] After 536ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :3
[2023-03-20 10:54:53] [INFO ] Deduced a trap composed of 23 places in 267 ms of which 0 ms to minimize.
[2023-03-20 10:54:53] [INFO ] Deduced a trap composed of 30 places in 268 ms of which 1 ms to minimize.
[2023-03-20 10:54:54] [INFO ] Deduced a trap composed of 31 places in 243 ms of which 1 ms to minimize.
[2023-03-20 10:54:54] [INFO ] Deduced a trap composed of 33 places in 230 ms of which 0 ms to minimize.
[2023-03-20 10:54:54] [INFO ] Deduced a trap composed of 24 places in 227 ms of which 1 ms to minimize.
[2023-03-20 10:54:55] [INFO ] Deduced a trap composed of 29 places in 266 ms of which 2 ms to minimize.
[2023-03-20 10:54:55] [INFO ] Deduced a trap composed of 25 places in 253 ms of which 0 ms to minimize.
[2023-03-20 10:54:55] [INFO ] Deduced a trap composed of 24 places in 220 ms of which 0 ms to minimize.
[2023-03-20 10:54:55] [INFO ] Deduced a trap composed of 28 places in 243 ms of which 1 ms to minimize.
[2023-03-20 10:54:56] [INFO ] Deduced a trap composed of 39 places in 216 ms of which 1 ms to minimize.
[2023-03-20 10:54:56] [INFO ] Deduced a trap composed of 36 places in 202 ms of which 0 ms to minimize.
[2023-03-20 10:54:56] [INFO ] Deduced a trap composed of 48 places in 206 ms of which 13 ms to minimize.
[2023-03-20 10:54:56] [INFO ] Deduced a trap composed of 47 places in 225 ms of which 0 ms to minimize.
[2023-03-20 10:54:57] [INFO ] Deduced a trap composed of 29 places in 227 ms of which 1 ms to minimize.
[2023-03-20 10:54:57] [INFO ] Deduced a trap composed of 34 places in 203 ms of which 1 ms to minimize.
[2023-03-20 10:54:57] [INFO ] Deduced a trap composed of 30 places in 179 ms of which 0 ms to minimize.
[2023-03-20 10:54:57] [INFO ] Deduced a trap composed of 31 places in 185 ms of which 0 ms to minimize.
[2023-03-20 10:54:58] [INFO ] Deduced a trap composed of 41 places in 177 ms of which 1 ms to minimize.
[2023-03-20 10:54:58] [INFO ] Deduced a trap composed of 49 places in 176 ms of which 1 ms to minimize.
[2023-03-20 10:54:58] [INFO ] Deduced a trap composed of 31 places in 186 ms of which 1 ms to minimize.
[2023-03-20 10:54:58] [INFO ] Deduced a trap composed of 48 places in 172 ms of which 0 ms to minimize.
[2023-03-20 10:54:59] [INFO ] Deduced a trap composed of 49 places in 194 ms of which 1 ms to minimize.
[2023-03-20 10:54:59] [INFO ] Deduced a trap composed of 59 places in 190 ms of which 1 ms to minimize.
[2023-03-20 10:54:59] [INFO ] Deduced a trap composed of 45 places in 195 ms of which 1 ms to minimize.
[2023-03-20 10:54:59] [INFO ] Deduced a trap composed of 52 places in 164 ms of which 0 ms to minimize.
[2023-03-20 10:54:59] [INFO ] Deduced a trap composed of 50 places in 174 ms of which 0 ms to minimize.
[2023-03-20 10:55:00] [INFO ] Deduced a trap composed of 49 places in 163 ms of which 1 ms to minimize.
[2023-03-20 10:55:00] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 6864 ms
[2023-03-20 10:55:00] [INFO ] After 7652ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :3
Attempting to minimize the solution found.
Minimization took 163 ms.
[2023-03-20 10:55:00] [INFO ] After 8165ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :3
Fused 7 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 59 ms.
Support contains 5 out of 1174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1174/1174 places, 1174/1174 transitions.
Drop transitions removed 327 transitions
Trivial Post-agglo rules discarded 327 transitions
Performed 327 trivial Post agglomeration. Transition count delta: 327
Iterating post reduction 0 with 327 rules applied. Total rules applied 327 place count 1174 transition count 847
Reduce places removed 327 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 328 rules applied. Total rules applied 655 place count 847 transition count 846
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 656 place count 846 transition count 846
Performed 238 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 238 Pre rules applied. Total rules applied 656 place count 846 transition count 608
Deduced a syphon composed of 238 places in 1 ms
Reduce places removed 238 places and 0 transitions.
Iterating global reduction 3 with 476 rules applied. Total rules applied 1132 place count 608 transition count 608
Performed 268 Post agglomeration using F-continuation condition.Transition count delta: 268
Deduced a syphon composed of 268 places in 0 ms
Reduce places removed 268 places and 0 transitions.
Iterating global reduction 3 with 536 rules applied. Total rules applied 1668 place count 340 transition count 340
Renaming transitions due to excessive name length > 1024 char.
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: -90
Deduced a syphon composed of 90 places in 0 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 1848 place count 250 transition count 430
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1849 place count 250 transition count 429
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1850 place count 249 transition count 428
Applied a total of 1850 rules in 64 ms. Remains 249 /1174 variables (removed 925) and now considering 428/1174 (removed 746) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 249/1174 places, 428/1174 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 3) seen :1
Finished Best-First random walk after 188 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=94 )
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1) p3), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) p2 (NOT p1) (NOT p3)))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p2 (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1) (NOT p3))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p3) (G (NOT p3)))), (G (NOT (AND (NOT p0) (NOT p2)))), (G (NOT (AND (NOT p1) (NOT p3) (NOT p0) (NOT p2)))), (G (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (G (NOT (AND (NOT p3) (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p3) p2)), (F (AND (NOT p0) p2)), (F (AND (NOT p1) p2)), (F (AND (NOT p1) (NOT p3) (NOT p2))), (F (AND (NOT p1) (NOT p3) (NOT p0) p2)), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND (NOT p1) (NOT p0) p2)), (F (AND (NOT p3) (NOT p0) p2))]
Knowledge based reduction with 26 factoid took 1493 ms. Reduced automaton from 7 states, 17 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 230 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3))]
[2023-03-20 10:55:02] [INFO ] Invariant cache hit.
[2023-03-20 10:55:03] [INFO ] [Real]Absence check using 121 positive place invariants in 76 ms returned sat
[2023-03-20 10:55:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 10:55:05] [INFO ] [Real]Absence check using state equation in 1726 ms returned sat
[2023-03-20 10:55:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 10:55:05] [INFO ] [Nat]Absence check using 121 positive place invariants in 80 ms returned sat
[2023-03-20 10:55:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 10:55:07] [INFO ] [Nat]Absence check using state equation in 2200 ms returned sat
[2023-03-20 10:55:08] [INFO ] Computed and/alt/rep : 1173/1715/1173 causal constraints (skipped 0 transitions) in 90 ms.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 5 out of 1174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1174/1174 places, 1174/1174 transitions.
Applied a total of 0 rules in 29 ms. Remains 1174 /1174 variables (removed 0) and now considering 1174/1174 (removed 0) transitions.
[2023-03-20 10:55:20] [INFO ] Invariant cache hit.
[2023-03-20 10:55:20] [INFO ] Implicit Places using invariants in 277 ms returned []
[2023-03-20 10:55:20] [INFO ] Invariant cache hit.
[2023-03-20 10:55:21] [INFO ] Implicit Places using invariants and state equation in 947 ms returned []
Implicit Place search using SMT with State Equation took 1244 ms to find 0 implicit places.
[2023-03-20 10:55:21] [INFO ] Invariant cache hit.
[2023-03-20 10:55:22] [INFO ] Dead Transitions using invariants and state equation in 558 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1846 ms. Remains : 1174/1174 places, 1174/1174 transitions.
Computed a total of 360 stabilizing places and 360 stable transitions
Computed a total of 360 stabilizing places and 360 stable transitions
Detected a total of 360/1174 stabilizing places and 360/1174 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0 p3), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p3) (NOT p1))))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 406 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 257 ms. (steps per millisecond=38 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-20 10:55:23] [INFO ] Invariant cache hit.
[2023-03-20 10:55:23] [INFO ] [Real]Absence check using 121 positive place invariants in 55 ms returned sat
[2023-03-20 10:55:23] [INFO ] After 340ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 10:55:23] [INFO ] [Nat]Absence check using 121 positive place invariants in 28 ms returned sat
[2023-03-20 10:55:24] [INFO ] After 508ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 10:55:24] [INFO ] Deduced a trap composed of 25 places in 220 ms of which 1 ms to minimize.
[2023-03-20 10:55:24] [INFO ] Deduced a trap composed of 26 places in 213 ms of which 1 ms to minimize.
[2023-03-20 10:55:25] [INFO ] Deduced a trap composed of 36 places in 209 ms of which 0 ms to minimize.
[2023-03-20 10:55:25] [INFO ] Deduced a trap composed of 45 places in 249 ms of which 1 ms to minimize.
[2023-03-20 10:55:25] [INFO ] Deduced a trap composed of 48 places in 203 ms of which 1 ms to minimize.
[2023-03-20 10:55:25] [INFO ] Deduced a trap composed of 44 places in 270 ms of which 0 ms to minimize.
[2023-03-20 10:55:26] [INFO ] Deduced a trap composed of 52 places in 210 ms of which 1 ms to minimize.
[2023-03-20 10:55:26] [INFO ] Deduced a trap composed of 43 places in 196 ms of which 0 ms to minimize.
[2023-03-20 10:55:26] [INFO ] Deduced a trap composed of 46 places in 199 ms of which 0 ms to minimize.
[2023-03-20 10:55:26] [INFO ] Deduced a trap composed of 23 places in 190 ms of which 1 ms to minimize.
[2023-03-20 10:55:27] [INFO ] Deduced a trap composed of 38 places in 179 ms of which 0 ms to minimize.
[2023-03-20 10:55:27] [INFO ] Deduced a trap composed of 29 places in 209 ms of which 1 ms to minimize.
[2023-03-20 10:55:27] [INFO ] Deduced a trap composed of 33 places in 164 ms of which 0 ms to minimize.
[2023-03-20 10:55:27] [INFO ] Deduced a trap composed of 35 places in 176 ms of which 0 ms to minimize.
[2023-03-20 10:55:27] [INFO ] Deduced a trap composed of 40 places in 144 ms of which 0 ms to minimize.
[2023-03-20 10:55:28] [INFO ] Deduced a trap composed of 33 places in 152 ms of which 0 ms to minimize.
[2023-03-20 10:55:28] [INFO ] Deduced a trap composed of 25 places in 148 ms of which 1 ms to minimize.
[2023-03-20 10:55:28] [INFO ] Deduced a trap composed of 52 places in 147 ms of which 0 ms to minimize.
[2023-03-20 10:55:28] [INFO ] Deduced a trap composed of 37 places in 168 ms of which 0 ms to minimize.
[2023-03-20 10:55:28] [INFO ] Deduced a trap composed of 29 places in 137 ms of which 0 ms to minimize.
[2023-03-20 10:55:28] [INFO ] Deduced a trap composed of 42 places in 126 ms of which 0 ms to minimize.
[2023-03-20 10:55:29] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 1 ms to minimize.
[2023-03-20 10:55:29] [INFO ] Deduced a trap composed of 36 places in 108 ms of which 2 ms to minimize.
[2023-03-20 10:55:29] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 4976 ms
[2023-03-20 10:55:29] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 0 ms to minimize.
[2023-03-20 10:55:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 171 ms
[2023-03-20 10:55:29] [INFO ] After 5876ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 157 ms.
[2023-03-20 10:55:29] [INFO ] After 6308ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 224 ms.
Support contains 5 out of 1174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1174/1174 places, 1174/1174 transitions.
Drop transitions removed 327 transitions
Trivial Post-agglo rules discarded 327 transitions
Performed 327 trivial Post agglomeration. Transition count delta: 327
Iterating post reduction 0 with 327 rules applied. Total rules applied 327 place count 1174 transition count 847
Reduce places removed 327 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 328 rules applied. Total rules applied 655 place count 847 transition count 846
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 656 place count 846 transition count 846
Performed 238 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 238 Pre rules applied. Total rules applied 656 place count 846 transition count 608
Deduced a syphon composed of 238 places in 1 ms
Reduce places removed 238 places and 0 transitions.
Iterating global reduction 3 with 476 rules applied. Total rules applied 1132 place count 608 transition count 608
Performed 268 Post agglomeration using F-continuation condition.Transition count delta: 268
Deduced a syphon composed of 268 places in 0 ms
Reduce places removed 268 places and 0 transitions.
Iterating global reduction 3 with 536 rules applied. Total rules applied 1668 place count 340 transition count 340
Renaming transitions due to excessive name length > 1024 char.
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: -90
Deduced a syphon composed of 90 places in 0 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 1848 place count 250 transition count 430
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1849 place count 250 transition count 429
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1850 place count 249 transition count 428
Applied a total of 1850 rules in 54 ms. Remains 249 /1174 variables (removed 925) and now considering 428/1174 (removed 746) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 249/1174 places, 428/1174 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 5) seen :3
Finished Best-First random walk after 644 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=322 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0 p3), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p3) (NOT p1))))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p3) (NOT p2))), (F (AND (NOT p1) (NOT p3) (NOT p0))), (F (AND (NOT p3) (NOT p0))), (F (AND (NOT p1) (NOT p3) p2)), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND (NOT p1) p2)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 11 factoid took 470 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 173 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3))]
[2023-03-20 10:55:31] [INFO ] Invariant cache hit.
[2023-03-20 10:55:31] [INFO ] [Real]Absence check using 121 positive place invariants in 57 ms returned sat
[2023-03-20 10:55:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 10:55:33] [INFO ] [Real]Absence check using state equation in 1620 ms returned sat
[2023-03-20 10:55:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 10:55:33] [INFO ] [Nat]Absence check using 121 positive place invariants in 80 ms returned sat
[2023-03-20 10:55:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 10:55:36] [INFO ] [Nat]Absence check using state equation in 2320 ms returned sat
[2023-03-20 10:55:36] [INFO ] Computed and/alt/rep : 1173/1715/1173 causal constraints (skipped 0 transitions) in 117 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:605)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 10:55:48] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND (NOT p1) (NOT p2))
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 230 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 717 reset in 300 ms.
Product exploration explored 100000 steps with 740 reset in 327 ms.
Applying partial POR strategy [false, false, true, false, true]
Stuttering acceptance computed with spot in 217 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3))]
Support contains 5 out of 1174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1174/1174 places, 1174/1174 transitions.
Performed 328 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 328 rules applied. Total rules applied 328 place count 1174 transition count 1174
Performed 119 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 119 Pre rules applied. Total rules applied 328 place count 1174 transition count 1294
Deduced a syphon composed of 447 places in 1 ms
Iterating global reduction 1 with 119 rules applied. Total rules applied 447 place count 1174 transition count 1294
Performed 358 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 805 places in 1 ms
Iterating global reduction 1 with 358 rules applied. Total rules applied 805 place count 1174 transition count 1295
Renaming transitions due to excessive name length > 1024 char.
Discarding 239 places :
Symmetric choice reduction at 1 with 239 rule applications. Total rules 1044 place count 935 transition count 1055
Deduced a syphon composed of 566 places in 1 ms
Iterating global reduction 1 with 239 rules applied. Total rules applied 1283 place count 935 transition count 1055
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -732
Deduced a syphon composed of 667 places in 0 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 1384 place count 935 transition count 1787
Discarding 101 places :
Symmetric choice reduction at 1 with 101 rule applications. Total rules 1485 place count 834 transition count 1585
Deduced a syphon composed of 566 places in 1 ms
Iterating global reduction 1 with 101 rules applied. Total rules applied 1586 place count 834 transition count 1585
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -136
Deduced a syphon composed of 584 places in 0 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 1604 place count 834 transition count 1721
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 1622 place count 816 transition count 1685
Deduced a syphon composed of 566 places in 0 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 1640 place count 816 transition count 1685
Deduced a syphon composed of 566 places in 0 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 1643 place count 816 transition count 1682
Deduced a syphon composed of 566 places in 1 ms
Applied a total of 1643 rules in 349 ms. Remains 816 /1174 variables (removed 358) and now considering 1682/1174 (removed -508) transitions.
[2023-03-20 10:55:49] [INFO ] Redundant transitions in 24 ms returned []
// Phase 1: matrix 1682 rows 816 cols
[2023-03-20 10:55:49] [INFO ] Computed 121 place invariants in 7 ms
[2023-03-20 10:55:50] [INFO ] Dead Transitions using invariants and state equation in 724 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 816/1174 places, 1682/1174 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1130 ms. Remains : 816/1174 places, 1682/1174 transitions.
Support contains 5 out of 1174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1174/1174 places, 1174/1174 transitions.
Applied a total of 0 rules in 24 ms. Remains 1174 /1174 variables (removed 0) and now considering 1174/1174 (removed 0) transitions.
// Phase 1: matrix 1174 rows 1174 cols
[2023-03-20 10:55:50] [INFO ] Computed 121 place invariants in 3 ms
[2023-03-20 10:55:50] [INFO ] Implicit Places using invariants in 238 ms returned []
[2023-03-20 10:55:50] [INFO ] Invariant cache hit.
[2023-03-20 10:55:51] [INFO ] Implicit Places using invariants and state equation in 708 ms returned []
Implicit Place search using SMT with State Equation took 969 ms to find 0 implicit places.
[2023-03-20 10:55:51] [INFO ] Invariant cache hit.
[2023-03-20 10:55:52] [INFO ] Dead Transitions using invariants and state equation in 528 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1523 ms. Remains : 1174/1174 places, 1174/1174 transitions.
Treatment of property ShieldRVt-PT-030B-LTLCardinality-09 finished in 64492 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)||X(F(p1)))))'
Support contains 3 out of 1182 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1182/1182 places, 1182/1182 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 328 transitions
Trivial Post-agglo rules discarded 328 transitions
Performed 328 trivial Post agglomeration. Transition count delta: 328
Iterating post reduction 0 with 328 rules applied. Total rules applied 328 place count 1181 transition count 853
Reduce places removed 328 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 330 rules applied. Total rules applied 658 place count 853 transition count 851
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 660 place count 852 transition count 850
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 661 place count 851 transition count 850
Performed 234 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 234 Pre rules applied. Total rules applied 661 place count 851 transition count 616
Deduced a syphon composed of 234 places in 1 ms
Reduce places removed 234 places and 0 transitions.
Iterating global reduction 4 with 468 rules applied. Total rules applied 1129 place count 617 transition count 616
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1137 place count 609 transition count 608
Iterating global reduction 4 with 8 rules applied. Total rules applied 1145 place count 609 transition count 608
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 1145 place count 609 transition count 601
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 1159 place count 602 transition count 601
Performed 266 Post agglomeration using F-continuation condition.Transition count delta: 266
Deduced a syphon composed of 266 places in 0 ms
Reduce places removed 266 places and 0 transitions.
Iterating global reduction 4 with 532 rules applied. Total rules applied 1691 place count 336 transition count 335
Renaming transitions due to excessive name length > 1024 char.
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -85
Deduced a syphon composed of 88 places in 0 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 4 with 176 rules applied. Total rules applied 1867 place count 248 transition count 420
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1869 place count 246 transition count 418
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1870 place count 245 transition count 418
Applied a total of 1870 rules in 62 ms. Remains 245 /1182 variables (removed 937) and now considering 418/1182 (removed 764) transitions.
// Phase 1: matrix 418 rows 245 cols
[2023-03-20 10:55:52] [INFO ] Computed 120 place invariants in 5 ms
[2023-03-20 10:55:52] [INFO ] Implicit Places using invariants in 164 ms returned []
[2023-03-20 10:55:52] [INFO ] Invariant cache hit.
[2023-03-20 10:55:52] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-20 10:55:52] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
[2023-03-20 10:55:52] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-20 10:55:52] [INFO ] Invariant cache hit.
[2023-03-20 10:55:52] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 245/1182 places, 418/1182 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 658 ms. Remains : 245/1182 places, 418/1182 transitions.
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-030B-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s124 1), p1:(OR (EQ s75 0) (EQ s49 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 3 steps with 1 reset in 0 ms.
FORMULA ShieldRVt-PT-030B-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLCardinality-10 finished in 754 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)))'
Support contains 2 out of 1182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1182/1182 places, 1182/1182 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1172 transition count 1172
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1172 transition count 1172
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1171 transition count 1171
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1171 transition count 1171
Applied a total of 22 rules in 77 ms. Remains 1171 /1182 variables (removed 11) and now considering 1171/1182 (removed 11) transitions.
// Phase 1: matrix 1171 rows 1171 cols
[2023-03-20 10:55:53] [INFO ] Computed 121 place invariants in 6 ms
[2023-03-20 10:55:53] [INFO ] Implicit Places using invariants in 265 ms returned []
[2023-03-20 10:55:53] [INFO ] Invariant cache hit.
[2023-03-20 10:55:54] [INFO ] Implicit Places using invariants and state equation in 702 ms returned []
Implicit Place search using SMT with State Equation took 980 ms to find 0 implicit places.
[2023-03-20 10:55:54] [INFO ] Invariant cache hit.
[2023-03-20 10:55:54] [INFO ] Dead Transitions using invariants and state equation in 506 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1171/1182 places, 1171/1182 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1577 ms. Remains : 1171/1182 places, 1171/1182 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s622 0) (EQ s1160 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 584 ms.
Product exploration explored 100000 steps with 50000 reset in 590 ms.
Computed a total of 358 stabilizing places and 358 stable transitions
Computed a total of 358 stabilizing places and 358 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-030B-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-030B-LTLCardinality-13 finished in 2920 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 1182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1182/1182 places, 1182/1182 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1173 transition count 1173
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1173 transition count 1173
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1172 transition count 1172
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1172 transition count 1172
Applied a total of 20 rules in 103 ms. Remains 1172 /1182 variables (removed 10) and now considering 1172/1182 (removed 10) transitions.
// Phase 1: matrix 1172 rows 1172 cols
[2023-03-20 10:55:55] [INFO ] Computed 121 place invariants in 8 ms
[2023-03-20 10:55:56] [INFO ] Implicit Places using invariants in 310 ms returned []
[2023-03-20 10:55:56] [INFO ] Invariant cache hit.
[2023-03-20 10:55:57] [INFO ] Implicit Places using invariants and state equation in 936 ms returned []
Implicit Place search using SMT with State Equation took 1262 ms to find 0 implicit places.
[2023-03-20 10:55:57] [INFO ] Invariant cache hit.
[2023-03-20 10:55:57] [INFO ] Dead Transitions using invariants and state equation in 523 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1172/1182 places, 1172/1182 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1901 ms. Remains : 1172/1182 places, 1172/1182 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030B-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s413 0)], 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 339 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-030B-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLCardinality-15 finished in 1999 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((G(p0) U p1))))'
Found a Lengthening insensitive property : ShieldRVt-PT-030B-LTLCardinality-01
Stuttering acceptance computed with spot in 138 ms :[(NOT p1), (NOT p1), true, (NOT p0), (NOT p1)]
Support contains 3 out of 1182 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1182/1182 places, 1182/1182 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 330 transitions
Trivial Post-agglo rules discarded 330 transitions
Performed 330 trivial Post agglomeration. Transition count delta: 330
Iterating post reduction 0 with 330 rules applied. Total rules applied 330 place count 1181 transition count 851
Reduce places removed 330 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 332 rules applied. Total rules applied 662 place count 851 transition count 849
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 664 place count 850 transition count 848
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 665 place count 849 transition count 848
Performed 233 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 233 Pre rules applied. Total rules applied 665 place count 849 transition count 615
Deduced a syphon composed of 233 places in 1 ms
Reduce places removed 233 places and 0 transitions.
Iterating global reduction 4 with 466 rules applied. Total rules applied 1131 place count 616 transition count 615
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1138 place count 609 transition count 608
Iterating global reduction 4 with 7 rules applied. Total rules applied 1145 place count 609 transition count 608
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 1145 place count 609 transition count 602
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 1157 place count 603 transition count 602
Performed 267 Post agglomeration using F-continuation condition.Transition count delta: 267
Deduced a syphon composed of 267 places in 0 ms
Reduce places removed 267 places and 0 transitions.
Iterating global reduction 4 with 534 rules applied. Total rules applied 1691 place count 336 transition count 335
Renaming transitions due to excessive name length > 1024 char.
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: -86
Deduced a syphon composed of 89 places in 0 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 4 with 178 rules applied. Total rules applied 1869 place count 247 transition count 421
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1871 place count 245 transition count 419
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1872 place count 244 transition count 419
Applied a total of 1872 rules in 96 ms. Remains 244 /1182 variables (removed 938) and now considering 419/1182 (removed 763) transitions.
// Phase 1: matrix 419 rows 244 cols
[2023-03-20 10:55:58] [INFO ] Computed 120 place invariants in 2 ms
[2023-03-20 10:55:58] [INFO ] Implicit Places using invariants in 189 ms returned []
[2023-03-20 10:55:58] [INFO ] Invariant cache hit.
[2023-03-20 10:55:58] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 453 ms to find 0 implicit places.
[2023-03-20 10:55:58] [INFO ] Invariant cache hit.
[2023-03-20 10:55:58] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 244/1182 places, 419/1182 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 739 ms. Remains : 244/1182 places, 419/1182 transitions.
Running random walk in product with property : ShieldRVt-PT-030B-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s149 1), p0:(OR (EQ s52 0) (EQ s119 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
Treatment of property ShieldRVt-PT-030B-LTLCardinality-01 finished in 955 ms.
FORMULA ShieldRVt-PT-030B-LTLCardinality-01 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(!((X(F(p0))&&p1) U !(X(G(p0))||p2)))'
Found a Lengthening insensitive property : ShieldRVt-PT-030B-LTLCardinality-03
Stuttering acceptance computed with spot in 177 ms :[true, (AND (NOT p0) (NOT p2)), false, false, (NOT p0), p0]
Support contains 6 out of 1182 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1182/1182 places, 1182/1182 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 327 transitions
Trivial Post-agglo rules discarded 327 transitions
Performed 327 trivial Post agglomeration. Transition count delta: 327
Iterating post reduction 0 with 327 rules applied. Total rules applied 327 place count 1181 transition count 854
Reduce places removed 327 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 329 rules applied. Total rules applied 656 place count 854 transition count 852
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 659 place count 853 transition count 850
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 661 place count 851 transition count 850
Performed 233 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 233 Pre rules applied. Total rules applied 661 place count 851 transition count 617
Deduced a syphon composed of 233 places in 1 ms
Reduce places removed 233 places and 0 transitions.
Iterating global reduction 4 with 466 rules applied. Total rules applied 1127 place count 618 transition count 617
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1134 place count 611 transition count 610
Iterating global reduction 4 with 7 rules applied. Total rules applied 1141 place count 611 transition count 610
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 1141 place count 611 transition count 604
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 1153 place count 605 transition count 604
Performed 266 Post agglomeration using F-continuation condition.Transition count delta: 266
Deduced a syphon composed of 266 places in 0 ms
Reduce places removed 266 places and 0 transitions.
Iterating global reduction 4 with 532 rules applied. Total rules applied 1685 place count 339 transition count 338
Renaming transitions due to excessive name length > 1024 char.
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: -84
Deduced a syphon composed of 87 places in 0 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 4 with 174 rules applied. Total rules applied 1859 place count 252 transition count 422
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1861 place count 250 transition count 420
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1862 place count 249 transition count 420
Applied a total of 1862 rules in 64 ms. Remains 249 /1182 variables (removed 933) and now considering 420/1182 (removed 762) transitions.
// Phase 1: matrix 420 rows 249 cols
[2023-03-20 10:55:59] [INFO ] Computed 120 place invariants in 2 ms
[2023-03-20 10:55:59] [INFO ] Implicit Places using invariants in 173 ms returned []
[2023-03-20 10:55:59] [INFO ] Invariant cache hit.
[2023-03-20 10:55:59] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-20 10:55:59] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 436 ms to find 0 implicit places.
[2023-03-20 10:55:59] [INFO ] Invariant cache hit.
[2023-03-20 10:55:59] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 249/1182 places, 420/1182 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 667 ms. Remains : 249/1182 places, 420/1182 transitions.
Running random walk in product with property : ShieldRVt-PT-030B-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 p2), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 4}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 0}, { cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=1, aps=[p1:(OR (EQ s116 0) (EQ s142 1)), p2:(OR (EQ s218 0) (EQ s194 1)), p0:(OR (EQ s14 0) (EQ s63 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, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22 reset in 377 ms.
Product exploration explored 100000 steps with 20 reset in 427 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (AND p1 p2)), (X (NOT (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) (NOT p0))))), true, (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 404 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[true, false, (NOT p0), p0, false, false]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-20 10:56:01] [INFO ] Invariant cache hit.
[2023-03-20 10:56:01] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 10:56:01] [INFO ] [Nat]Absence check using 120 positive place invariants in 16 ms returned sat
[2023-03-20 10:56:01] [INFO ] After 125ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 10:56:01] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-20 10:56:01] [INFO ] After 24ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-20 10:56:01] [INFO ] After 60ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-20 10:56:01] [INFO ] After 281ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 22 ms.
Support contains 4 out of 249 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 249/249 places, 420/420 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 249 transition count 418
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 248 transition count 418
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 2 with 2 rules applied. Total rules applied 5 place count 247 transition count 417
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 246 transition count 419
Applied a total of 7 rules in 14 ms. Remains 246 /249 variables (removed 3) and now considering 419/420 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 246/249 places, 419/420 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Finished probabilistic random walk after 8585 steps, run visited all 2 properties in 80 ms. (steps per millisecond=107 )
Probabilistic random walk after 8585 steps, saw 5416 distinct states, run finished after 80 ms. (steps per millisecond=107 ) properties seen :2
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (AND p1 p2)), (X (NOT (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) (NOT p0))))), true, (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p1 p2))), (F (AND (NOT p2) (NOT p0))), (F (AND (NOT p2) p0))]
Knowledge based reduction with 10 factoid took 459 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[true, false, (NOT p0), p0, false, false]
Stuttering acceptance computed with spot in 251 ms :[true, false, (NOT p0), p0, false, false]
Support contains 6 out of 249 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 249/249 places, 420/420 transitions.
Applied a total of 0 rules in 4 ms. Remains 249 /249 variables (removed 0) and now considering 420/420 (removed 0) transitions.
[2023-03-20 10:56:02] [INFO ] Invariant cache hit.
[2023-03-20 10:56:03] [INFO ] Implicit Places using invariants in 182 ms returned []
[2023-03-20 10:56:03] [INFO ] Invariant cache hit.
[2023-03-20 10:56:03] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-20 10:56:03] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
[2023-03-20 10:56:03] [INFO ] Invariant cache hit.
[2023-03-20 10:56:03] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 646 ms. Remains : 249/249 places, 420/420 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p1 p2)), (X (NOT (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p2) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 319 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[true, false, (NOT p0), p0, false, false]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-20 10:56:04] [INFO ] Invariant cache hit.
[2023-03-20 10:56:04] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 10:56:04] [INFO ] [Nat]Absence check using 120 positive place invariants in 17 ms returned sat
[2023-03-20 10:56:04] [INFO ] After 127ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 10:56:04] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-20 10:56:04] [INFO ] After 24ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-20 10:56:04] [INFO ] After 64ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-20 10:56:04] [INFO ] After 290ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 20 ms.
Support contains 4 out of 249 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 249/249 places, 420/420 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 249 transition count 418
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 248 transition count 418
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 2 with 2 rules applied. Total rules applied 5 place count 247 transition count 417
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 246 transition count 419
Applied a total of 7 rules in 12 ms. Remains 246 /249 variables (removed 3) and now considering 419/420 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 246/249 places, 419/420 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Finished probabilistic random walk after 8585 steps, run visited all 2 properties in 77 ms. (steps per millisecond=111 )
Probabilistic random walk after 8585 steps, saw 5416 distinct states, run finished after 77 ms. (steps per millisecond=111 ) properties seen :2
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p1 p2)), (X (NOT (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p2) p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p1 p2))), (F (AND (NOT p0) (NOT p2))), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 8 factoid took 459 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[true, false, (NOT p0), p0, false, false]
Stuttering acceptance computed with spot in 202 ms :[true, false, (NOT p0), p0, false, false]
Stuttering acceptance computed with spot in 226 ms :[true, false, (NOT p0), p0, false, false]
Product exploration explored 100000 steps with 17 reset in 470 ms.
Product exploration explored 100000 steps with 15 reset in 561 ms.
Applying partial POR strategy [true, false, true, true, false, true]
Stuttering acceptance computed with spot in 265 ms :[true, false, (NOT p0), p0, false, false]
Support contains 6 out of 249 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 249/249 places, 420/420 transitions.
Applied a total of 0 rules in 5 ms. Remains 249 /249 variables (removed 0) and now considering 420/420 (removed 0) transitions.
[2023-03-20 10:56:07] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 10:56:07] [INFO ] Invariant cache hit.
[2023-03-20 10:56:07] [INFO ] Dead Transitions using invariants and state equation in 224 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 240 ms. Remains : 249/249 places, 420/420 transitions.
Support contains 6 out of 249 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 249/249 places, 420/420 transitions.
Applied a total of 0 rules in 2 ms. Remains 249 /249 variables (removed 0) and now considering 420/420 (removed 0) transitions.
[2023-03-20 10:56:07] [INFO ] Invariant cache hit.
[2023-03-20 10:56:07] [INFO ] Implicit Places using invariants in 155 ms returned []
[2023-03-20 10:56:07] [INFO ] Invariant cache hit.
[2023-03-20 10:56:07] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-20 10:56:07] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
[2023-03-20 10:56:07] [INFO ] Invariant cache hit.
[2023-03-20 10:56:08] [INFO ] Dead Transitions using invariants and state equation in 183 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 650 ms. Remains : 249/249 places, 420/420 transitions.
Treatment of property ShieldRVt-PT-030B-LTLCardinality-03 finished in 9384 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U X(p1))||F((X(p3)&&p2))))'
[2023-03-20 10:56:08] [INFO ] Flatten gal took : 86 ms
[2023-03-20 10:56:08] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-20 10:56:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1182 places, 1182 transitions and 2904 arcs took 25 ms.
Total runtime 230844 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3301/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3301/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3301/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldRVt-PT-030B-LTLCardinality-01
Could not compute solution for formula : ShieldRVt-PT-030B-LTLCardinality-03
Could not compute solution for formula : ShieldRVt-PT-030B-LTLCardinality-09

BK_STOP 1679309770829

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name ShieldRVt-PT-030B-LTLCardinality-01
ltl formula formula --ltl=/tmp/3301/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 1182 places, 1182 transitions and 2904 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.350 real 0.050 user 0.060 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3301/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3301/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3301/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3301/ltl_0_
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
double free or corruption (fasttop)
ltl formula name ShieldRVt-PT-030B-LTLCardinality-03
ltl formula formula --ltl=/tmp/3301/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
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 1182 places, 1182 transitions and 2904 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3301/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3301/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3301/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.320 real 0.040 user 0.070 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3301/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

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

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="ShieldRVt-PT-030B"
export BK_EXAMINATION="LTLCardinality"
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 ShieldRVt-PT-030B, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r425-tajo-167905978000299"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-030B.tgz
mv ShieldRVt-PT-030B execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;