Execution Chart

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

Trace from the execution

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

--------------------
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 1679245740499

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-030B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 17:09:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 17:09:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 17:09:02] [INFO ] Load time of PNML (sax parser for PT used): 126 ms
[2023-03-19 17:09:02] [INFO ] Transformed 1503 places.
[2023-03-19 17:09:02] [INFO ] Transformed 1503 transitions.
[2023-03-19 17:09:02] [INFO ] Found NUPN structural information;
[2023-03-19 17:09:02] [INFO ] Parsed PT model containing 1503 places and 1503 transitions and 3546 arcs in 248 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 249 ms. Remains 1182 /1503 variables (removed 321) and now considering 1182/1503 (removed 321) transitions.
// Phase 1: matrix 1182 rows 1182 cols
[2023-03-19 17:09:03] [INFO ] Computed 121 place invariants in 38 ms
[2023-03-19 17:09:05] [INFO ] Implicit Places using invariants in 2046 ms returned []
[2023-03-19 17:09:05] [INFO ] Invariant cache hit.
[2023-03-19 17:09:06] [INFO ] Implicit Places using invariants and state equation in 1199 ms returned []
Implicit Place search using SMT with State Equation took 3275 ms to find 0 implicit places.
[2023-03-19 17:09:06] [INFO ] Invariant cache hit.
[2023-03-19 17:09:07] [INFO ] Dead Transitions using invariants and state equation in 995 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 4522 ms. Remains : 1182/1503 places, 1182/1503 transitions.
Support contains 23 out of 1182 places after structural reductions.
[2023-03-19 17:09:07] [INFO ] Flatten gal took : 169 ms
[2023-03-19 17:09:07] [INFO ] Flatten gal took : 77 ms
[2023-03-19 17:09:07] [INFO ] Input system was already deterministic with 1182 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 15) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) 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 17 ms. (steps per millisecond=588 ) properties (out of 6) 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 6) seen :0
Running SMT prover for 6 properties.
[2023-03-19 17:09:08] [INFO ] Invariant cache hit.
[2023-03-19 17:09:08] [INFO ] After 391ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-19 17:09:09] [INFO ] [Nat]Absence check using 121 positive place invariants in 82 ms returned sat
[2023-03-19 17:09:10] [INFO ] After 640ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-19 17:09:10] [INFO ] Deduced a trap composed of 20 places in 300 ms of which 5 ms to minimize.
[2023-03-19 17:09:10] [INFO ] Deduced a trap composed of 21 places in 240 ms of which 1 ms to minimize.
[2023-03-19 17:09:10] [INFO ] Deduced a trap composed of 32 places in 274 ms of which 1 ms to minimize.
[2023-03-19 17:09:11] [INFO ] Deduced a trap composed of 24 places in 298 ms of which 2 ms to minimize.
[2023-03-19 17:09:11] [INFO ] Deduced a trap composed of 29 places in 395 ms of which 1 ms to minimize.
[2023-03-19 17:09:12] [INFO ] Deduced a trap composed of 29 places in 252 ms of which 1 ms to minimize.
[2023-03-19 17:09:12] [INFO ] Deduced a trap composed of 39 places in 293 ms of which 1 ms to minimize.
[2023-03-19 17:09:12] [INFO ] Deduced a trap composed of 40 places in 248 ms of which 2 ms to minimize.
[2023-03-19 17:09:12] [INFO ] Deduced a trap composed of 21 places in 215 ms of which 1 ms to minimize.
[2023-03-19 17:09:13] [INFO ] Deduced a trap composed of 44 places in 255 ms of which 1 ms to minimize.
[2023-03-19 17:09:13] [INFO ] Deduced a trap composed of 28 places in 169 ms of which 1 ms to minimize.
[2023-03-19 17:09:13] [INFO ] Deduced a trap composed of 53 places in 226 ms of which 1 ms to minimize.
[2023-03-19 17:09:14] [INFO ] Deduced a trap composed of 46 places in 220 ms of which 1 ms to minimize.
[2023-03-19 17:09:14] [INFO ] Deduced a trap composed of 45 places in 184 ms of which 1 ms to minimize.
[2023-03-19 17:09:14] [INFO ] Deduced a trap composed of 39 places in 183 ms of which 1 ms to minimize.
[2023-03-19 17:09:14] [INFO ] Deduced a trap composed of 53 places in 199 ms of which 1 ms to minimize.
[2023-03-19 17:09:14] [INFO ] Deduced a trap composed of 45 places in 131 ms of which 1 ms to minimize.
[2023-03-19 17:09:15] [INFO ] Deduced a trap composed of 46 places in 115 ms of which 1 ms to minimize.
[2023-03-19 17:09:15] [INFO ] Deduced a trap composed of 47 places in 182 ms of which 1 ms to minimize.
[2023-03-19 17:09:15] [INFO ] Deduced a trap composed of 39 places in 179 ms of which 0 ms to minimize.
[2023-03-19 17:09:15] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 5535 ms
[2023-03-19 17:09:15] [INFO ] After 6525ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 187 ms.
[2023-03-19 17:09:16] [INFO ] After 7281ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 297 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 6 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 2 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 1 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 1 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 295 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 295 ms. Remains : 252/1182 places, 418/1182 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 6) seen :1
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 65 ms. (steps per millisecond=153 ) 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 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 418 rows 252 cols
[2023-03-19 17:09:17] [INFO ] Computed 120 place invariants in 3 ms
[2023-03-19 17:09:17] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-19 17:09:17] [INFO ] [Nat]Absence check using 120 positive place invariants in 12 ms returned sat
[2023-03-19 17:09:17] [INFO ] After 150ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-19 17:09:17] [INFO ] After 231ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-19 17:09:17] [INFO ] After 408ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 2 properties in 23 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.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 250 transition count 416
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 248 transition count 416
Applied a total of 8 rules in 18 ms. Remains 248 /252 variables (removed 4) and now considering 416/418 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 248/252 places, 416/418 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Finished probabilistic random walk after 108933 steps, run visited all 3 properties in 1051 ms. (steps per millisecond=103 )
Probabilistic random walk after 108933 steps, saw 75347 distinct states, run finished after 1052 ms. (steps per millisecond=103 ) 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 136 ms. Remains 1173 /1182 variables (removed 9) and now considering 1173/1182 (removed 9) transitions.
// Phase 1: matrix 1173 rows 1173 cols
[2023-03-19 17:09:19] [INFO ] Computed 121 place invariants in 7 ms
[2023-03-19 17:09:19] [INFO ] Implicit Places using invariants in 326 ms returned []
[2023-03-19 17:09:19] [INFO ] Invariant cache hit.
[2023-03-19 17:09:20] [INFO ] Implicit Places using invariants and state equation in 972 ms returned []
Implicit Place search using SMT with State Equation took 1315 ms to find 0 implicit places.
[2023-03-19 17:09:20] [INFO ] Invariant cache hit.
[2023-03-19 17:09:21] [INFO ] Dead Transitions using invariants and state equation in 565 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 2031 ms. Remains : 1173/1182 places, 1173/1182 transitions.
Stuttering acceptance computed with spot in 451 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 680 ms.
Product exploration explored 100000 steps with 2 reset in 690 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 599 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 271 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 304 ms. (steps per millisecond=32 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) 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 3) seen :0
Running SMT prover for 3 properties.
[2023-03-19 17:09:24] [INFO ] Invariant cache hit.
[2023-03-19 17:09:24] [INFO ] After 279ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 17:09:25] [INFO ] [Nat]Absence check using 121 positive place invariants in 64 ms returned sat
[2023-03-19 17:09:26] [INFO ] After 849ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 17:09:26] [INFO ] Deduced a trap composed of 26 places in 210 ms of which 1 ms to minimize.
[2023-03-19 17:09:26] [INFO ] Deduced a trap composed of 46 places in 253 ms of which 0 ms to minimize.
[2023-03-19 17:09:27] [INFO ] Deduced a trap composed of 39 places in 208 ms of which 1 ms to minimize.
[2023-03-19 17:09:27] [INFO ] Deduced a trap composed of 30 places in 198 ms of which 1 ms to minimize.
[2023-03-19 17:09:27] [INFO ] Deduced a trap composed of 38 places in 185 ms of which 0 ms to minimize.
[2023-03-19 17:09:27] [INFO ] Deduced a trap composed of 34 places in 188 ms of which 0 ms to minimize.
[2023-03-19 17:09:27] [INFO ] Deduced a trap composed of 34 places in 177 ms of which 1 ms to minimize.
[2023-03-19 17:09:28] [INFO ] Deduced a trap composed of 27 places in 188 ms of which 1 ms to minimize.
[2023-03-19 17:09:28] [INFO ] Deduced a trap composed of 34 places in 174 ms of which 0 ms to minimize.
[2023-03-19 17:09:28] [INFO ] Deduced a trap composed of 25 places in 199 ms of which 1 ms to minimize.
[2023-03-19 17:09:28] [INFO ] Deduced a trap composed of 44 places in 157 ms of which 0 ms to minimize.
[2023-03-19 17:09:29] [INFO ] Deduced a trap composed of 42 places in 224 ms of which 2 ms to minimize.
[2023-03-19 17:09:29] [INFO ] Deduced a trap composed of 36 places in 163 ms of which 5 ms to minimize.
[2023-03-19 17:09:29] [INFO ] Deduced a trap composed of 45 places in 169 ms of which 1 ms to minimize.
[2023-03-19 17:09:29] [INFO ] Deduced a trap composed of 38 places in 187 ms of which 0 ms to minimize.
[2023-03-19 17:09:30] [INFO ] Deduced a trap composed of 40 places in 189 ms of which 0 ms to minimize.
[2023-03-19 17:09:30] [INFO ] Deduced a trap composed of 39 places in 215 ms of which 1 ms to minimize.
[2023-03-19 17:09:30] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 4153 ms
[2023-03-19 17:09:30] [INFO ] Deduced a trap composed of 43 places in 254 ms of which 3 ms to minimize.
[2023-03-19 17:09:30] [INFO ] Deduced a trap composed of 31 places in 207 ms of which 0 ms to minimize.
[2023-03-19 17:09:31] [INFO ] Deduced a trap composed of 31 places in 210 ms of which 0 ms to minimize.
[2023-03-19 17:09:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 868 ms
[2023-03-19 17:09:31] [INFO ] After 6048ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 176 ms.
[2023-03-19 17:09:31] [INFO ] After 6720ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 125 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 3 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 1 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 163 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 163 ms. Remains : 244/1173 places, 418/1173 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 290 ms. (steps per millisecond=34 ) 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 96 ms. (steps per millisecond=104 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 199162 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 199162 steps, saw 131368 distinct states, run finished after 3004 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 418 rows 244 cols
[2023-03-19 17:09:35] [INFO ] Computed 120 place invariants in 1 ms
[2023-03-19 17:09:35] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 17:09:35] [INFO ] [Nat]Absence check using 120 positive place invariants in 15 ms returned sat
[2023-03-19 17:09:35] [INFO ] After 116ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 17:09:35] [INFO ] After 157ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-19 17:09:35] [INFO ] After 282ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 502 steps, including 25 resets, run visited all 3 properties in 6 ms. (steps per millisecond=83 )
Parikh walk visited 3 properties in 28 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 601 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 188 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), true, (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), true, (NOT p0), (NOT p1)]
// Phase 1: matrix 1173 rows 1173 cols
[2023-03-19 17:09:36] [INFO ] Computed 121 place invariants in 12 ms
[2023-03-19 17:09:37] [INFO ] [Real]Absence check using 121 positive place invariants in 147 ms returned sat
[2023-03-19 17:09:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 17:09:39] [INFO ] [Real]Absence check using state equation in 2003 ms returned sat
[2023-03-19 17:09:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 17:09:40] [INFO ] [Nat]Absence check using 121 positive place invariants in 117 ms returned sat
[2023-03-19 17:09:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 17:09:42] [INFO ] [Nat]Absence check using state equation in 2469 ms returned sat
[2023-03-19 17:09:43] [INFO ] Computed and/alt/rep : 1172/1713/1172 causal constraints (skipped 0 transitions) in 109 ms.
[2023-03-19 17:09:55] [INFO ] Deduced a trap composed of 16 places in 491 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: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-19 17:09:55] [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-19 17:09:55] [INFO ] Invariant cache hit.
[2023-03-19 17:09:55] [INFO ] Implicit Places using invariants in 330 ms returned []
[2023-03-19 17:09:55] [INFO ] Invariant cache hit.
[2023-03-19 17:09:56] [INFO ] Implicit Places using invariants and state equation in 936 ms returned []
Implicit Place search using SMT with State Equation took 1269 ms to find 0 implicit places.
[2023-03-19 17:09:56] [INFO ] Invariant cache hit.
[2023-03-19 17:09:57] [INFO ] Dead Transitions using invariants and state equation in 622 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1960 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 328 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 156 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 208 ms. (steps per millisecond=48 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) 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 4) seen :0
Interrupted probabilistic random walk after 207492 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :{}
Probabilistic random walk after 207492 steps, saw 94418 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-19 17:10:00] [INFO ] Invariant cache hit.
[2023-03-19 17:10:01] [INFO ] After 167ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 17:10:01] [INFO ] [Nat]Absence check using 121 positive place invariants in 28 ms returned sat
[2023-03-19 17:10:01] [INFO ] After 484ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 17:10:02] [INFO ] Deduced a trap composed of 28 places in 276 ms of which 0 ms to minimize.
[2023-03-19 17:10:02] [INFO ] Deduced a trap composed of 40 places in 238 ms of which 1 ms to minimize.
[2023-03-19 17:10:02] [INFO ] Deduced a trap composed of 26 places in 247 ms of which 1 ms to minimize.
[2023-03-19 17:10:03] [INFO ] Deduced a trap composed of 20 places in 254 ms of which 0 ms to minimize.
[2023-03-19 17:10:03] [INFO ] Deduced a trap composed of 39 places in 247 ms of which 1 ms to minimize.
[2023-03-19 17:10:03] [INFO ] Deduced a trap composed of 36 places in 275 ms of which 2 ms to minimize.
[2023-03-19 17:10:03] [INFO ] Deduced a trap composed of 39 places in 276 ms of which 1 ms to minimize.
[2023-03-19 17:10:04] [INFO ] Deduced a trap composed of 35 places in 239 ms of which 1 ms to minimize.
[2023-03-19 17:10:04] [INFO ] Deduced a trap composed of 25 places in 258 ms of which 1 ms to minimize.
[2023-03-19 17:10:04] [INFO ] Deduced a trap composed of 45 places in 238 ms of which 1 ms to minimize.
[2023-03-19 17:10:05] [INFO ] Deduced a trap composed of 34 places in 216 ms of which 0 ms to minimize.
[2023-03-19 17:10:05] [INFO ] Deduced a trap composed of 40 places in 215 ms of which 2 ms to minimize.
[2023-03-19 17:10:05] [INFO ] Deduced a trap composed of 50 places in 224 ms of which 1 ms to minimize.
[2023-03-19 17:10:05] [INFO ] Deduced a trap composed of 49 places in 209 ms of which 0 ms to minimize.
[2023-03-19 17:10:06] [INFO ] Deduced a trap composed of 38 places in 216 ms of which 0 ms to minimize.
[2023-03-19 17:10:06] [INFO ] Deduced a trap composed of 24 places in 199 ms of which 1 ms to minimize.
[2023-03-19 17:10:06] [INFO ] Deduced a trap composed of 23 places in 177 ms of which 1 ms to minimize.
[2023-03-19 17:10:06] [INFO ] Deduced a trap composed of 41 places in 203 ms of which 1 ms to minimize.
[2023-03-19 17:10:07] [INFO ] Deduced a trap composed of 38 places in 330 ms of which 2 ms to minimize.
[2023-03-19 17:10:07] [INFO ] Deduced a trap composed of 42 places in 245 ms of which 4 ms to minimize.
[2023-03-19 17:10:07] [INFO ] Deduced a trap composed of 57 places in 217 ms of which 0 ms to minimize.
[2023-03-19 17:10:08] [INFO ] Deduced a trap composed of 41 places in 217 ms of which 13 ms to minimize.
[2023-03-19 17:10:08] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 6401 ms
[2023-03-19 17:10:08] [INFO ] Deduced a trap composed of 48 places in 221 ms of which 2 ms to minimize.
[2023-03-19 17:10:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 322 ms
[2023-03-19 17:10:08] [INFO ] After 7646ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 208 ms.
[2023-03-19 17:10:09] [INFO ] After 8093ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 156 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 85 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 86 ms. Remains : 244/1173 places, 418/1173 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 418 rows 244 cols
[2023-03-19 17:10:09] [INFO ] Computed 120 place invariants in 2 ms
[2023-03-19 17:10:09] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 17:10:09] [INFO ] [Nat]Absence check using 120 positive place invariants in 15 ms returned sat
[2023-03-19 17:10:09] [INFO ] After 127ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 17:10:10] [INFO ] After 178ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 59 ms.
[2023-03-19 17:10:10] [INFO ] After 312ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 355 steps, including 17 resets, run visited all 3 properties in 11 ms. (steps per millisecond=32 )
Parikh walk visited 3 properties in 110 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 511 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 161 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), true, (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), true, (NOT p0), (NOT p1)]
// Phase 1: matrix 1173 rows 1173 cols
[2023-03-19 17:10:11] [INFO ] Computed 121 place invariants in 13 ms
[2023-03-19 17:10:11] [INFO ] [Real]Absence check using 121 positive place invariants in 81 ms returned sat
[2023-03-19 17:10:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 17:10:13] [INFO ] [Real]Absence check using state equation in 1975 ms returned sat
[2023-03-19 17:10:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 17:10:14] [INFO ] [Nat]Absence check using 121 positive place invariants in 64 ms returned sat
[2023-03-19 17:10:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 17:10:16] [INFO ] [Nat]Absence check using state equation in 2092 ms returned sat
[2023-03-19 17:10:16] [INFO ] Computed and/alt/rep : 1172/1713/1172 causal constraints (skipped 0 transitions) in 84 ms.
[2023-03-19 17:10:29] [INFO ] Deduced a trap composed of 16 places in 455 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: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-19 17:10:29] [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 190 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), true, (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 5 reset in 413 ms.
Product exploration explored 100000 steps with 2 reset in 458 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 182 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 0 ms
Applied a total of 1651 rules in 931 ms. Remains 813 /1173 variables (removed 360) and now considering 1655/1173 (removed -482) transitions.
[2023-03-19 17:10:31] [INFO ] Redundant transitions in 136 ms returned []
// Phase 1: matrix 1655 rows 813 cols
[2023-03-19 17:10:31] [INFO ] Computed 121 place invariants in 18 ms
[2023-03-19 17:10:32] [INFO ] Dead Transitions using invariants and state equation in 841 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 1920 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 38 ms. Remains 1173 /1173 variables (removed 0) and now considering 1173/1173 (removed 0) transitions.
// Phase 1: matrix 1173 rows 1173 cols
[2023-03-19 17:10:32] [INFO ] Computed 121 place invariants in 10 ms
[2023-03-19 17:10:32] [INFO ] Implicit Places using invariants in 319 ms returned []
[2023-03-19 17:10:32] [INFO ] Invariant cache hit.
[2023-03-19 17:10:33] [INFO ] Implicit Places using invariants and state equation in 850 ms returned []
Implicit Place search using SMT with State Equation took 1171 ms to find 0 implicit places.
[2023-03-19 17:10:33] [INFO ] Invariant cache hit.
[2023-03-19 17:10:34] [INFO ] Dead Transitions using invariants and state equation in 544 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1755 ms. Remains : 1173/1173 places, 1173/1173 transitions.
Treatment of property ShieldRVt-PT-030B-LTLCardinality-01 finished in 75066 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 92 ms. Remains 1173 /1182 variables (removed 9) and now considering 1173/1182 (removed 9) transitions.
// Phase 1: matrix 1173 rows 1173 cols
[2023-03-19 17:10:34] [INFO ] Computed 121 place invariants in 8 ms
[2023-03-19 17:10:34] [INFO ] Implicit Places using invariants in 313 ms returned []
[2023-03-19 17:10:34] [INFO ] Invariant cache hit.
[2023-03-19 17:10:35] [INFO ] Implicit Places using invariants and state equation in 862 ms returned []
Implicit Place search using SMT with State Equation took 1182 ms to find 0 implicit places.
[2023-03-19 17:10:35] [INFO ] Invariant cache hit.
[2023-03-19 17:10:36] [INFO ] Dead Transitions using invariants and state equation in 567 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 1848 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 1 reset in 465 ms.
Product exploration explored 100000 steps with 4 reset in 567 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 424 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 249 ms :[true, false, (NOT p0), p0, false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 164 ms. (steps per millisecond=60 ) 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 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-19 17:10:38] [INFO ] Invariant cache hit.
[2023-03-19 17:10:38] [INFO ] After 178ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 17:10:38] [INFO ] [Nat]Absence check using 121 positive place invariants in 37 ms returned sat
[2023-03-19 17:10:39] [INFO ] After 543ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 17:10:39] [INFO ] Deduced a trap composed of 22 places in 268 ms of which 1 ms to minimize.
[2023-03-19 17:10:39] [INFO ] Deduced a trap composed of 20 places in 227 ms of which 0 ms to minimize.
[2023-03-19 17:10:40] [INFO ] Deduced a trap composed of 30 places in 232 ms of which 1 ms to minimize.
[2023-03-19 17:10:40] [INFO ] Deduced a trap composed of 38 places in 217 ms of which 1 ms to minimize.
[2023-03-19 17:10:40] [INFO ] Deduced a trap composed of 40 places in 207 ms of which 0 ms to minimize.
[2023-03-19 17:10:40] [INFO ] Deduced a trap composed of 35 places in 190 ms of which 1 ms to minimize.
[2023-03-19 17:10:41] [INFO ] Deduced a trap composed of 23 places in 188 ms of which 1 ms to minimize.
[2023-03-19 17:10:41] [INFO ] Deduced a trap composed of 31 places in 190 ms of which 1 ms to minimize.
[2023-03-19 17:10:41] [INFO ] Deduced a trap composed of 44 places in 182 ms of which 1 ms to minimize.
[2023-03-19 17:10:41] [INFO ] Deduced a trap composed of 34 places in 205 ms of which 1 ms to minimize.
[2023-03-19 17:10:42] [INFO ] Deduced a trap composed of 36 places in 235 ms of which 1 ms to minimize.
[2023-03-19 17:10:42] [INFO ] Deduced a trap composed of 41 places in 169 ms of which 0 ms to minimize.
[2023-03-19 17:10:42] [INFO ] Deduced a trap composed of 24 places in 168 ms of which 1 ms to minimize.
[2023-03-19 17:10:42] [INFO ] Deduced a trap composed of 39 places in 170 ms of which 1 ms to minimize.
[2023-03-19 17:10:42] [INFO ] Deduced a trap composed of 43 places in 194 ms of which 0 ms to minimize.
[2023-03-19 17:10:43] [INFO ] Deduced a trap composed of 39 places in 180 ms of which 1 ms to minimize.
[2023-03-19 17:10:43] [INFO ] Deduced a trap composed of 32 places in 184 ms of which 1 ms to minimize.
[2023-03-19 17:10:43] [INFO ] Deduced a trap composed of 39 places in 166 ms of which 1 ms to minimize.
[2023-03-19 17:10:43] [INFO ] Deduced a trap composed of 50 places in 176 ms of which 1 ms to minimize.
[2023-03-19 17:10:44] [INFO ] Deduced a trap composed of 31 places in 211 ms of which 1 ms to minimize.
[2023-03-19 17:10:44] [INFO ] Deduced a trap composed of 49 places in 185 ms of which 0 ms to minimize.
[2023-03-19 17:10:44] [INFO ] Deduced a trap composed of 49 places in 175 ms of which 1 ms to minimize.
[2023-03-19 17:10:44] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 5272 ms
[2023-03-19 17:10:44] [INFO ] After 5917ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 81 ms.
[2023-03-19 17:10:44] [INFO ] After 6242ms 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 26 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 0 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 98 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 98 ms. Remains : 246/1173 places, 419/1173 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 90 ms. (steps per millisecond=111 ) 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 3 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Finished probabilistic random walk after 24181 steps, run visited all 2 properties in 207 ms. (steps per millisecond=116 )
Probabilistic random walk after 24181 steps, saw 15475 distinct states, run finished after 208 ms. (steps per millisecond=116 ) 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 525 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 218 ms :[true, false, (NOT p0), p0, false, false]
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 LTL mode, iteration 0 : 1173/1173 places, 1173/1173 transitions.
Applied a total of 0 rules in 33 ms. Remains 1173 /1173 variables (removed 0) and now considering 1173/1173 (removed 0) transitions.
[2023-03-19 17:10:46] [INFO ] Invariant cache hit.
[2023-03-19 17:10:46] [INFO ] Implicit Places using invariants in 369 ms returned []
[2023-03-19 17:10:46] [INFO ] Invariant cache hit.
[2023-03-19 17:10:47] [INFO ] Implicit Places using invariants and state equation in 878 ms returned []
Implicit Place search using SMT with State Equation took 1249 ms to find 0 implicit places.
[2023-03-19 17:10:47] [INFO ] Invariant cache hit.
[2023-03-19 17:10:48] [INFO ] Dead Transitions using invariants and state equation in 578 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1863 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 236 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 195 ms :[true, false, (NOT p0), p0, false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 4) seen :2
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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-19 17:10:48] [INFO ] Invariant cache hit.
[2023-03-19 17:10:48] [INFO ] After 201ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 17:10:49] [INFO ] [Nat]Absence check using 121 positive place invariants in 50 ms returned sat
[2023-03-19 17:10:49] [INFO ] After 533ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 17:10:50] [INFO ] Deduced a trap composed of 22 places in 291 ms of which 1 ms to minimize.
[2023-03-19 17:10:50] [INFO ] Deduced a trap composed of 20 places in 257 ms of which 1 ms to minimize.
[2023-03-19 17:10:50] [INFO ] Deduced a trap composed of 30 places in 270 ms of which 1 ms to minimize.
[2023-03-19 17:10:51] [INFO ] Deduced a trap composed of 38 places in 280 ms of which 1 ms to minimize.
[2023-03-19 17:10:51] [INFO ] Deduced a trap composed of 40 places in 268 ms of which 1 ms to minimize.
[2023-03-19 17:10:51] [INFO ] Deduced a trap composed of 35 places in 262 ms of which 1 ms to minimize.
[2023-03-19 17:10:52] [INFO ] Deduced a trap composed of 23 places in 242 ms of which 0 ms to minimize.
[2023-03-19 17:10:52] [INFO ] Deduced a trap composed of 31 places in 245 ms of which 1 ms to minimize.
[2023-03-19 17:10:52] [INFO ] Deduced a trap composed of 44 places in 241 ms of which 1 ms to minimize.
[2023-03-19 17:10:52] [INFO ] Deduced a trap composed of 34 places in 236 ms of which 1 ms to minimize.
[2023-03-19 17:10:53] [INFO ] Deduced a trap composed of 36 places in 242 ms of which 1 ms to minimize.
[2023-03-19 17:10:53] [INFO ] Deduced a trap composed of 41 places in 202 ms of which 0 ms to minimize.
[2023-03-19 17:10:53] [INFO ] Deduced a trap composed of 24 places in 224 ms of which 0 ms to minimize.
[2023-03-19 17:10:53] [INFO ] Deduced a trap composed of 39 places in 236 ms of which 0 ms to minimize.
[2023-03-19 17:10:54] [INFO ] Deduced a trap composed of 43 places in 229 ms of which 0 ms to minimize.
[2023-03-19 17:10:54] [INFO ] Deduced a trap composed of 39 places in 213 ms of which 1 ms to minimize.
[2023-03-19 17:10:54] [INFO ] Deduced a trap composed of 32 places in 197 ms of which 0 ms to minimize.
[2023-03-19 17:10:54] [INFO ] Deduced a trap composed of 39 places in 188 ms of which 1 ms to minimize.
[2023-03-19 17:10:55] [INFO ] Deduced a trap composed of 50 places in 179 ms of which 0 ms to minimize.
[2023-03-19 17:10:55] [INFO ] Deduced a trap composed of 31 places in 184 ms of which 0 ms to minimize.
[2023-03-19 17:10:55] [INFO ] Deduced a trap composed of 49 places in 188 ms of which 1 ms to minimize.
[2023-03-19 17:10:55] [INFO ] Deduced a trap composed of 49 places in 186 ms of which 0 ms to minimize.
[2023-03-19 17:10:55] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 6025 ms
[2023-03-19 17:10:55] [INFO ] After 6659ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 84 ms.
[2023-03-19 17:10:56] [INFO ] After 7033ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 41 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 85 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 86 ms. Remains : 246/1173 places, 419/1173 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Finished probabilistic random walk after 24181 steps, run visited all 2 properties in 245 ms. (steps per millisecond=98 )
Probabilistic random walk after 24181 steps, saw 15475 distinct states, run finished after 246 ms. (steps per millisecond=98 ) 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 551 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 254 ms :[true, false, (NOT p0), p0, false, false]
Stuttering acceptance computed with spot in 272 ms :[true, false, (NOT p0), p0, false, false]
Stuttering acceptance computed with spot in 289 ms :[true, false, (NOT p0), p0, false, false]
Product exploration explored 100000 steps with 1 reset in 462 ms.
Product exploration explored 100000 steps with 4 reset in 506 ms.
Applying partial POR strategy [true, false, true, true, false, true]
Stuttering acceptance computed with spot in 273 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 1 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 0 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 1 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 1 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 0 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 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 1638 place count 817 transition count 1654
Deduced a syphon composed of 566 places in 1 ms
Applied a total of 1638 rules in 410 ms. Remains 817 /1173 variables (removed 356) and now considering 1654/1173 (removed -481) transitions.
[2023-03-19 17:10:59] [INFO ] Redundant transitions in 36 ms returned []
// Phase 1: matrix 1654 rows 817 cols
[2023-03-19 17:10:59] [INFO ] Computed 121 place invariants in 8 ms
[2023-03-19 17:11:00] [INFO ] Dead Transitions using invariants and state equation in 730 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 1224 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 25 ms. Remains 1173 /1173 variables (removed 0) and now considering 1173/1173 (removed 0) transitions.
// Phase 1: matrix 1173 rows 1173 cols
[2023-03-19 17:11:00] [INFO ] Computed 121 place invariants in 4 ms
[2023-03-19 17:11:00] [INFO ] Implicit Places using invariants in 244 ms returned []
[2023-03-19 17:11:00] [INFO ] Invariant cache hit.
[2023-03-19 17:11:01] [INFO ] Implicit Places using invariants and state equation in 704 ms returned []
Implicit Place search using SMT with State Equation took 955 ms to find 0 implicit places.
[2023-03-19 17:11:01] [INFO ] Invariant cache hit.
[2023-03-19 17:11:02] [INFO ] Dead Transitions using invariants and state equation in 586 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1580 ms. Remains : 1173/1173 places, 1173/1173 transitions.
Treatment of property ShieldRVt-PT-030B-LTLCardinality-03 finished in 27826 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 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-19 17:11:02] [INFO ] Computed 121 place invariants in 5 ms
[2023-03-19 17:11:02] [INFO ] Implicit Places using invariants in 225 ms returned []
[2023-03-19 17:11:02] [INFO ] Invariant cache hit.
[2023-03-19 17:11:03] [INFO ] Implicit Places using invariants and state equation in 898 ms returned []
Implicit Place search using SMT with State Equation took 1137 ms to find 0 implicit places.
[2023-03-19 17:11:03] [INFO ] Invariant cache hit.
[2023-03-19 17:11:03] [INFO ] Dead Transitions using invariants and state equation in 486 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 1702 ms. Remains : 1173/1182 places, 1173/1182 transitions.
Stuttering acceptance computed with spot in 118 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 5 reset in 438 ms.
Product exploration explored 100000 steps with 4 reset in 542 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 376 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 177 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) 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 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 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 212049 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :{}
Probabilistic random walk after 212049 steps, saw 96186 distinct states, run finished after 3003 ms. (steps per millisecond=70 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-19 17:11:08] [INFO ] Invariant cache hit.
[2023-03-19 17:11:08] [INFO ] After 151ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 17:11:09] [INFO ] [Nat]Absence check using 121 positive place invariants in 34 ms returned sat
[2023-03-19 17:11:09] [INFO ] After 438ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 17:11:10] [INFO ] Deduced a trap composed of 32 places in 273 ms of which 1 ms to minimize.
[2023-03-19 17:11:10] [INFO ] Deduced a trap composed of 23 places in 263 ms of which 1 ms to minimize.
[2023-03-19 17:11:10] [INFO ] Deduced a trap composed of 31 places in 262 ms of which 1 ms to minimize.
[2023-03-19 17:11:10] [INFO ] Deduced a trap composed of 25 places in 254 ms of which 1 ms to minimize.
[2023-03-19 17:11:11] [INFO ] Deduced a trap composed of 22 places in 261 ms of which 1 ms to minimize.
[2023-03-19 17:11:11] [INFO ] Deduced a trap composed of 42 places in 272 ms of which 1 ms to minimize.
[2023-03-19 17:11:11] [INFO ] Deduced a trap composed of 36 places in 263 ms of which 1 ms to minimize.
[2023-03-19 17:11:12] [INFO ] Deduced a trap composed of 24 places in 253 ms of which 1 ms to minimize.
[2023-03-19 17:11:12] [INFO ] Deduced a trap composed of 39 places in 229 ms of which 1 ms to minimize.
[2023-03-19 17:11:12] [INFO ] Deduced a trap composed of 30 places in 208 ms of which 1 ms to minimize.
[2023-03-19 17:11:12] [INFO ] Deduced a trap composed of 55 places in 223 ms of which 1 ms to minimize.
[2023-03-19 17:11:13] [INFO ] Deduced a trap composed of 48 places in 204 ms of which 0 ms to minimize.
[2023-03-19 17:11:13] [INFO ] Deduced a trap composed of 29 places in 218 ms of which 0 ms to minimize.
[2023-03-19 17:11:13] [INFO ] Deduced a trap composed of 25 places in 206 ms of which 1 ms to minimize.
[2023-03-19 17:11:13] [INFO ] Deduced a trap composed of 38 places in 209 ms of which 1 ms to minimize.
[2023-03-19 17:11:14] [INFO ] Deduced a trap composed of 40 places in 216 ms of which 1 ms to minimize.
[2023-03-19 17:11:14] [INFO ] Deduced a trap composed of 46 places in 217 ms of which 0 ms to minimize.
[2023-03-19 17:11:14] [INFO ] Deduced a trap composed of 20 places in 203 ms of which 1 ms to minimize.
[2023-03-19 17:11:14] [INFO ] Deduced a trap composed of 46 places in 179 ms of which 1 ms to minimize.
[2023-03-19 17:11:15] [INFO ] Deduced a trap composed of 39 places in 194 ms of which 1 ms to minimize.
[2023-03-19 17:11:15] [INFO ] Deduced a trap composed of 44 places in 196 ms of which 0 ms to minimize.
[2023-03-19 17:11:15] [INFO ] Deduced a trap composed of 39 places in 190 ms of which 2 ms to minimize.
[2023-03-19 17:11:15] [INFO ] Deduced a trap composed of 33 places in 183 ms of which 1 ms to minimize.
[2023-03-19 17:11:15] [INFO ] Deduced a trap composed of 33 places in 165 ms of which 0 ms to minimize.
[2023-03-19 17:11:16] [INFO ] Deduced a trap composed of 35 places in 179 ms of which 1 ms to minimize.
[2023-03-19 17:11:16] [INFO ] Deduced a trap composed of 58 places in 204 ms of which 1 ms to minimize.
[2023-03-19 17:11:16] [INFO ] Deduced a trap composed of 40 places in 175 ms of which 1 ms to minimize.
[2023-03-19 17:11:16] [INFO ] Deduced a trap composed of 41 places in 195 ms of which 1 ms to minimize.
[2023-03-19 17:11:16] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 7220 ms
[2023-03-19 17:11:17] [INFO ] Deduced a trap composed of 27 places in 189 ms of which 0 ms to minimize.
[2023-03-19 17:11:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 270 ms
[2023-03-19 17:11:17] [INFO ] After 8044ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 164 ms.
[2023-03-19 17:11:17] [INFO ] After 8510ms 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 73 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 119 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 119 ms. Remains : 244/1173 places, 416/1173 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 240 ms. (steps per millisecond=41 ) 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 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 454672 steps, run timeout after 3001 ms. (steps per millisecond=151 ) properties seen :{0=1, 2=1}
Probabilistic random walk after 454672 steps, saw 295482 distinct states, run finished after 3001 ms. (steps per millisecond=151 ) properties seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 416 rows 244 cols
[2023-03-19 17:11:21] [INFO ] Computed 120 place invariants in 1 ms
[2023-03-19 17:11:21] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:11:21] [INFO ] [Nat]Absence check using 120 positive place invariants in 20 ms returned sat
[2023-03-19 17:11:21] [INFO ] After 112ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 17:11:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 17:11:21] [INFO ] After 13ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 17:11:21] [INFO ] After 40ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-19 17:11:21] [INFO ] After 230ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 780 steps, including 22 resets, run visited all 1 properties in 4 ms. (steps per millisecond=195 )
Parikh walk visited 1 properties in 3 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 482 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)]
Stuttering acceptance computed with spot in 217 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 50 ms. Remains 1173 /1173 variables (removed 0) and now considering 1173/1173 (removed 0) transitions.
// Phase 1: matrix 1173 rows 1173 cols
[2023-03-19 17:11:22] [INFO ] Computed 121 place invariants in 9 ms
[2023-03-19 17:11:22] [INFO ] Implicit Places using invariants in 338 ms returned []
[2023-03-19 17:11:22] [INFO ] Invariant cache hit.
[2023-03-19 17:11:23] [INFO ] Implicit Places using invariants and state equation in 833 ms returned []
Implicit Place search using SMT with State Equation took 1178 ms to find 0 implicit places.
[2023-03-19 17:11:23] [INFO ] Invariant cache hit.
[2023-03-19 17:11:23] [INFO ] Dead Transitions using invariants and state equation in 500 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1729 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 384 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 287 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 198 ms. (steps per millisecond=50 ) 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 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 215795 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :{}
Probabilistic random walk after 215795 steps, saw 97740 distinct states, run finished after 3001 ms. (steps per millisecond=71 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-19 17:11:27] [INFO ] Invariant cache hit.
[2023-03-19 17:11:28] [INFO ] After 150ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 17:11:28] [INFO ] [Nat]Absence check using 121 positive place invariants in 35 ms returned sat
[2023-03-19 17:11:28] [INFO ] After 536ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 17:11:29] [INFO ] Deduced a trap composed of 32 places in 275 ms of which 1 ms to minimize.
[2023-03-19 17:11:29] [INFO ] Deduced a trap composed of 23 places in 249 ms of which 1 ms to minimize.
[2023-03-19 17:11:29] [INFO ] Deduced a trap composed of 31 places in 255 ms of which 1 ms to minimize.
[2023-03-19 17:11:30] [INFO ] Deduced a trap composed of 25 places in 298 ms of which 1 ms to minimize.
[2023-03-19 17:11:30] [INFO ] Deduced a trap composed of 22 places in 282 ms of which 1 ms to minimize.
[2023-03-19 17:11:30] [INFO ] Deduced a trap composed of 42 places in 244 ms of which 1 ms to minimize.
[2023-03-19 17:11:31] [INFO ] Deduced a trap composed of 36 places in 262 ms of which 1 ms to minimize.
[2023-03-19 17:11:31] [INFO ] Deduced a trap composed of 24 places in 250 ms of which 0 ms to minimize.
[2023-03-19 17:11:31] [INFO ] Deduced a trap composed of 39 places in 245 ms of which 1 ms to minimize.
[2023-03-19 17:11:31] [INFO ] Deduced a trap composed of 30 places in 232 ms of which 1 ms to minimize.
[2023-03-19 17:11:32] [INFO ] Deduced a trap composed of 55 places in 237 ms of which 1 ms to minimize.
[2023-03-19 17:11:32] [INFO ] Deduced a trap composed of 48 places in 221 ms of which 1 ms to minimize.
[2023-03-19 17:11:32] [INFO ] Deduced a trap composed of 29 places in 195 ms of which 1 ms to minimize.
[2023-03-19 17:11:32] [INFO ] Deduced a trap composed of 25 places in 188 ms of which 0 ms to minimize.
[2023-03-19 17:11:33] [INFO ] Deduced a trap composed of 38 places in 199 ms of which 1 ms to minimize.
[2023-03-19 17:11:33] [INFO ] Deduced a trap composed of 40 places in 182 ms of which 0 ms to minimize.
[2023-03-19 17:11:33] [INFO ] Deduced a trap composed of 46 places in 210 ms of which 1 ms to minimize.
[2023-03-19 17:11:33] [INFO ] Deduced a trap composed of 20 places in 187 ms of which 1 ms to minimize.
[2023-03-19 17:11:34] [INFO ] Deduced a trap composed of 46 places in 196 ms of which 1 ms to minimize.
[2023-03-19 17:11:34] [INFO ] Deduced a trap composed of 39 places in 188 ms of which 1 ms to minimize.
[2023-03-19 17:11:34] [INFO ] Deduced a trap composed of 44 places in 185 ms of which 1 ms to minimize.
[2023-03-19 17:11:34] [INFO ] Deduced a trap composed of 39 places in 203 ms of which 1 ms to minimize.
[2023-03-19 17:11:35] [INFO ] Deduced a trap composed of 33 places in 206 ms of which 1 ms to minimize.
[2023-03-19 17:11:35] [INFO ] Deduced a trap composed of 33 places in 198 ms of which 1 ms to minimize.
[2023-03-19 17:11:35] [INFO ] Deduced a trap composed of 35 places in 175 ms of which 1 ms to minimize.
[2023-03-19 17:11:35] [INFO ] Deduced a trap composed of 58 places in 174 ms of which 0 ms to minimize.
[2023-03-19 17:11:35] [INFO ] Deduced a trap composed of 40 places in 186 ms of which 1 ms to minimize.
[2023-03-19 17:11:36] [INFO ] Deduced a trap composed of 41 places in 178 ms of which 0 ms to minimize.
[2023-03-19 17:11:36] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 7325 ms
[2023-03-19 17:11:36] [INFO ] Deduced a trap composed of 27 places in 173 ms of which 1 ms to minimize.
[2023-03-19 17:11:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 252 ms
[2023-03-19 17:11:36] [INFO ] After 8239ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 113 ms.
[2023-03-19 17:11:36] [INFO ] After 8638ms 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 89 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 0 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 86 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 86 ms. Remains : 244/1173 places, 416/1173 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 231 ms. (steps per millisecond=43 ) 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 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 488597 steps, run timeout after 3001 ms. (steps per millisecond=162 ) properties seen :{0=1, 2=1}
Probabilistic random walk after 488597 steps, saw 316005 distinct states, run finished after 3001 ms. (steps per millisecond=162 ) properties seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 416 rows 244 cols
[2023-03-19 17:11:40] [INFO ] Computed 120 place invariants in 3 ms
[2023-03-19 17:11:40] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:11:40] [INFO ] [Nat]Absence check using 120 positive place invariants in 20 ms returned sat
[2023-03-19 17:11:40] [INFO ] After 113ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 17:11:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 17:11:40] [INFO ] After 11ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 17:11:40] [INFO ] After 31ms 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-19 17:11:40] [INFO ] After 246ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 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 6 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 6 ms. Remains : 244/244 places, 416/416 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 657481 steps, run timeout after 3001 ms. (steps per millisecond=219 ) properties seen :{}
Probabilistic random walk after 657481 steps, saw 426245 distinct states, run finished after 3001 ms. (steps per millisecond=219 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 17:11:43] [INFO ] Invariant cache hit.
[2023-03-19 17:11:43] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:11:43] [INFO ] [Nat]Absence check using 120 positive place invariants in 17 ms returned sat
[2023-03-19 17:11:43] [INFO ] After 103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 17:11:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 17:11:43] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 17:11:44] [INFO ] After 26ms 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-19 17:11:44] [INFO ] After 212ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 368 steps, including 2 resets, run visited all 1 properties in 3 ms. (steps per millisecond=122 )
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 496 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 234 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 232 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 210 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1)]
Entered a terminal (fully accepting) state of product in 29572 steps with 0 reset in 160 ms.
FORMULA ShieldRVt-PT-030B-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLCardinality-05 finished in 43187 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 107 ms. Remains 1174 /1182 variables (removed 8) and now considering 1174/1182 (removed 8) transitions.
// Phase 1: matrix 1174 rows 1174 cols
[2023-03-19 17:11:45] [INFO ] Computed 121 place invariants in 7 ms
[2023-03-19 17:11:45] [INFO ] Implicit Places using invariants in 334 ms returned []
[2023-03-19 17:11:45] [INFO ] Invariant cache hit.
[2023-03-19 17:11:46] [INFO ] Implicit Places using invariants and state equation in 880 ms returned []
Implicit Place search using SMT with State Equation took 1217 ms to find 0 implicit places.
[2023-03-19 17:11:46] [INFO ] Invariant cache hit.
[2023-03-19 17:11:47] [INFO ] Dead Transitions using invariants and state equation in 535 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 1861 ms. Remains : 1174/1182 places, 1174/1182 transitions.
Stuttering acceptance computed with spot in 265 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 741 reset in 327 ms.
Product exploration explored 100000 steps with 740 reset in 345 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 976 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 277 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 267 ms. (steps per millisecond=37 ) properties (out of 12) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) 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 7) 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 7) 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 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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) 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
Running SMT prover for 7 properties.
[2023-03-19 17:11:49] [INFO ] Invariant cache hit.
[2023-03-19 17:11:50] [INFO ] After 210ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-19 17:11:50] [INFO ] [Nat]Absence check using 121 positive place invariants in 36 ms returned sat
[2023-03-19 17:11:51] [INFO ] After 573ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :3
[2023-03-19 17:11:51] [INFO ] Deduced a trap composed of 23 places in 256 ms of which 1 ms to minimize.
[2023-03-19 17:11:51] [INFO ] Deduced a trap composed of 30 places in 270 ms of which 0 ms to minimize.
[2023-03-19 17:11:51] [INFO ] Deduced a trap composed of 31 places in 240 ms of which 1 ms to minimize.
[2023-03-19 17:11:52] [INFO ] Deduced a trap composed of 33 places in 248 ms of which 1 ms to minimize.
[2023-03-19 17:11:52] [INFO ] Deduced a trap composed of 24 places in 214 ms of which 1 ms to minimize.
[2023-03-19 17:11:52] [INFO ] Deduced a trap composed of 29 places in 238 ms of which 0 ms to minimize.
[2023-03-19 17:11:52] [INFO ] Deduced a trap composed of 25 places in 238 ms of which 1 ms to minimize.
[2023-03-19 17:11:53] [INFO ] Deduced a trap composed of 24 places in 231 ms of which 1 ms to minimize.
[2023-03-19 17:11:53] [INFO ] Deduced a trap composed of 28 places in 245 ms of which 0 ms to minimize.
[2023-03-19 17:11:53] [INFO ] Deduced a trap composed of 39 places in 226 ms of which 1 ms to minimize.
[2023-03-19 17:11:54] [INFO ] Deduced a trap composed of 36 places in 221 ms of which 1 ms to minimize.
[2023-03-19 17:11:54] [INFO ] Deduced a trap composed of 48 places in 202 ms of which 1 ms to minimize.
[2023-03-19 17:11:54] [INFO ] Deduced a trap composed of 47 places in 208 ms of which 1 ms to minimize.
[2023-03-19 17:11:54] [INFO ] Deduced a trap composed of 29 places in 200 ms of which 0 ms to minimize.
[2023-03-19 17:11:55] [INFO ] Deduced a trap composed of 34 places in 204 ms of which 0 ms to minimize.
[2023-03-19 17:11:55] [INFO ] Deduced a trap composed of 30 places in 227 ms of which 0 ms to minimize.
[2023-03-19 17:11:55] [INFO ] Deduced a trap composed of 31 places in 229 ms of which 0 ms to minimize.
[2023-03-19 17:11:55] [INFO ] Deduced a trap composed of 41 places in 215 ms of which 1 ms to minimize.
[2023-03-19 17:11:56] [INFO ] Deduced a trap composed of 49 places in 189 ms of which 1 ms to minimize.
[2023-03-19 17:11:56] [INFO ] Deduced a trap composed of 31 places in 200 ms of which 2 ms to minimize.
[2023-03-19 17:11:56] [INFO ] Deduced a trap composed of 48 places in 180 ms of which 0 ms to minimize.
[2023-03-19 17:11:56] [INFO ] Deduced a trap composed of 49 places in 185 ms of which 1 ms to minimize.
[2023-03-19 17:11:56] [INFO ] Deduced a trap composed of 59 places in 202 ms of which 1 ms to minimize.
[2023-03-19 17:11:57] [INFO ] Deduced a trap composed of 45 places in 166 ms of which 1 ms to minimize.
[2023-03-19 17:11:57] [INFO ] Deduced a trap composed of 52 places in 168 ms of which 0 ms to minimize.
[2023-03-19 17:11:57] [INFO ] Deduced a trap composed of 50 places in 176 ms of which 0 ms to minimize.
[2023-03-19 17:11:57] [INFO ] Deduced a trap composed of 49 places in 154 ms of which 1 ms to minimize.
[2023-03-19 17:11:57] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 6854 ms
[2023-03-19 17:11:58] [INFO ] After 7608ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :3
Attempting to minimize the solution found.
Minimization took 117 ms.
[2023-03-19 17:11:58] [INFO ] After 8046ms 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 106 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 0 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 74 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 74 ms. Remains : 249/1174 places, 428/1174 transitions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 3) seen :1
Finished Best-First random walk after 3578 steps, including 1 resets, run visited all 2 properties in 14 ms. (steps per millisecond=255 )
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 1331 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 194 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 744 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-19 17:12:00] [INFO ] Invariant cache hit.
[2023-03-19 17:12:01] [INFO ] [Real]Absence check using 121 positive place invariants in 73 ms returned sat
[2023-03-19 17:12:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 17:12:02] [INFO ] [Real]Absence check using state equation in 1562 ms returned sat
[2023-03-19 17:12:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 17:12:03] [INFO ] [Nat]Absence check using 121 positive place invariants in 61 ms returned sat
[2023-03-19 17:12:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 17:12:05] [INFO ] [Nat]Absence check using state equation in 1812 ms returned sat
[2023-03-19 17:12:05] [INFO ] Computed and/alt/rep : 1173/1715/1173 causal constraints (skipped 0 transitions) in 66 ms.
[2023-03-19 17:12:17] [INFO ] Added : 760 causal constraints over 152 iterations in 12712 ms. Result :unknown
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 56 ms. Remains 1174 /1174 variables (removed 0) and now considering 1174/1174 (removed 0) transitions.
[2023-03-19 17:12:17] [INFO ] Invariant cache hit.
[2023-03-19 17:12:18] [INFO ] Implicit Places using invariants in 332 ms returned []
[2023-03-19 17:12:18] [INFO ] Invariant cache hit.
[2023-03-19 17:12:19] [INFO ] Implicit Places using invariants and state equation in 889 ms returned []
Implicit Place search using SMT with State Equation took 1222 ms to find 0 implicit places.
[2023-03-19 17:12:19] [INFO ] Invariant cache hit.
[2023-03-19 17:12:19] [INFO ] Dead Transitions using invariants and state equation in 532 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1812 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 360 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 248 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 239 ms. (steps per millisecond=41 ) properties (out of 7) seen :4
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 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 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-19 17:12:20] [INFO ] Invariant cache hit.
[2023-03-19 17:12:20] [INFO ] After 187ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 17:12:21] [INFO ] [Nat]Absence check using 121 positive place invariants in 35 ms returned sat
[2023-03-19 17:12:21] [INFO ] After 570ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 17:12:21] [INFO ] Deduced a trap composed of 30 places in 221 ms of which 1 ms to minimize.
[2023-03-19 17:12:22] [INFO ] Deduced a trap composed of 28 places in 216 ms of which 1 ms to minimize.
[2023-03-19 17:12:22] [INFO ] Deduced a trap composed of 35 places in 201 ms of which 0 ms to minimize.
[2023-03-19 17:12:22] [INFO ] Deduced a trap composed of 25 places in 199 ms of which 0 ms to minimize.
[2023-03-19 17:12:22] [INFO ] Deduced a trap composed of 26 places in 184 ms of which 1 ms to minimize.
[2023-03-19 17:12:23] [INFO ] Deduced a trap composed of 23 places in 175 ms of which 0 ms to minimize.
[2023-03-19 17:12:23] [INFO ] Deduced a trap composed of 23 places in 170 ms of which 1 ms to minimize.
[2023-03-19 17:12:23] [INFO ] Deduced a trap composed of 42 places in 182 ms of which 0 ms to minimize.
[2023-03-19 17:12:23] [INFO ] Deduced a trap composed of 42 places in 190 ms of which 1 ms to minimize.
[2023-03-19 17:12:23] [INFO ] Deduced a trap composed of 44 places in 145 ms of which 0 ms to minimize.
[2023-03-19 17:12:24] [INFO ] Deduced a trap composed of 50 places in 151 ms of which 1 ms to minimize.
[2023-03-19 17:12:24] [INFO ] Deduced a trap composed of 50 places in 167 ms of which 0 ms to minimize.
[2023-03-19 17:12:24] [INFO ] Deduced a trap composed of 33 places in 153 ms of which 0 ms to minimize.
[2023-03-19 17:12:24] [INFO ] Deduced a trap composed of 25 places in 157 ms of which 0 ms to minimize.
[2023-03-19 17:12:24] [INFO ] Deduced a trap composed of 37 places in 138 ms of which 1 ms to minimize.
[2023-03-19 17:12:25] [INFO ] Deduced a trap composed of 37 places in 150 ms of which 1 ms to minimize.
[2023-03-19 17:12:25] [INFO ] Deduced a trap composed of 42 places in 181 ms of which 0 ms to minimize.
[2023-03-19 17:12:25] [INFO ] Deduced a trap composed of 52 places in 158 ms of which 0 ms to minimize.
[2023-03-19 17:12:25] [INFO ] Deduced a trap composed of 33 places in 177 ms of which 0 ms to minimize.
[2023-03-19 17:12:25] [INFO ] Deduced a trap composed of 65 places in 175 ms of which 2 ms to minimize.
[2023-03-19 17:12:26] [INFO ] Deduced a trap composed of 40 places in 161 ms of which 1 ms to minimize.
[2023-03-19 17:12:26] [INFO ] Deduced a trap composed of 43 places in 158 ms of which 1 ms to minimize.
[2023-03-19 17:12:26] [INFO ] Deduced a trap composed of 45 places in 127 ms of which 0 ms to minimize.
[2023-03-19 17:12:26] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 4861 ms
[2023-03-19 17:12:26] [INFO ] After 5623ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 115 ms.
[2023-03-19 17:12:26] [INFO ] After 6001ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 117 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 1 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 54 ms. Remains : 249/1174 places, 428/1174 transitions.
Incomplete random walk after 10000 steps, including 9 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 3) seen :0
Finished Best-First random walk after 430 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=215 )
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 585 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 233 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 236 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-19 17:12:28] [INFO ] Invariant cache hit.
[2023-03-19 17:12:28] [INFO ] [Real]Absence check using 121 positive place invariants in 74 ms returned sat
[2023-03-19 17:12:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 17:12:30] [INFO ] [Real]Absence check using state equation in 1687 ms returned sat
[2023-03-19 17:12:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 17:12:30] [INFO ] [Nat]Absence check using 121 positive place invariants in 63 ms returned sat
[2023-03-19 17:12:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 17:12:32] [INFO ] [Nat]Absence check using state equation in 1836 ms returned sat
[2023-03-19 17:12:32] [INFO ] Computed and/alt/rep : 1173/1715/1173 causal constraints (skipped 0 transitions) in 69 ms.
[2023-03-19 17:12:46] [INFO ] Deduced a trap composed of 13 places in 529 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: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-19 17:12:46] [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 222 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 769 reset in 384 ms.
Product exploration explored 100000 steps with 741 reset in 403 ms.
Applying partial POR strategy [false, false, true, false, true]
Stuttering acceptance computed with spot in 202 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 2 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 1 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 1 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 0 ms
Applied a total of 1643 rules in 322 ms. Remains 816 /1174 variables (removed 358) and now considering 1682/1174 (removed -508) transitions.
[2023-03-19 17:12:47] [INFO ] Redundant transitions in 30 ms returned []
// Phase 1: matrix 1682 rows 816 cols
[2023-03-19 17:12:47] [INFO ] Computed 121 place invariants in 8 ms
[2023-03-19 17:12:48] [INFO ] Dead Transitions using invariants and state equation in 890 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 1267 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 30 ms. Remains 1174 /1174 variables (removed 0) and now considering 1174/1174 (removed 0) transitions.
// Phase 1: matrix 1174 rows 1174 cols
[2023-03-19 17:12:48] [INFO ] Computed 121 place invariants in 4 ms
[2023-03-19 17:12:48] [INFO ] Implicit Places using invariants in 249 ms returned []
[2023-03-19 17:12:48] [INFO ] Invariant cache hit.
[2023-03-19 17:12:49] [INFO ] Implicit Places using invariants and state equation in 805 ms returned []
Implicit Place search using SMT with State Equation took 1058 ms to find 0 implicit places.
[2023-03-19 17:12:49] [INFO ] Invariant cache hit.
[2023-03-19 17:12:50] [INFO ] Dead Transitions using invariants and state equation in 935 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2028 ms. Remains : 1174/1174 places, 1174/1174 transitions.
Treatment of property ShieldRVt-PT-030B-LTLCardinality-09 finished in 65306 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 125 ms. Remains 245 /1182 variables (removed 937) and now considering 418/1182 (removed 764) transitions.
// Phase 1: matrix 418 rows 245 cols
[2023-03-19 17:12:50] [INFO ] Computed 120 place invariants in 1 ms
[2023-03-19 17:12:51] [INFO ] Implicit Places using invariants in 218 ms returned []
[2023-03-19 17:12:51] [INFO ] Invariant cache hit.
[2023-03-19 17:12:51] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 17:12:51] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 563 ms to find 0 implicit places.
[2023-03-19 17:12:51] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-19 17:12:51] [INFO ] Invariant cache hit.
[2023-03-19 17:12:51] [INFO ] Dead Transitions using invariants and state equation in 200 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 897 ms. Remains : 245/1182 places, 418/1182 transitions.
Stuttering acceptance computed with spot in 65 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 4 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-030B-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLCardinality-10 finished in 1005 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 91 ms. Remains 1171 /1182 variables (removed 11) and now considering 1171/1182 (removed 11) transitions.
// Phase 1: matrix 1171 rows 1171 cols
[2023-03-19 17:12:51] [INFO ] Computed 121 place invariants in 9 ms
[2023-03-19 17:12:52] [INFO ] Implicit Places using invariants in 441 ms returned []
[2023-03-19 17:12:52] [INFO ] Invariant cache hit.
[2023-03-19 17:12:53] [INFO ] Implicit Places using invariants and state equation in 813 ms returned []
Implicit Place search using SMT with State Equation took 1271 ms to find 0 implicit places.
[2023-03-19 17:12:53] [INFO ] Invariant cache hit.
[2023-03-19 17:12:53] [INFO ] Dead Transitions using invariants and state equation in 548 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 1912 ms. Remains : 1171/1182 places, 1171/1182 transitions.
Stuttering acceptance computed with spot in 64 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 929 ms.
Product exploration explored 100000 steps with 50000 reset in 904 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 77 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 3909 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 116 ms. Remains 1172 /1182 variables (removed 10) and now considering 1172/1182 (removed 10) transitions.
// Phase 1: matrix 1172 rows 1172 cols
[2023-03-19 17:12:55] [INFO ] Computed 121 place invariants in 7 ms
[2023-03-19 17:12:56] [INFO ] Implicit Places using invariants in 327 ms returned []
[2023-03-19 17:12:56] [INFO ] Invariant cache hit.
[2023-03-19 17:12:56] [INFO ] Implicit Places using invariants and state equation in 897 ms returned []
Implicit Place search using SMT with State Equation took 1227 ms to find 0 implicit places.
[2023-03-19 17:12:56] [INFO ] Invariant cache hit.
[2023-03-19 17:12:57] [INFO ] Dead Transitions using invariants and state equation in 442 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 1786 ms. Remains : 1172/1182 places, 1172/1182 transitions.
Stuttering acceptance computed with spot in 73 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 329 steps with 0 reset in 2 ms.
FORMULA ShieldRVt-PT-030B-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030B-LTLCardinality-15 finished in 1874 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 209 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 103 ms. Remains 244 /1182 variables (removed 938) and now considering 419/1182 (removed 763) transitions.
// Phase 1: matrix 419 rows 244 cols
[2023-03-19 17:12:57] [INFO ] Computed 120 place invariants in 2 ms
[2023-03-19 17:12:58] [INFO ] Implicit Places using invariants in 185 ms returned []
[2023-03-19 17:12:58] [INFO ] Invariant cache hit.
[2023-03-19 17:12:58] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
[2023-03-19 17:12:58] [INFO ] Invariant cache hit.
[2023-03-19 17:12:58] [INFO ] Dead Transitions using invariants and state equation in 190 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 763 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 1083 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 258 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 1 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 1 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 120 ms. Remains 249 /1182 variables (removed 933) and now considering 420/1182 (removed 762) transitions.
// Phase 1: matrix 420 rows 249 cols
[2023-03-19 17:12:59] [INFO ] Computed 120 place invariants in 1 ms
[2023-03-19 17:12:59] [INFO ] Implicit Places using invariants in 218 ms returned []
[2023-03-19 17:12:59] [INFO ] Invariant cache hit.
[2023-03-19 17:12:59] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-19 17:12:59] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 527 ms to find 0 implicit places.
[2023-03-19 17:12:59] [INFO ] Invariant cache hit.
[2023-03-19 17:12:59] [INFO ] Dead Transitions using invariants and state equation in 213 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 862 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 23 reset in 515 ms.
Product exploration explored 100000 steps with 26 reset in 506 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 373 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 207 ms :[true, false, (NOT p0), p0, false, false]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-19 17:13:01] [INFO ] Invariant cache hit.
[2023-03-19 17:13:01] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 17:13:01] [INFO ] [Nat]Absence check using 120 positive place invariants in 19 ms returned sat
[2023-03-19 17:13:01] [INFO ] After 124ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 17:13:01] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-19 17:13:01] [INFO ] After 24ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 17:13:02] [INFO ] After 59ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-19 17:13:02] [INFO ] After 300ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 30 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 15 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 15 ms. Remains : 246/249 places, 419/420 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Finished probabilistic random walk after 8585 steps, run visited all 2 properties in 108 ms. (steps per millisecond=79 )
Probabilistic random walk after 8585 steps, saw 5416 distinct states, run finished after 108 ms. (steps per millisecond=79 ) 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 607 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 256 ms :[true, false, (NOT p0), p0, false, false]
Stuttering acceptance computed with spot in 287 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 8 ms. Remains 249 /249 variables (removed 0) and now considering 420/420 (removed 0) transitions.
[2023-03-19 17:13:03] [INFO ] Invariant cache hit.
[2023-03-19 17:13:03] [INFO ] Implicit Places using invariants in 192 ms returned []
[2023-03-19 17:13:03] [INFO ] Invariant cache hit.
[2023-03-19 17:13:03] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-19 17:13:04] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
[2023-03-19 17:13:04] [INFO ] Invariant cache hit.
[2023-03-19 17:13:04] [INFO ] Dead Transitions using invariants and state equation in 212 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 724 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 467 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 256 ms :[true, false, (NOT p0), p0, false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-19 17:13:05] [INFO ] Invariant cache hit.
[2023-03-19 17:13:05] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 17:13:05] [INFO ] [Nat]Absence check using 120 positive place invariants in 16 ms returned sat
[2023-03-19 17:13:05] [INFO ] After 132ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 17:13:05] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-19 17:13:05] [INFO ] After 25ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 17:13:05] [INFO ] After 62ms 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-19 17:13:05] [INFO ] After 297ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 28 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 16 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 16 ms. Remains : 246/249 places, 419/420 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Finished probabilistic random walk after 8585 steps, run visited all 2 properties in 100 ms. (steps per millisecond=85 )
Probabilistic random walk after 8585 steps, saw 5416 distinct states, run finished after 101 ms. (steps per millisecond=85 ) 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 493 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 260 ms :[true, false, (NOT p0), p0, false, false]
Stuttering acceptance computed with spot in 271 ms :[true, false, (NOT p0), p0, false, false]
Stuttering acceptance computed with spot in 213 ms :[true, false, (NOT p0), p0, false, false]
Product exploration explored 100000 steps with 25 reset in 510 ms.
Product exploration explored 100000 steps with 20 reset in 518 ms.
Applying partial POR strategy [true, false, true, true, false, true]
Stuttering acceptance computed with spot in 271 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 10 ms. Remains 249 /249 variables (removed 0) and now considering 420/420 (removed 0) transitions.
[2023-03-19 17:13:08] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-19 17:13:08] [INFO ] Invariant cache hit.
[2023-03-19 17:13:08] [INFO ] Dead Transitions using invariants and state equation in 226 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 254 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 5 ms. Remains 249 /249 variables (removed 0) and now considering 420/420 (removed 0) transitions.
[2023-03-19 17:13:08] [INFO ] Invariant cache hit.
[2023-03-19 17:13:09] [INFO ] Implicit Places using invariants in 170 ms returned []
[2023-03-19 17:13:09] [INFO ] Invariant cache hit.
[2023-03-19 17:13:09] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-19 17:13:09] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 485 ms to find 0 implicit places.
[2023-03-19 17:13:09] [INFO ] Invariant cache hit.
[2023-03-19 17:13:09] [INFO ] Dead Transitions using invariants and state equation in 208 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 698 ms. Remains : 249/249 places, 420/420 transitions.
Treatment of property ShieldRVt-PT-030B-LTLCardinality-03 finished in 11142 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-19 17:13:09] [INFO ] Flatten gal took : 70 ms
[2023-03-19 17:13:09] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-19 17:13:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1182 places, 1182 transitions and 2904 arcs took 12 ms.
Total runtime 247687 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldRVt-PT-030B
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/376
LTLCardinality

FORMULA ShieldRVt-PT-030B-LTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679246255912

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/376/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/376/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/376/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:430
lola: rewrite Frontend/Parser/formula_rewrite.k:317
lola: rewrite Frontend/Parser/formula_rewrite.k:334
lola: rewrite Frontend/Parser/formula_rewrite.k:328
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:337
lola: rewrite Frontend/Parser/formula_rewrite.k:314
lola: rewrite Frontend/Parser/formula_rewrite.k:334
lola: rewrite Frontend/Parser/formula_rewrite.k:331
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:314
lola: rewrite Frontend/Parser/formula_rewrite.k:334
lola: rewrite Frontend/Parser/formula_rewrite.k:331
lola: rewrite Frontend/Parser/formula_rewrite.k:299
lola: rewrite Frontend/Parser/formula_rewrite.k:299
lola: RELEASE
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 7 (type EXCL) for 6 ShieldRVt-PT-030B-LTLCardinality-09
lola: time limit : 1199 sec
lola: memory limit: 32 pages
lola: FINISHED task # 7 (type EXCL) for ShieldRVt-PT-030B-LTLCardinality-09
lola: result : false
lola: markings : 876
lola: fired transitions : 877
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 ShieldRVt-PT-030B-LTLCardinality-03
lola: time limit : 1799 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-030B-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-030B-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 4/1799 3/32 ShieldRVt-PT-030B-LTLCardinality-03 179429 m, 35885 m/sec, 608341 t fired, .

Time elapsed: 5 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-030B-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-030B-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 9/1799 5/32 ShieldRVt-PT-030B-LTLCardinality-03 352358 m, 34585 m/sec, 1271227 t fired, .

Time elapsed: 10 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-030B-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-030B-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 14/1799 7/32 ShieldRVt-PT-030B-LTLCardinality-03 532976 m, 36123 m/sec, 1987187 t fired, .

Time elapsed: 15 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-030B-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-030B-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 19/1799 9/32 ShieldRVt-PT-030B-LTLCardinality-03 701996 m, 33804 m/sec, 2680887 t fired, .

Time elapsed: 20 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-030B-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-030B-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 24/1799 11/32 ShieldRVt-PT-030B-LTLCardinality-03 857994 m, 31199 m/sec, 3334317 t fired, .

Time elapsed: 25 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-030B-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-030B-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 29/1799 13/32 ShieldRVt-PT-030B-LTLCardinality-03 1020388 m, 32478 m/sec, 3995115 t fired, .

Time elapsed: 30 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-030B-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-030B-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 34/1799 14/32 ShieldRVt-PT-030B-LTLCardinality-03 1168203 m, 29563 m/sec, 4618257 t fired, .

Time elapsed: 35 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-030B-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-030B-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 39/1799 16/32 ShieldRVt-PT-030B-LTLCardinality-03 1316852 m, 29729 m/sec, 5245179 t fired, .

Time elapsed: 40 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-030B-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-030B-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 44/1799 18/32 ShieldRVt-PT-030B-LTLCardinality-03 1469681 m, 30565 m/sec, 5900138 t fired, .

Time elapsed: 45 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-030B-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-030B-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 49/1799 20/32 ShieldRVt-PT-030B-LTLCardinality-03 1625127 m, 31089 m/sec, 6537315 t fired, .

Time elapsed: 50 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-030B-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-030B-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 54/1799 21/32 ShieldRVt-PT-030B-LTLCardinality-03 1776061 m, 30186 m/sec, 7178333 t fired, .

Time elapsed: 55 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-030B-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-030B-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 59/1799 23/32 ShieldRVt-PT-030B-LTLCardinality-03 1938213 m, 32430 m/sec, 7865009 t fired, .

Time elapsed: 60 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-030B-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-030B-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 64/1799 25/32 ShieldRVt-PT-030B-LTLCardinality-03 2082072 m, 28771 m/sec, 8482595 t fired, .

Time elapsed: 65 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-030B-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-030B-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 69/1799 27/32 ShieldRVt-PT-030B-LTLCardinality-03 2238533 m, 31292 m/sec, 9162511 t fired, .

Time elapsed: 70 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-030B-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-030B-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 74/1799 29/32 ShieldRVt-PT-030B-LTLCardinality-03 2382508 m, 28795 m/sec, 9779460 t fired, .

Time elapsed: 75 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-030B-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-030B-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 79/1799 31/32 ShieldRVt-PT-030B-LTLCardinality-03 2536437 m, 30785 m/sec, 10430991 t fired, .

Time elapsed: 80 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-030B-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-030B-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 84/1799 32/32 ShieldRVt-PT-030B-LTLCardinality-03 2673928 m, 27498 m/sec, 11029041 t fired, .

Time elapsed: 85 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 4 (type EXCL) for ShieldRVt-PT-030B-LTLCardinality-03 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-030B-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLCardinality-01: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-030B-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 90 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 1 (type EXCL) for 0 ShieldRVt-PT-030B-LTLCardinality-01
lola: time limit : 3510 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-030B-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-030B-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3510 3/32 ShieldRVt-PT-030B-LTLCardinality-01 161191 m, 32238 m/sec, 692619 t fired, .

Time elapsed: 95 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-030B-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-030B-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3510 4/32 ShieldRVt-PT-030B-LTLCardinality-01 301045 m, 27970 m/sec, 1428729 t fired, .

Time elapsed: 100 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-030B-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-030B-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3510 5/32 ShieldRVt-PT-030B-LTLCardinality-01 440960 m, 27983 m/sec, 2182792 t fired, .

Time elapsed: 105 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-030B-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-030B-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3510 6/32 ShieldRVt-PT-030B-LTLCardinality-01 571452 m, 26098 m/sec, 2915043 t fired, .

Time elapsed: 110 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-030B-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-030B-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3510 7/32 ShieldRVt-PT-030B-LTLCardinality-01 712708 m, 28251 m/sec, 3657626 t fired, .

Time elapsed: 115 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-030B-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-030B-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3510 8/32 ShieldRVt-PT-030B-LTLCardinality-01 851147 m, 27687 m/sec, 4434199 t fired, .

Time elapsed: 120 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-030B-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-030B-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3510 8/32 ShieldRVt-PT-030B-LTLCardinality-01 978735 m, 25517 m/sec, 5225782 t fired, .

Time elapsed: 125 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-030B-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-030B-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/3510 9/32 ShieldRVt-PT-030B-LTLCardinality-01 1101968 m, 24646 m/sec, 6019592 t fired, .

Time elapsed: 130 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-030B-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-030B-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/3510 10/32 ShieldRVt-PT-030B-LTLCardinality-01 1221312 m, 23868 m/sec, 6810710 t fired, .

Time elapsed: 135 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-030B-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-030B-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/3510 11/32 ShieldRVt-PT-030B-LTLCardinality-01 1359370 m, 27611 m/sec, 7598754 t fired, .

Time elapsed: 140 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-030B-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-030B-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 55/3510 13/32 ShieldRVt-PT-030B-LTLCardinality-01 1505688 m, 29263 m/sec, 8387367 t fired, .

Time elapsed: 145 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-030B-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-030B-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 60/3510 13/32 ShieldRVt-PT-030B-LTLCardinality-01 1630322 m, 24926 m/sec, 9178001 t fired, .

Time elapsed: 150 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-030B-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-030B-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 65/3510 14/32 ShieldRVt-PT-030B-LTLCardinality-01 1756428 m, 25221 m/sec, 9970356 t fired, .

Time elapsed: 155 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-030B-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-030B-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 70/3510 15/32 ShieldRVt-PT-030B-LTLCardinality-01 1873935 m, 23501 m/sec, 10761052 t fired, .

Time elapsed: 160 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-030B-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-030B-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 75/3510 16/32 ShieldRVt-PT-030B-LTLCardinality-01 1999062 m, 25025 m/sec, 11549352 t fired, .

Time elapsed: 165 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-030B-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-030B-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 80/3510 17/32 ShieldRVt-PT-030B-LTLCardinality-01 2127847 m, 25757 m/sec, 12342452 t fired, .

Time elapsed: 170 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-030B-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-030B-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 85/3510 18/32 ShieldRVt-PT-030B-LTLCardinality-01 2240138 m, 22458 m/sec, 13131937 t fired, .

Time elapsed: 175 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-030B-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-030B-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 90/3510 19/32 ShieldRVt-PT-030B-LTLCardinality-01 2351592 m, 22290 m/sec, 13923584 t fired, .

Time elapsed: 180 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-030B-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-030B-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 95/3510 19/32 ShieldRVt-PT-030B-LTLCardinality-01 2457275 m, 21136 m/sec, 14717896 t fired, .

Time elapsed: 185 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-030B-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-030B-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 100/3510 20/32 ShieldRVt-PT-030B-LTLCardinality-01 2562578 m, 21060 m/sec, 15508104 t fired, .

Time elapsed: 190 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-030B-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-030B-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 105/3510 21/32 ShieldRVt-PT-030B-LTLCardinality-01 2677476 m, 22979 m/sec, 16294370 t fired, .

Time elapsed: 195 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-030B-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-030B-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 110/3510 22/32 ShieldRVt-PT-030B-LTLCardinality-01 2826258 m, 29756 m/sec, 17085336 t fired, .

Time elapsed: 200 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-030B-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-030B-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 115/3510 23/32 ShieldRVt-PT-030B-LTLCardinality-01 2952076 m, 25163 m/sec, 17876776 t fired, .

Time elapsed: 205 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-030B-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-030B-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 120/3510 24/32 ShieldRVt-PT-030B-LTLCardinality-01 3081875 m, 25959 m/sec, 18667952 t fired, .

Time elapsed: 210 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-030B-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-030B-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 125/3510 25/32 ShieldRVt-PT-030B-LTLCardinality-01 3185443 m, 20713 m/sec, 19402354 t fired, .

Time elapsed: 215 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-030B-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-030B-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 130/3510 26/32 ShieldRVt-PT-030B-LTLCardinality-01 3312572 m, 25425 m/sec, 20174753 t fired, .

Time elapsed: 220 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-030B-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-030B-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 135/3510 26/32 ShieldRVt-PT-030B-LTLCardinality-01 3436858 m, 24857 m/sec, 20944878 t fired, .

Time elapsed: 225 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-030B-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-030B-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 140/3510 27/32 ShieldRVt-PT-030B-LTLCardinality-01 3552291 m, 23086 m/sec, 21737674 t fired, .

Time elapsed: 230 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-030B-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-030B-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 145/3510 28/32 ShieldRVt-PT-030B-LTLCardinality-01 3663978 m, 22337 m/sec, 22530443 t fired, .

Time elapsed: 235 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-030B-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-030B-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 150/3510 29/32 ShieldRVt-PT-030B-LTLCardinality-01 3771081 m, 21420 m/sec, 23326572 t fired, .

Time elapsed: 240 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-030B-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-030B-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 155/3510 30/32 ShieldRVt-PT-030B-LTLCardinality-01 3874717 m, 20727 m/sec, 24118345 t fired, .

Time elapsed: 245 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-030B-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-030B-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 160/3510 30/32 ShieldRVt-PT-030B-LTLCardinality-01 3982452 m, 21547 m/sec, 24904287 t fired, .

Time elapsed: 250 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-030B-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-030B-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 165/3510 31/32 ShieldRVt-PT-030B-LTLCardinality-01 4115571 m, 26623 m/sec, 25696909 t fired, .

Time elapsed: 255 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-030B-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLCardinality-01: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-030B-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 170/3510 32/32 ShieldRVt-PT-030B-LTLCardinality-01 4230661 m, 23018 m/sec, 26488389 t fired, .

Time elapsed: 260 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 1 (type EXCL) for ShieldRVt-PT-030B-LTLCardinality-01 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-030B-LTLCardinality-09: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-030B-LTLCardinality-01: LTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-030B-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 265 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: Portfolio finished: no open tasks 3

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-030B-LTLCardinality-01: LTL unknown AGGR
ShieldRVt-PT-030B-LTLCardinality-03: LTL unknown AGGR
ShieldRVt-PT-030B-LTLCardinality-09: LTL false LTL model checker


Time elapsed: 265 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVt-PT-030B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is 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 r423-tajo-167905976500299"
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 ;