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-167905976600315.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-040B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r423-tajo-167905976600315
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 952K
-rw-r--r-- 1 mcc users 9.3K Feb 25 23:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 25 23:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 23:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 23:10 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.7K Feb 25 17:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 12K Feb 25 23:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Feb 25 23:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 23:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 37K Feb 25 23:11 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 489K 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-040B-LTLCardinality-00
FORMULA_NAME ShieldRVt-PT-040B-LTLCardinality-01
FORMULA_NAME ShieldRVt-PT-040B-LTLCardinality-02
FORMULA_NAME ShieldRVt-PT-040B-LTLCardinality-03
FORMULA_NAME ShieldRVt-PT-040B-LTLCardinality-04
FORMULA_NAME ShieldRVt-PT-040B-LTLCardinality-05
FORMULA_NAME ShieldRVt-PT-040B-LTLCardinality-06
FORMULA_NAME ShieldRVt-PT-040B-LTLCardinality-07
FORMULA_NAME ShieldRVt-PT-040B-LTLCardinality-08
FORMULA_NAME ShieldRVt-PT-040B-LTLCardinality-09
FORMULA_NAME ShieldRVt-PT-040B-LTLCardinality-10
FORMULA_NAME ShieldRVt-PT-040B-LTLCardinality-11
FORMULA_NAME ShieldRVt-PT-040B-LTLCardinality-12
FORMULA_NAME ShieldRVt-PT-040B-LTLCardinality-13
FORMULA_NAME ShieldRVt-PT-040B-LTLCardinality-14
FORMULA_NAME ShieldRVt-PT-040B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679245929297

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-040B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 17:12:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 17:12:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 17:12:11] [INFO ] Load time of PNML (sax parser for PT used): 151 ms
[2023-03-19 17:12:11] [INFO ] Transformed 2003 places.
[2023-03-19 17:12:11] [INFO ] Transformed 2003 transitions.
[2023-03-19 17:12:11] [INFO ] Found NUPN structural information;
[2023-03-19 17:12:11] [INFO ] Parsed PT model containing 2003 places and 2003 transitions and 4726 arcs in 281 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-040B-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040B-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040B-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040B-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040B-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040B-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040B-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 2003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2003/2003 places, 2003/2003 transitions.
Discarding 428 places :
Symmetric choice reduction at 0 with 428 rule applications. Total rules 428 place count 1575 transition count 1575
Iterating global reduction 0 with 428 rules applied. Total rules applied 856 place count 1575 transition count 1575
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 857 place count 1574 transition count 1574
Iterating global reduction 0 with 1 rules applied. Total rules applied 858 place count 1574 transition count 1574
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 859 place count 1573 transition count 1573
Iterating global reduction 0 with 1 rules applied. Total rules applied 860 place count 1573 transition count 1573
Applied a total of 860 rules in 851 ms. Remains 1573 /2003 variables (removed 430) and now considering 1573/2003 (removed 430) transitions.
// Phase 1: matrix 1573 rows 1573 cols
[2023-03-19 17:12:12] [INFO ] Computed 161 place invariants in 36 ms
[2023-03-19 17:12:13] [INFO ] Implicit Places using invariants in 947 ms returned []
[2023-03-19 17:12:13] [INFO ] Invariant cache hit.
[2023-03-19 17:12:15] [INFO ] Implicit Places using invariants and state equation in 1489 ms returned []
Implicit Place search using SMT with State Equation took 2471 ms to find 0 implicit places.
[2023-03-19 17:12:15] [INFO ] Invariant cache hit.
[2023-03-19 17:12:15] [INFO ] Dead Transitions using invariants and state equation in 741 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1573/2003 places, 1573/2003 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4066 ms. Remains : 1573/2003 places, 1573/2003 transitions.
Support contains 33 out of 1573 places after structural reductions.
[2023-03-19 17:12:16] [INFO ] Flatten gal took : 160 ms
[2023-03-19 17:12:16] [INFO ] Flatten gal took : 54 ms
[2023-03-19 17:12:16] [INFO ] Input system was already deterministic with 1573 transitions.
Support contains 29 out of 1573 places (down from 33) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 635 ms. (steps per millisecond=15 ) properties (out of 16) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 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 31 ms. (steps per millisecond=322 ) 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 17 ms. (steps per millisecond=588 ) properties (out of 7) 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 7) 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 7) seen :0
Running SMT prover for 7 properties.
[2023-03-19 17:12:17] [INFO ] Invariant cache hit.
[2023-03-19 17:12:17] [INFO ] [Real]Absence check using 161 positive place invariants in 62 ms returned sat
[2023-03-19 17:12:17] [INFO ] After 415ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-19 17:12:18] [INFO ] [Nat]Absence check using 161 positive place invariants in 69 ms returned sat
[2023-03-19 17:12:19] [INFO ] After 906ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-19 17:12:19] [INFO ] Deduced a trap composed of 57 places in 256 ms of which 5 ms to minimize.
[2023-03-19 17:12:19] [INFO ] Deduced a trap composed of 33 places in 251 ms of which 1 ms to minimize.
[2023-03-19 17:12:20] [INFO ] Deduced a trap composed of 47 places in 293 ms of which 1 ms to minimize.
[2023-03-19 17:12:20] [INFO ] Deduced a trap composed of 51 places in 303 ms of which 1 ms to minimize.
[2023-03-19 17:12:20] [INFO ] Deduced a trap composed of 26 places in 415 ms of which 1 ms to minimize.
[2023-03-19 17:12:21] [INFO ] Deduced a trap composed of 26 places in 208 ms of which 1 ms to minimize.
[2023-03-19 17:12:21] [INFO ] Deduced a trap composed of 24 places in 386 ms of which 1 ms to minimize.
[2023-03-19 17:12:21] [INFO ] Deduced a trap composed of 46 places in 377 ms of which 1 ms to minimize.
[2023-03-19 17:12:22] [INFO ] Deduced a trap composed of 46 places in 313 ms of which 0 ms to minimize.
[2023-03-19 17:12:22] [INFO ] Deduced a trap composed of 38 places in 191 ms of which 1 ms to minimize.
[2023-03-19 17:12:22] [INFO ] Deduced a trap composed of 50 places in 183 ms of which 0 ms to minimize.
[2023-03-19 17:12:23] [INFO ] Deduced a trap composed of 46 places in 194 ms of which 0 ms to minimize.
[2023-03-19 17:12:23] [INFO ] Deduced a trap composed of 43 places in 167 ms of which 0 ms to minimize.
[2023-03-19 17:12:23] [INFO ] Deduced a trap composed of 59 places in 197 ms of which 0 ms to minimize.
[2023-03-19 17:12:23] [INFO ] Deduced a trap composed of 45 places in 211 ms of which 1 ms to minimize.
[2023-03-19 17:12:24] [INFO ] Deduced a trap composed of 38 places in 226 ms of which 2 ms to minimize.
[2023-03-19 17:12:24] [INFO ] Deduced a trap composed of 60 places in 210 ms of which 1 ms to minimize.
[2023-03-19 17:12:24] [INFO ] Deduced a trap composed of 46 places in 193 ms of which 1 ms to minimize.
[2023-03-19 17:12:24] [INFO ] Deduced a trap composed of 48 places in 180 ms of which 1 ms to minimize.
[2023-03-19 17:12:24] [INFO ] Deduced a trap composed of 48 places in 202 ms of which 1 ms to minimize.
[2023-03-19 17:12:25] [INFO ] Deduced a trap composed of 64 places in 182 ms of which 0 ms to minimize.
[2023-03-19 17:12:25] [INFO ] Deduced a trap composed of 60 places in 126 ms of which 1 ms to minimize.
[2023-03-19 17:12:25] [INFO ] Deduced a trap composed of 56 places in 168 ms of which 1 ms to minimize.
[2023-03-19 17:12:25] [INFO ] Deduced a trap composed of 65 places in 209 ms of which 1 ms to minimize.
[2023-03-19 17:12:26] [INFO ] Deduced a trap composed of 65 places in 178 ms of which 1 ms to minimize.
[2023-03-19 17:12:26] [INFO ] Deduced a trap composed of 57 places in 257 ms of which 1 ms to minimize.
[2023-03-19 17:12:26] [INFO ] Deduced a trap composed of 66 places in 202 ms of which 1 ms to minimize.
[2023-03-19 17:12:26] [INFO ] Deduced a trap composed of 58 places in 209 ms of which 1 ms to minimize.
[2023-03-19 17:12:26] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 7884 ms
[2023-03-19 17:12:27] [INFO ] After 9357ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 739 ms.
[2023-03-19 17:12:28] [INFO ] After 10665ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 241 ms.
Support contains 14 out of 1573 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1573/1573 places, 1573/1573 transitions.
Drop transitions removed 428 transitions
Trivial Post-agglo rules discarded 428 transitions
Performed 428 trivial Post agglomeration. Transition count delta: 428
Iterating post reduction 0 with 428 rules applied. Total rules applied 428 place count 1573 transition count 1145
Reduce places removed 428 places and 0 transitions.
Iterating post reduction 1 with 428 rules applied. Total rules applied 856 place count 1145 transition count 1145
Performed 313 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 313 Pre rules applied. Total rules applied 856 place count 1145 transition count 832
Deduced a syphon composed of 313 places in 2 ms
Reduce places removed 313 places and 0 transitions.
Iterating global reduction 2 with 626 rules applied. Total rules applied 1482 place count 832 transition count 832
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 1486 place count 828 transition count 828
Iterating global reduction 2 with 4 rules applied. Total rules applied 1490 place count 828 transition count 828
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 1490 place count 828 transition count 824
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 1498 place count 824 transition count 824
Performed 363 Post agglomeration using F-continuation condition.Transition count delta: 363
Deduced a syphon composed of 363 places in 1 ms
Reduce places removed 363 places and 0 transitions.
Iterating global reduction 2 with 726 rules applied. Total rules applied 2224 place count 461 transition count 461
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2225 place count 461 transition count 460
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 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2227 place count 460 transition count 459
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -93
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 2429 place count 359 transition count 552
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 2459 place count 344 transition count 567
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2460 place count 344 transition count 566
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2462 place count 344 transition count 564
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2464 place count 342 transition count 564
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 2466 place count 342 transition count 562
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 2467 place count 342 transition count 562
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2468 place count 341 transition count 561
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2469 place count 340 transition count 561
Applied a total of 2469 rules in 513 ms. Remains 340 /1573 variables (removed 1233) and now considering 561/1573 (removed 1012) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 513 ms. Remains : 340/1573 places, 561/1573 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 162205 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :{5=1}
Probabilistic random walk after 162205 steps, saw 104744 distinct states, run finished after 3001 ms. (steps per millisecond=54 ) properties seen :1
Running SMT prover for 6 properties.
// Phase 1: matrix 561 rows 340 cols
[2023-03-19 17:12:32] [INFO ] Computed 160 place invariants in 3 ms
[2023-03-19 17:12:32] [INFO ] [Real]Absence check using 160 positive place invariants in 16 ms returned sat
[2023-03-19 17:12:32] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-19 17:12:32] [INFO ] [Nat]Absence check using 160 positive place invariants in 17 ms returned sat
[2023-03-19 17:12:33] [INFO ] After 195ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-19 17:12:33] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-19 17:12:33] [INFO ] After 79ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-19 17:12:33] [INFO ] After 204ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 72 ms.
[2023-03-19 17:12:33] [INFO ] After 575ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 92 ms.
Support contains 12 out of 340 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 340/340 places, 561/561 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 340 transition count 560
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 339 transition count 560
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 338 transition count 560
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 337 transition count 559
Applied a total of 5 rules in 53 ms. Remains 337 /340 variables (removed 3) and now considering 559/561 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 337/340 places, 559/561 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 403 ms. (steps per millisecond=24 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 143555 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :{}
Probabilistic random walk after 143555 steps, saw 92024 distinct states, run finished after 3002 ms. (steps per millisecond=47 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 559 rows 337 cols
[2023-03-19 17:12:37] [INFO ] Computed 160 place invariants in 1 ms
[2023-03-19 17:12:37] [INFO ] [Real]Absence check using 160 positive place invariants in 31 ms returned sat
[2023-03-19 17:12:37] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-19 17:12:37] [INFO ] [Nat]Absence check using 160 positive place invariants in 18 ms returned sat
[2023-03-19 17:12:37] [INFO ] After 217ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-19 17:12:37] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-19 17:12:37] [INFO ] After 87ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-19 17:12:37] [INFO ] After 219ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 85 ms.
[2023-03-19 17:12:37] [INFO ] After 657ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 170 ms.
Support contains 12 out of 337 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 337/337 places, 559/559 transitions.
Applied a total of 0 rules in 15 ms. Remains 337 /337 variables (removed 0) and now considering 559/559 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 337/337 places, 559/559 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 337/337 places, 559/559 transitions.
Applied a total of 0 rules in 9 ms. Remains 337 /337 variables (removed 0) and now considering 559/559 (removed 0) transitions.
[2023-03-19 17:12:38] [INFO ] Invariant cache hit.
[2023-03-19 17:12:38] [INFO ] Implicit Places using invariants in 216 ms returned []
[2023-03-19 17:12:38] [INFO ] Invariant cache hit.
[2023-03-19 17:12:38] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-19 17:12:38] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 618 ms to find 0 implicit places.
[2023-03-19 17:12:38] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-19 17:12:38] [INFO ] Invariant cache hit.
[2023-03-19 17:12:38] [INFO ] Dead Transitions using invariants and state equation in 213 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 873 ms. Remains : 337/337 places, 559/559 transitions.
Graph (trivial) has 150 edges and 337 vertex of which 4 / 337 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1126 edges and 335 vertex of which 333 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 147 edges and 331 vertex of which 4 / 331 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 329 transition count 550
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 146 edges and 327 vertex of which 6 / 327 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 324 transition count 541
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 143 edges and 322 vertex of which 6 / 322 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 2 with 14 rules applied. Total rules applied 34 place count 319 transition count 530
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 141 edges and 316 vertex of which 8 / 316 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 15 rules applied. Total rules applied 49 place count 312 transition count 519
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (complete) has 1022 edges and 308 vertex of which 305 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Graph (trivial) has 136 edges and 305 vertex of which 8 / 305 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 20 rules applied. Total rules applied 69 place count 301 transition count 502
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 132 edges and 297 vertex of which 6 / 297 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 88 place count 294 transition count 488
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 128 edges and 291 vertex of which 4 / 291 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 6 with 13 rules applied. Total rules applied 101 place count 289 transition count 479
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 125 edges and 287 vertex of which 2 / 287 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 7 with 9 rules applied. Total rules applied 110 place count 286 transition count 473
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 113 place count 286 transition count 470
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 117 place count 286 transition count 466
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 117 place count 286 transition count 465
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 3 rules applied. Total rules applied 120 place count 284 transition count 465
Applied a total of 120 rules in 58 ms. Remains 284 /337 variables (removed 53) and now considering 465/559 (removed 94) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 465 rows 284 cols
[2023-03-19 17:12:39] [INFO ] Computed 134 place invariants in 2 ms
[2023-03-19 17:12:39] [INFO ] [Real]Absence check using 134 positive place invariants in 12 ms returned sat
[2023-03-19 17:12:39] [INFO ] After 193ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-19 17:12:39] [INFO ] [Nat]Absence check using 134 positive place invariants in 12 ms returned sat
[2023-03-19 17:12:39] [INFO ] After 140ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-19 17:12:39] [INFO ] After 236ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 64 ms.
[2023-03-19 17:12:39] [INFO ] After 388ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Computed a total of 480 stabilizing places and 480 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' '!(G((X(p0)&&(G(p1)||G(p2)))))'
Support contains 8 out of 1573 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1573/1573 places, 1573/1573 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1564 transition count 1564
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1564 transition count 1564
Applied a total of 18 rules in 130 ms. Remains 1564 /1573 variables (removed 9) and now considering 1564/1573 (removed 9) transitions.
// Phase 1: matrix 1564 rows 1564 cols
[2023-03-19 17:12:39] [INFO ] Computed 161 place invariants in 6 ms
[2023-03-19 17:12:40] [INFO ] Implicit Places using invariants in 360 ms returned []
[2023-03-19 17:12:40] [INFO ] Invariant cache hit.
[2023-03-19 17:12:41] [INFO ] Implicit Places using invariants and state equation in 961 ms returned []
Implicit Place search using SMT with State Equation took 1335 ms to find 0 implicit places.
[2023-03-19 17:12:41] [INFO ] Invariant cache hit.
[2023-03-19 17:12:41] [INFO ] Dead Transitions using invariants and state equation in 708 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1564/1573 places, 1564/1573 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2189 ms. Remains : 1564/1573 places, 1564/1573 transitions.
Stuttering acceptance computed with spot in 243 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-040B-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND p1 p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p2 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=2 dest: 4}], [{ cond=(OR (NOT p2) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p2 p0), acceptance={} source=3 dest: 3}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(AND (EQ s1310 0) (EQ s1288 1) (EQ s357 0) (EQ s714 1)), p2:(OR (EQ s835 0) (EQ s1048 1)), p0:(AND (EQ s60 0) (EQ s436 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA ShieldRVt-PT-040B-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLCardinality-03 finished in 2507 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 1573 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1573/1573 places, 1573/1573 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1563 transition count 1563
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1563 transition count 1563
Applied a total of 20 rules in 115 ms. Remains 1563 /1573 variables (removed 10) and now considering 1563/1573 (removed 10) transitions.
// Phase 1: matrix 1563 rows 1563 cols
[2023-03-19 17:12:42] [INFO ] Computed 161 place invariants in 8 ms
[2023-03-19 17:12:42] [INFO ] Implicit Places using invariants in 419 ms returned []
[2023-03-19 17:12:42] [INFO ] Invariant cache hit.
[2023-03-19 17:12:43] [INFO ] Implicit Places using invariants and state equation in 942 ms returned []
Implicit Place search using SMT with State Equation took 1395 ms to find 0 implicit places.
[2023-03-19 17:12:43] [INFO ] Invariant cache hit.
[2023-03-19 17:12:44] [INFO ] Dead Transitions using invariants and state equation in 716 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1563/1573 places, 1563/1573 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2241 ms. Remains : 1563/1573 places, 1563/1573 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s962 0) (EQ s1016 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 0 reset in 538 ms.
Stack based approach found an accepted trace after 1497 steps with 0 reset with depth 1498 and stack size 1498 in 8 ms.
FORMULA ShieldRVt-PT-040B-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-040B-LTLCardinality-05 finished in 2877 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((G(p0)||G(!p1)||(!p1&&F(p0))))))'
Support contains 4 out of 1573 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1573/1573 places, 1573/1573 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1561 transition count 1561
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1561 transition count 1561
Applied a total of 24 rules in 117 ms. Remains 1561 /1573 variables (removed 12) and now considering 1561/1573 (removed 12) transitions.
// Phase 1: matrix 1561 rows 1561 cols
[2023-03-19 17:12:45] [INFO ] Computed 161 place invariants in 6 ms
[2023-03-19 17:12:45] [INFO ] Implicit Places using invariants in 344 ms returned []
[2023-03-19 17:12:45] [INFO ] Invariant cache hit.
[2023-03-19 17:12:46] [INFO ] Implicit Places using invariants and state equation in 907 ms returned []
Implicit Place search using SMT with State Equation took 1254 ms to find 0 implicit places.
[2023-03-19 17:12:46] [INFO ] Invariant cache hit.
[2023-03-19 17:12:47] [INFO ] Dead Transitions using invariants and state equation in 685 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1561/1573 places, 1561/1573 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2057 ms. Remains : 1561/1573 places, 1561/1573 transitions.
Stuttering acceptance computed with spot in 96 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-040B-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(OR (EQ s852 0) (EQ s877 1)), p0:(AND (NEQ s578 0) (NEQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 5 reset in 424 ms.
Product exploration explored 100000 steps with 4 reset in 547 ms.
Computed a total of 478 stabilizing places and 478 stable transitions
Computed a total of 478 stabilizing places and 478 stable transitions
Detected a total of 478/1561 stabilizing places and 478/1561 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 349 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Finished random walk after 456 steps, including 0 resets, run visited all 3 properties in 9 ms. (steps per millisecond=50 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p1 p0)), (F (AND (NOT p1) (NOT p0))), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 8 factoid took 351 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 113 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
[2023-03-19 17:12:49] [INFO ] Invariant cache hit.
[2023-03-19 17:12:50] [INFO ] [Real]Absence check using 161 positive place invariants in 112 ms returned sat
[2023-03-19 17:12:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 17:12:53] [INFO ] [Real]Absence check using state equation in 3324 ms returned sat
[2023-03-19 17:12:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 17:12:54] [INFO ] [Nat]Absence check using 161 positive place invariants in 139 ms returned sat
[2023-03-19 17:12:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 17:12:58] [INFO ] [Nat]Absence check using state equation in 4252 ms returned sat
[2023-03-19 17:12:58] [INFO ] Computed and/alt/rep : 1560/2281/1560 causal constraints (skipped 0 transitions) in 108 ms.
[2023-03-19 17:13:09] [INFO ] Deduced a trap composed of 12 places in 691 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:614)
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:13:09] [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 p1 (NOT p0))
Could not prove EG (AND p1 (NOT p0))
Support contains 4 out of 1561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1561/1561 places, 1561/1561 transitions.
Applied a total of 0 rules in 77 ms. Remains 1561 /1561 variables (removed 0) and now considering 1561/1561 (removed 0) transitions.
[2023-03-19 17:13:09] [INFO ] Invariant cache hit.
[2023-03-19 17:13:09] [INFO ] Implicit Places using invariants in 348 ms returned []
[2023-03-19 17:13:09] [INFO ] Invariant cache hit.
[2023-03-19 17:13:10] [INFO ] Implicit Places using invariants and state equation in 838 ms returned []
Implicit Place search using SMT with State Equation took 1233 ms to find 0 implicit places.
[2023-03-19 17:13:10] [INFO ] Invariant cache hit.
[2023-03-19 17:13:11] [INFO ] Dead Transitions using invariants and state equation in 596 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1912 ms. Remains : 1561/1561 places, 1561/1561 transitions.
Computed a total of 478 stabilizing places and 478 stable transitions
Computed a total of 478 stabilizing places and 478 stable transitions
Detected a total of 478/1561 stabilizing places and 478/1561 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 257 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 17:13:11] [INFO ] Invariant cache hit.
[2023-03-19 17:13:11] [INFO ] After 216ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:13:12] [INFO ] [Nat]Absence check using 161 positive place invariants in 69 ms returned sat
[2023-03-19 17:13:12] [INFO ] After 649ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 17:13:13] [INFO ] Deduced a trap composed of 20 places in 345 ms of which 4 ms to minimize.
[2023-03-19 17:13:13] [INFO ] Deduced a trap composed of 21 places in 308 ms of which 2 ms to minimize.
[2023-03-19 17:13:13] [INFO ] Deduced a trap composed of 32 places in 314 ms of which 1 ms to minimize.
[2023-03-19 17:13:14] [INFO ] Deduced a trap composed of 26 places in 301 ms of which 1 ms to minimize.
[2023-03-19 17:13:14] [INFO ] Deduced a trap composed of 26 places in 327 ms of which 1 ms to minimize.
[2023-03-19 17:13:14] [INFO ] Deduced a trap composed of 44 places in 361 ms of which 1 ms to minimize.
[2023-03-19 17:13:15] [INFO ] Deduced a trap composed of 29 places in 334 ms of which 3 ms to minimize.
[2023-03-19 17:13:15] [INFO ] Deduced a trap composed of 43 places in 346 ms of which 1 ms to minimize.
[2023-03-19 17:13:16] [INFO ] Deduced a trap composed of 25 places in 288 ms of which 1 ms to minimize.
[2023-03-19 17:13:16] [INFO ] Deduced a trap composed of 27 places in 312 ms of which 1 ms to minimize.
[2023-03-19 17:13:16] [INFO ] Deduced a trap composed of 42 places in 295 ms of which 0 ms to minimize.
[2023-03-19 17:13:17] [INFO ] Deduced a trap composed of 36 places in 275 ms of which 1 ms to minimize.
[2023-03-19 17:13:17] [INFO ] Deduced a trap composed of 40 places in 284 ms of which 1 ms to minimize.
[2023-03-19 17:13:17] [INFO ] Deduced a trap composed of 30 places in 291 ms of which 0 ms to minimize.
[2023-03-19 17:13:18] [INFO ] Deduced a trap composed of 48 places in 272 ms of which 0 ms to minimize.
[2023-03-19 17:13:18] [INFO ] Deduced a trap composed of 42 places in 271 ms of which 1 ms to minimize.
[2023-03-19 17:13:18] [INFO ] Deduced a trap composed of 42 places in 269 ms of which 1 ms to minimize.
[2023-03-19 17:13:19] [INFO ] Deduced a trap composed of 38 places in 266 ms of which 1 ms to minimize.
[2023-03-19 17:13:19] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 6318 ms
[2023-03-19 17:13:19] [INFO ] After 7029ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-19 17:13:19] [INFO ] After 7425ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 255 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=127 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p1 p0)), (F (AND (NOT p1) (NOT p0))), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 8 factoid took 370 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 84 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
[2023-03-19 17:13:19] [INFO ] Invariant cache hit.
[2023-03-19 17:13:20] [INFO ] [Real]Absence check using 161 positive place invariants in 136 ms returned sat
[2023-03-19 17:13:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 17:13:23] [INFO ] [Real]Absence check using state equation in 3288 ms returned sat
[2023-03-19 17:13:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 17:13:24] [INFO ] [Nat]Absence check using 161 positive place invariants in 108 ms returned sat
[2023-03-19 17:13:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 17:13:28] [INFO ] [Nat]Absence check using state equation in 3622 ms returned sat
[2023-03-19 17:13:28] [INFO ] Computed and/alt/rep : 1560/2281/1560 causal constraints (skipped 0 transitions) in 91 ms.
[2023-03-19 17:13:39] [INFO ] Deduced a trap composed of 12 places in 492 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:614)
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:13:39] [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 p1 (NOT p0))
Could not prove EG (AND p1 (NOT p0))
Stuttering acceptance computed with spot in 130 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Product exploration explored 100000 steps with 28 reset in 422 ms.
Stack based approach found an accepted trace after 27810 steps with 9 reset with depth 23897 and stack size 22301 in 145 ms.
FORMULA ShieldRVt-PT-040B-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-040B-LTLCardinality-08 finished in 55010 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1573 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1573/1573 places, 1573/1573 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 436 transitions
Trivial Post-agglo rules discarded 436 transitions
Performed 436 trivial Post agglomeration. Transition count delta: 436
Iterating post reduction 0 with 436 rules applied. Total rules applied 436 place count 1572 transition count 1136
Reduce places removed 436 places and 0 transitions.
Iterating post reduction 1 with 436 rules applied. Total rules applied 872 place count 1136 transition count 1136
Performed 314 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 314 Pre rules applied. Total rules applied 872 place count 1136 transition count 822
Deduced a syphon composed of 314 places in 1 ms
Reduce places removed 314 places and 0 transitions.
Iterating global reduction 2 with 628 rules applied. Total rules applied 1500 place count 822 transition count 822
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 1510 place count 812 transition count 812
Iterating global reduction 2 with 10 rules applied. Total rules applied 1520 place count 812 transition count 812
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 1520 place count 812 transition count 802
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 1540 place count 802 transition count 802
Performed 357 Post agglomeration using F-continuation condition.Transition count delta: 357
Deduced a syphon composed of 357 places in 1 ms
Reduce places removed 357 places and 0 transitions.
Iterating global reduction 2 with 714 rules applied. Total rules applied 2254 place count 445 transition count 445
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2255 place count 445 transition count 444
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 2257 place count 444 transition count 443
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 2459 place count 343 transition count 543
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 2495 place count 325 transition count 561
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2497 place count 323 transition count 559
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2498 place count 322 transition count 559
Applied a total of 2498 rules in 214 ms. Remains 322 /1573 variables (removed 1251) and now considering 559/1573 (removed 1014) transitions.
// Phase 1: matrix 559 rows 322 cols
[2023-03-19 17:13:40] [INFO ] Computed 160 place invariants in 1 ms
[2023-03-19 17:13:40] [INFO ] Implicit Places using invariants in 589 ms returned []
[2023-03-19 17:13:40] [INFO ] Invariant cache hit.
[2023-03-19 17:13:41] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 17:13:41] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 932 ms to find 0 implicit places.
[2023-03-19 17:13:41] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-19 17:13:41] [INFO ] Invariant cache hit.
[2023-03-19 17:13:41] [INFO ] Dead Transitions using invariants and state equation in 213 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 322/1573 places, 559/1573 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1390 ms. Remains : 322/1573 places, 559/1573 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s265 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 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-040B-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLCardinality-09 finished in 1458 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 2 out of 1573 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1573/1573 places, 1573/1573 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 437 transitions
Trivial Post-agglo rules discarded 437 transitions
Performed 437 trivial Post agglomeration. Transition count delta: 437
Iterating post reduction 0 with 437 rules applied. Total rules applied 437 place count 1572 transition count 1135
Reduce places removed 437 places and 0 transitions.
Iterating post reduction 1 with 437 rules applied. Total rules applied 874 place count 1135 transition count 1135
Performed 314 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 314 Pre rules applied. Total rules applied 874 place count 1135 transition count 821
Deduced a syphon composed of 314 places in 1 ms
Reduce places removed 314 places and 0 transitions.
Iterating global reduction 2 with 628 rules applied. Total rules applied 1502 place count 821 transition count 821
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 1510 place count 813 transition count 813
Iterating global reduction 2 with 8 rules applied. Total rules applied 1518 place count 813 transition count 813
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 1518 place count 813 transition count 805
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 1534 place count 805 transition count 805
Performed 360 Post agglomeration using F-continuation condition.Transition count delta: 360
Deduced a syphon composed of 360 places in 0 ms
Reduce places removed 360 places and 0 transitions.
Iterating global reduction 2 with 720 rules applied. Total rules applied 2254 place count 445 transition count 445
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2255 place count 445 transition count 444
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 2257 place count 444 transition count 443
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -99
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 2459 place count 343 transition count 542
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 2495 place count 325 transition count 560
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2497 place count 323 transition count 558
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2498 place count 322 transition count 558
Applied a total of 2498 rules in 198 ms. Remains 322 /1573 variables (removed 1251) and now considering 558/1573 (removed 1015) transitions.
// Phase 1: matrix 558 rows 322 cols
[2023-03-19 17:13:41] [INFO ] Computed 160 place invariants in 1 ms
[2023-03-19 17:13:42] [INFO ] Implicit Places using invariants in 310 ms returned []
[2023-03-19 17:13:42] [INFO ] Invariant cache hit.
[2023-03-19 17:13:42] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 648 ms to find 0 implicit places.
[2023-03-19 17:13:42] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-19 17:13:42] [INFO ] Invariant cache hit.
[2023-03-19 17:13:42] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 322/1573 places, 558/1573 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1061 ms. Remains : 322/1573 places, 558/1573 transitions.
Stuttering acceptance computed with spot in 37 ms :[true, (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s6 0) (EQ s117 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 26 reset in 458 ms.
Product exploration explored 100000 steps with 31 reset in 460 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 131 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) 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 1) seen :0
Finished probabilistic random walk after 27598 steps, run visited all 1 properties in 169 ms. (steps per millisecond=163 )
Probabilistic random walk after 27598 steps, saw 17184 distinct states, run finished after 169 ms. (steps per millisecond=163 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 4 factoid took 60 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-040B-LTLCardinality-11 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-040B-LTLCardinality-11 finished in 2519 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 2 out of 1573 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1573/1573 places, 1573/1573 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1561 transition count 1561
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1561 transition count 1561
Applied a total of 24 rules in 111 ms. Remains 1561 /1573 variables (removed 12) and now considering 1561/1573 (removed 12) transitions.
// Phase 1: matrix 1561 rows 1561 cols
[2023-03-19 17:13:44] [INFO ] Computed 161 place invariants in 4 ms
[2023-03-19 17:13:44] [INFO ] Implicit Places using invariants in 383 ms returned []
[2023-03-19 17:13:44] [INFO ] Invariant cache hit.
[2023-03-19 17:13:45] [INFO ] Implicit Places using invariants and state equation in 906 ms returned []
Implicit Place search using SMT with State Equation took 1317 ms to find 0 implicit places.
[2023-03-19 17:13:45] [INFO ] Invariant cache hit.
[2023-03-19 17:13:46] [INFO ] Dead Transitions using invariants and state equation in 691 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1561/1573 places, 1561/1573 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2123 ms. Remains : 1561/1573 places, 1561/1573 transitions.
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLCardinality-12 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:(AND (NEQ s880 0) (NEQ s468 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-040B-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLCardinality-12 finished in 2218 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(p1)||p0))))'
Support contains 2 out of 1573 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1573/1573 places, 1573/1573 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1561 transition count 1561
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1561 transition count 1561
Applied a total of 24 rules in 113 ms. Remains 1561 /1573 variables (removed 12) and now considering 1561/1573 (removed 12) transitions.
[2023-03-19 17:13:46] [INFO ] Invariant cache hit.
[2023-03-19 17:13:46] [INFO ] Implicit Places using invariants in 331 ms returned []
[2023-03-19 17:13:46] [INFO ] Invariant cache hit.
[2023-03-19 17:13:47] [INFO ] Implicit Places using invariants and state equation in 930 ms returned []
Implicit Place search using SMT with State Equation took 1277 ms to find 0 implicit places.
[2023-03-19 17:13:47] [INFO ] Invariant cache hit.
[2023-03-19 17:13:48] [INFO ] Dead Transitions using invariants and state equation in 682 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1561/1573 places, 1561/1573 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2076 ms. Remains : 1561/1573 places, 1561/1573 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-040B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(OR (EQ s704 0) (EQ s1507 1)), p0:(OR (EQ s704 0) (EQ s1507 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 450 ms.
Product exploration explored 100000 steps with 3 reset in 630 ms.
Computed a total of 478 stabilizing places and 478 stable transitions
Computed a total of 478 stabilizing places and 478 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 341 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 320 ms. (steps per millisecond=31 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) 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 4) 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 4) seen :0
Interrupted probabilistic random walk after 182697 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :{}
Probabilistic random walk after 182697 steps, saw 92221 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-19 17:13:53] [INFO ] Invariant cache hit.
[2023-03-19 17:13:53] [INFO ] After 177ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2023-03-19 17:13:53] [INFO ] [Nat]Absence check using 161 positive place invariants in 38 ms returned sat
[2023-03-19 17:13:54] [INFO ] After 579ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-19 17:13:54] [INFO ] Deduced a trap composed of 21 places in 271 ms of which 1 ms to minimize.
[2023-03-19 17:13:55] [INFO ] Deduced a trap composed of 26 places in 249 ms of which 1 ms to minimize.
[2023-03-19 17:13:55] [INFO ] Deduced a trap composed of 33 places in 235 ms of which 2 ms to minimize.
[2023-03-19 17:13:55] [INFO ] Deduced a trap composed of 37 places in 242 ms of which 1 ms to minimize.
[2023-03-19 17:13:56] [INFO ] Deduced a trap composed of 27 places in 283 ms of which 1 ms to minimize.
[2023-03-19 17:13:56] [INFO ] Deduced a trap composed of 30 places in 262 ms of which 1 ms to minimize.
[2023-03-19 17:13:56] [INFO ] Deduced a trap composed of 25 places in 232 ms of which 1 ms to minimize.
[2023-03-19 17:13:56] [INFO ] Deduced a trap composed of 32 places in 213 ms of which 0 ms to minimize.
[2023-03-19 17:13:57] [INFO ] Deduced a trap composed of 25 places in 238 ms of which 1 ms to minimize.
[2023-03-19 17:13:57] [INFO ] Deduced a trap composed of 20 places in 250 ms of which 1 ms to minimize.
[2023-03-19 17:13:57] [INFO ] Deduced a trap composed of 48 places in 206 ms of which 0 ms to minimize.
[2023-03-19 17:13:57] [INFO ] Deduced a trap composed of 43 places in 199 ms of which 2 ms to minimize.
[2023-03-19 17:13:58] [INFO ] Deduced a trap composed of 36 places in 195 ms of which 1 ms to minimize.
[2023-03-19 17:13:58] [INFO ] Deduced a trap composed of 48 places in 284 ms of which 1 ms to minimize.
[2023-03-19 17:13:58] [INFO ] Deduced a trap composed of 35 places in 199 ms of which 7 ms to minimize.
[2023-03-19 17:13:59] [INFO ] Deduced a trap composed of 34 places in 228 ms of which 2 ms to minimize.
[2023-03-19 17:13:59] [INFO ] Deduced a trap composed of 44 places in 222 ms of which 1 ms to minimize.
[2023-03-19 17:13:59] [INFO ] Deduced a trap composed of 48 places in 206 ms of which 0 ms to minimize.
[2023-03-19 17:13:59] [INFO ] Deduced a trap composed of 44 places in 197 ms of which 0 ms to minimize.
[2023-03-19 17:14:00] [INFO ] Deduced a trap composed of 37 places in 197 ms of which 1 ms to minimize.
[2023-03-19 17:14:00] [INFO ] Deduced a trap composed of 41 places in 199 ms of which 1 ms to minimize.
[2023-03-19 17:14:00] [INFO ] Deduced a trap composed of 42 places in 172 ms of which 1 ms to minimize.
[2023-03-19 17:14:00] [INFO ] Deduced a trap composed of 42 places in 164 ms of which 1 ms to minimize.
[2023-03-19 17:14:00] [INFO ] Deduced a trap composed of 57 places in 212 ms of which 1 ms to minimize.
[2023-03-19 17:14:01] [INFO ] Deduced a trap composed of 56 places in 164 ms of which 1 ms to minimize.
[2023-03-19 17:14:01] [INFO ] Deduced a trap composed of 42 places in 161 ms of which 1 ms to minimize.
[2023-03-19 17:14:01] [INFO ] Deduced a trap composed of 53 places in 157 ms of which 1 ms to minimize.
[2023-03-19 17:14:01] [INFO ] Deduced a trap composed of 52 places in 156 ms of which 0 ms to minimize.
[2023-03-19 17:14:01] [INFO ] Deduced a trap composed of 53 places in 150 ms of which 1 ms to minimize.
[2023-03-19 17:14:02] [INFO ] Deduced a trap composed of 45 places in 134 ms of which 1 ms to minimize.
[2023-03-19 17:14:02] [INFO ] Deduced a trap composed of 47 places in 140 ms of which 1 ms to minimize.
[2023-03-19 17:14:02] [INFO ] Deduced a trap composed of 67 places in 133 ms of which 0 ms to minimize.
[2023-03-19 17:14:02] [INFO ] Deduced a trap composed of 56 places in 128 ms of which 1 ms to minimize.
[2023-03-19 17:14:02] [INFO ] Deduced a trap composed of 59 places in 176 ms of which 1 ms to minimize.
[2023-03-19 17:14:03] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 8456 ms
[2023-03-19 17:14:03] [INFO ] After 9209ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 145 ms.
[2023-03-19 17:14:03] [INFO ] After 9612ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 110 ms.
Support contains 2 out of 1561 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1561/1561 places, 1561/1561 transitions.
Drop transitions removed 437 transitions
Trivial Post-agglo rules discarded 437 transitions
Performed 437 trivial Post agglomeration. Transition count delta: 437
Iterating post reduction 0 with 437 rules applied. Total rules applied 437 place count 1561 transition count 1124
Reduce places removed 437 places and 0 transitions.
Iterating post reduction 1 with 437 rules applied. Total rules applied 874 place count 1124 transition count 1124
Performed 320 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 320 Pre rules applied. Total rules applied 874 place count 1124 transition count 804
Deduced a syphon composed of 320 places in 2 ms
Reduce places removed 320 places and 0 transitions.
Iterating global reduction 2 with 640 rules applied. Total rules applied 1514 place count 804 transition count 804
Performed 359 Post agglomeration using F-continuation condition.Transition count delta: 359
Deduced a syphon composed of 359 places in 0 ms
Reduce places removed 359 places and 0 transitions.
Iterating global reduction 2 with 718 rules applied. Total rules applied 2232 place count 445 transition count 445
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2233 place count 445 transition count 444
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 2235 place count 444 transition count 443
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 2437 place count 343 transition count 543
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 2473 place count 325 transition count 561
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2474 place count 325 transition count 560
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2475 place count 324 transition count 559
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2476 place count 323 transition count 559
Applied a total of 2476 rules in 135 ms. Remains 323 /1561 variables (removed 1238) and now considering 559/1561 (removed 1002) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 323/1561 places, 559/1561 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 181 ms. (steps per millisecond=55 ) 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 31 ms. (steps per millisecond=322 ) 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
Finished probabilistic random walk after 14403 steps, run visited all 3 properties in 261 ms. (steps per millisecond=55 )
Probabilistic random walk after 14403 steps, saw 9198 distinct states, run finished after 261 ms. (steps per millisecond=55 ) properties seen :3
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (G (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 10 factoid took 270 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 1561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1561/1561 places, 1561/1561 transitions.
Applied a total of 0 rules in 52 ms. Remains 1561 /1561 variables (removed 0) and now considering 1561/1561 (removed 0) transitions.
[2023-03-19 17:14:04] [INFO ] Invariant cache hit.
[2023-03-19 17:14:04] [INFO ] Implicit Places using invariants in 307 ms returned []
[2023-03-19 17:14:04] [INFO ] Invariant cache hit.
[2023-03-19 17:14:05] [INFO ] Implicit Places using invariants and state equation in 910 ms returned []
Implicit Place search using SMT with State Equation took 1225 ms to find 0 implicit places.
[2023-03-19 17:14:05] [INFO ] Invariant cache hit.
[2023-03-19 17:14:06] [INFO ] Dead Transitions using invariants and state equation in 643 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1934 ms. Remains : 1561/1561 places, 1561/1561 transitions.
Computed a total of 478 stabilizing places and 478 stable transitions
Computed a total of 478 stabilizing places and 478 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 131 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 54 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 286591 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :{}
Probabilistic random walk after 286591 steps, saw 133901 distinct states, run finished after 3002 ms. (steps per millisecond=95 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 17:14:09] [INFO ] Invariant cache hit.
[2023-03-19 17:14:09] [INFO ] After 183ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 17:14:10] [INFO ] [Nat]Absence check using 161 positive place invariants in 40 ms returned sat
[2023-03-19 17:14:10] [INFO ] After 593ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 17:14:11] [INFO ] Deduced a trap composed of 21 places in 316 ms of which 1 ms to minimize.
[2023-03-19 17:14:11] [INFO ] Deduced a trap composed of 26 places in 271 ms of which 1 ms to minimize.
[2023-03-19 17:14:11] [INFO ] Deduced a trap composed of 33 places in 272 ms of which 1 ms to minimize.
[2023-03-19 17:14:11] [INFO ] Deduced a trap composed of 37 places in 270 ms of which 1 ms to minimize.
[2023-03-19 17:14:12] [INFO ] Deduced a trap composed of 27 places in 262 ms of which 1 ms to minimize.
[2023-03-19 17:14:12] [INFO ] Deduced a trap composed of 30 places in 276 ms of which 1 ms to minimize.
[2023-03-19 17:14:12] [INFO ] Deduced a trap composed of 25 places in 247 ms of which 1 ms to minimize.
[2023-03-19 17:14:13] [INFO ] Deduced a trap composed of 32 places in 234 ms of which 1 ms to minimize.
[2023-03-19 17:14:13] [INFO ] Deduced a trap composed of 25 places in 236 ms of which 1 ms to minimize.
[2023-03-19 17:14:13] [INFO ] Deduced a trap composed of 20 places in 228 ms of which 1 ms to minimize.
[2023-03-19 17:14:13] [INFO ] Deduced a trap composed of 48 places in 249 ms of which 1 ms to minimize.
[2023-03-19 17:14:14] [INFO ] Deduced a trap composed of 43 places in 223 ms of which 1 ms to minimize.
[2023-03-19 17:14:14] [INFO ] Deduced a trap composed of 36 places in 228 ms of which 0 ms to minimize.
[2023-03-19 17:14:14] [INFO ] Deduced a trap composed of 48 places in 210 ms of which 1 ms to minimize.
[2023-03-19 17:14:15] [INFO ] Deduced a trap composed of 35 places in 208 ms of which 1 ms to minimize.
[2023-03-19 17:14:15] [INFO ] Deduced a trap composed of 34 places in 254 ms of which 1 ms to minimize.
[2023-03-19 17:14:15] [INFO ] Deduced a trap composed of 44 places in 200 ms of which 1 ms to minimize.
[2023-03-19 17:14:15] [INFO ] Deduced a trap composed of 48 places in 216 ms of which 0 ms to minimize.
[2023-03-19 17:14:16] [INFO ] Deduced a trap composed of 44 places in 194 ms of which 1 ms to minimize.
[2023-03-19 17:14:16] [INFO ] Deduced a trap composed of 37 places in 197 ms of which 0 ms to minimize.
[2023-03-19 17:14:16] [INFO ] Deduced a trap composed of 41 places in 187 ms of which 1 ms to minimize.
[2023-03-19 17:14:16] [INFO ] Deduced a trap composed of 42 places in 214 ms of which 1 ms to minimize.
[2023-03-19 17:14:17] [INFO ] Deduced a trap composed of 42 places in 201 ms of which 0 ms to minimize.
[2023-03-19 17:14:17] [INFO ] Deduced a trap composed of 57 places in 187 ms of which 0 ms to minimize.
[2023-03-19 17:14:17] [INFO ] Deduced a trap composed of 56 places in 176 ms of which 0 ms to minimize.
[2023-03-19 17:14:17] [INFO ] Deduced a trap composed of 42 places in 169 ms of which 0 ms to minimize.
[2023-03-19 17:14:17] [INFO ] Deduced a trap composed of 53 places in 169 ms of which 1 ms to minimize.
[2023-03-19 17:14:18] [INFO ] Deduced a trap composed of 52 places in 157 ms of which 1 ms to minimize.
[2023-03-19 17:14:18] [INFO ] Deduced a trap composed of 53 places in 174 ms of which 1 ms to minimize.
[2023-03-19 17:14:18] [INFO ] Deduced a trap composed of 45 places in 162 ms of which 1 ms to minimize.
[2023-03-19 17:14:18] [INFO ] Deduced a trap composed of 47 places in 155 ms of which 0 ms to minimize.
[2023-03-19 17:14:18] [INFO ] Deduced a trap composed of 67 places in 184 ms of which 0 ms to minimize.
[2023-03-19 17:14:19] [INFO ] Deduced a trap composed of 56 places in 149 ms of which 0 ms to minimize.
[2023-03-19 17:14:19] [INFO ] Deduced a trap composed of 59 places in 145 ms of which 1 ms to minimize.
[2023-03-19 17:14:19] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 8691 ms
[2023-03-19 17:14:19] [INFO ] After 9315ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2023-03-19 17:14:19] [INFO ] After 9573ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 14 ms.
Support contains 2 out of 1561 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1561/1561 places, 1561/1561 transitions.
Drop transitions removed 437 transitions
Trivial Post-agglo rules discarded 437 transitions
Performed 437 trivial Post agglomeration. Transition count delta: 437
Iterating post reduction 0 with 437 rules applied. Total rules applied 437 place count 1561 transition count 1124
Reduce places removed 437 places and 0 transitions.
Iterating post reduction 1 with 437 rules applied. Total rules applied 874 place count 1124 transition count 1124
Performed 320 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 320 Pre rules applied. Total rules applied 874 place count 1124 transition count 804
Deduced a syphon composed of 320 places in 1 ms
Reduce places removed 320 places and 0 transitions.
Iterating global reduction 2 with 640 rules applied. Total rules applied 1514 place count 804 transition count 804
Performed 359 Post agglomeration using F-continuation condition.Transition count delta: 359
Deduced a syphon composed of 359 places in 0 ms
Reduce places removed 359 places and 0 transitions.
Iterating global reduction 2 with 718 rules applied. Total rules applied 2232 place count 445 transition count 445
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2233 place count 445 transition count 444
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 2235 place count 444 transition count 443
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 2437 place count 343 transition count 543
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 2473 place count 325 transition count 561
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2474 place count 325 transition count 560
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2475 place count 324 transition count 559
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2476 place count 323 transition count 559
Applied a total of 2476 rules in 137 ms. Remains 323 /1561 variables (removed 1238) and now considering 559/1561 (removed 1002) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 323/1561 places, 559/1561 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Finished probabilistic random walk after 14403 steps, run visited all 1 properties in 122 ms. (steps per millisecond=118 )
Probabilistic random walk after 14403 steps, saw 9198 distinct states, run finished after 123 ms. (steps per millisecond=117 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 209 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1 reset in 429 ms.
Product exploration explored 100000 steps with 3 reset in 552 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 1561 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1561/1561 places, 1561/1561 transitions.
Performed 437 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 437 rules applied. Total rules applied 437 place count 1561 transition count 1561
Performed 160 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 160 Pre rules applied. Total rules applied 437 place count 1561 transition count 1721
Deduced a syphon composed of 597 places in 3 ms
Iterating global reduction 1 with 160 rules applied. Total rules applied 597 place count 1561 transition count 1721
Performed 479 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1076 places in 1 ms
Iterating global reduction 1 with 479 rules applied. Total rules applied 1076 place count 1561 transition count 1721
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1077 place count 1561 transition count 1720
Renaming transitions due to excessive name length > 1024 char.
Discarding 319 places :
Symmetric choice reduction at 2 with 319 rule applications. Total rules 1396 place count 1242 transition count 1401
Deduced a syphon composed of 757 places in 1 ms
Iterating global reduction 2 with 319 rules applied. Total rules applied 1715 place count 1242 transition count 1401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 758 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1716 place count 1242 transition count 1401
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1718 place count 1240 transition count 1399
Deduced a syphon composed of 756 places in 2 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1720 place count 1240 transition count 1399
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -732
Deduced a syphon composed of 857 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1821 place count 1240 transition count 2131
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 1922 place count 1139 transition count 1929
Deduced a syphon composed of 756 places in 1 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2023 place count 1139 transition count 1929
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -415
Deduced a syphon composed of 814 places in 1 ms
Iterating global reduction 2 with 58 rules applied. Total rules applied 2081 place count 1139 transition count 2344
Discarding 58 places :
Symmetric choice reduction at 2 with 58 rule applications. Total rules 2139 place count 1081 transition count 2228
Deduced a syphon composed of 756 places in 0 ms
Iterating global reduction 2 with 58 rules applied. Total rules applied 2197 place count 1081 transition count 2228
Deduced a syphon composed of 756 places in 1 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 2200 place count 1081 transition count 2225
Deduced a syphon composed of 756 places in 1 ms
Applied a total of 2200 rules in 905 ms. Remains 1081 /1561 variables (removed 480) and now considering 2225/1561 (removed -664) transitions.
[2023-03-19 17:14:22] [INFO ] Redundant transitions in 31 ms returned []
// Phase 1: matrix 2225 rows 1081 cols
[2023-03-19 17:14:22] [INFO ] Computed 161 place invariants in 12 ms
[2023-03-19 17:14:23] [INFO ] Dead Transitions using invariants and state equation in 852 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1081/1561 places, 2225/1561 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1827 ms. Remains : 1081/1561 places, 2225/1561 transitions.
Support contains 2 out of 1561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1561/1561 places, 1561/1561 transitions.
Applied a total of 0 rules in 46 ms. Remains 1561 /1561 variables (removed 0) and now considering 1561/1561 (removed 0) transitions.
// Phase 1: matrix 1561 rows 1561 cols
[2023-03-19 17:14:23] [INFO ] Computed 161 place invariants in 7 ms
[2023-03-19 17:14:23] [INFO ] Implicit Places using invariants in 334 ms returned []
[2023-03-19 17:14:23] [INFO ] Invariant cache hit.
[2023-03-19 17:14:24] [INFO ] Implicit Places using invariants and state equation in 924 ms returned []
Implicit Place search using SMT with State Equation took 1263 ms to find 0 implicit places.
[2023-03-19 17:14:24] [INFO ] Invariant cache hit.
[2023-03-19 17:14:25] [INFO ] Dead Transitions using invariants and state equation in 689 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2013 ms. Remains : 1561/1561 places, 1561/1561 transitions.
Treatment of property ShieldRVt-PT-040B-LTLCardinality-13 finished in 39186 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(G(p0))&&F(p1))))'
Support contains 3 out of 1573 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1573/1573 places, 1573/1573 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1564 transition count 1564
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1564 transition count 1564
Applied a total of 18 rules in 100 ms. Remains 1564 /1573 variables (removed 9) and now considering 1564/1573 (removed 9) transitions.
// Phase 1: matrix 1564 rows 1564 cols
[2023-03-19 17:14:25] [INFO ] Computed 161 place invariants in 3 ms
[2023-03-19 17:14:26] [INFO ] Implicit Places using invariants in 394 ms returned []
[2023-03-19 17:14:26] [INFO ] Invariant cache hit.
[2023-03-19 17:14:27] [INFO ] Implicit Places using invariants and state equation in 1052 ms returned []
Implicit Place search using SMT with State Equation took 1447 ms to find 0 implicit places.
[2023-03-19 17:14:27] [INFO ] Invariant cache hit.
[2023-03-19 17:14:27] [INFO ] Dead Transitions using invariants and state equation in 896 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1564/1573 places, 1564/1573 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2445 ms. Remains : 1564/1573 places, 1564/1573 transitions.
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s462 0) (EQ s979 1)), p0:(AND (EQ s245 0) (OR (EQ s979 0) (EQ s462 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 42464 steps with 0 reset in 250 ms.
FORMULA ShieldRVt-PT-040B-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLCardinality-14 finished in 2857 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0&&F((G(F(!p1))||(!p2&&F(!p1)))))))'
Support contains 5 out of 1573 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1573/1573 places, 1573/1573 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 433 transitions
Trivial Post-agglo rules discarded 433 transitions
Performed 433 trivial Post agglomeration. Transition count delta: 433
Iterating post reduction 0 with 433 rules applied. Total rules applied 433 place count 1572 transition count 1139
Reduce places removed 433 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 434 rules applied. Total rules applied 867 place count 1139 transition count 1138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 868 place count 1138 transition count 1138
Performed 313 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 313 Pre rules applied. Total rules applied 868 place count 1138 transition count 825
Deduced a syphon composed of 313 places in 2 ms
Reduce places removed 313 places and 0 transitions.
Iterating global reduction 3 with 626 rules applied. Total rules applied 1494 place count 825 transition count 825
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1504 place count 815 transition count 815
Iterating global reduction 3 with 10 rules applied. Total rules applied 1514 place count 815 transition count 815
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 1514 place count 815 transition count 805
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 1534 place count 805 transition count 805
Performed 353 Post agglomeration using F-continuation condition.Transition count delta: 353
Deduced a syphon composed of 353 places in 0 ms
Reduce places removed 353 places and 0 transitions.
Iterating global reduction 3 with 706 rules applied. Total rules applied 2240 place count 452 transition count 452
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2241 place count 452 transition count 451
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 2243 place count 451 transition count 450
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 2445 place count 350 transition count 550
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 2481 place count 332 transition count 568
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 2482 place count 332 transition count 568
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2484 place count 330 transition count 566
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2485 place count 329 transition count 566
Applied a total of 2485 rules in 183 ms. Remains 329 /1573 variables (removed 1244) and now considering 566/1573 (removed 1007) transitions.
// Phase 1: matrix 566 rows 329 cols
[2023-03-19 17:14:28] [INFO ] Computed 160 place invariants in 1 ms
[2023-03-19 17:14:28] [INFO ] Implicit Places using invariants in 317 ms returned []
[2023-03-19 17:14:28] [INFO ] Invariant cache hit.
[2023-03-19 17:14:29] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-19 17:14:29] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 696 ms to find 0 implicit places.
[2023-03-19 17:14:29] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-19 17:14:29] [INFO ] Invariant cache hit.
[2023-03-19 17:14:29] [INFO ] Dead Transitions using invariants and state equation in 278 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 329/1573 places, 566/1573 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1177 ms. Remains : 329/1573 places, 566/1573 transitions.
Stuttering acceptance computed with spot in 62 ms :[(OR (NOT p0) p1), true, p1]
Running random walk in product with property : ShieldRVt-PT-040B-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s158 0) (EQ s177 1)), p1:(OR (EQ s204 0) (EQ s37 1) (EQ s316 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-040B-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLCardinality-15 finished in 1270 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(p1)||p0))))'
Found a Lengthening insensitive property : ShieldRVt-PT-040B-LTLCardinality-13
Stuttering acceptance computed with spot in 79 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 1573 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1573/1573 places, 1573/1573 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 435 transitions
Trivial Post-agglo rules discarded 435 transitions
Performed 435 trivial Post agglomeration. Transition count delta: 435
Iterating post reduction 0 with 435 rules applied. Total rules applied 435 place count 1572 transition count 1137
Reduce places removed 435 places and 0 transitions.
Iterating post reduction 1 with 435 rules applied. Total rules applied 870 place count 1137 transition count 1137
Performed 314 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 314 Pre rules applied. Total rules applied 870 place count 1137 transition count 823
Deduced a syphon composed of 314 places in 1 ms
Reduce places removed 314 places and 0 transitions.
Iterating global reduction 2 with 628 rules applied. Total rules applied 1498 place count 823 transition count 823
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 1508 place count 813 transition count 813
Iterating global reduction 2 with 10 rules applied. Total rules applied 1518 place count 813 transition count 813
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 1518 place count 813 transition count 803
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 1538 place count 803 transition count 803
Performed 357 Post agglomeration using F-continuation condition.Transition count delta: 357
Deduced a syphon composed of 357 places in 0 ms
Reduce places removed 357 places and 0 transitions.
Iterating global reduction 2 with 714 rules applied. Total rules applied 2252 place count 446 transition count 446
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2253 place count 446 transition count 445
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 2255 place count 445 transition count 444
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 2457 place count 344 transition count 544
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 2493 place count 326 transition count 562
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2495 place count 324 transition count 560
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2496 place count 323 transition count 560
Applied a total of 2496 rules in 143 ms. Remains 323 /1573 variables (removed 1250) and now considering 560/1573 (removed 1013) transitions.
// Phase 1: matrix 560 rows 323 cols
[2023-03-19 17:14:29] [INFO ] Computed 160 place invariants in 0 ms
[2023-03-19 17:14:30] [INFO ] Implicit Places using invariants in 390 ms returned []
[2023-03-19 17:14:30] [INFO ] Invariant cache hit.
[2023-03-19 17:14:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 17:14:30] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 706 ms to find 0 implicit places.
[2023-03-19 17:14:30] [INFO ] Invariant cache hit.
[2023-03-19 17:14:30] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 323/1573 places, 560/1573 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1081 ms. Remains : 323/1573 places, 560/1573 transitions.
Running random walk in product with property : ShieldRVt-PT-040B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(OR (EQ s141 0) (EQ s312 1)), p0:(OR (EQ s141 0) (EQ s312 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 27 reset in 408 ms.
Product exploration explored 100000 steps with 30 reset in 513 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 p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 314 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 331297 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :{0=1, 1=1, 3=1}
Probabilistic random walk after 331297 steps, saw 205944 distinct states, run finished after 3001 ms. (steps per millisecond=110 ) properties seen :3
Running SMT prover for 1 properties.
[2023-03-19 17:14:35] [INFO ] Invariant cache hit.
[2023-03-19 17:14:35] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (G (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 10 factoid took 482 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 560/560 transitions.
Applied a total of 0 rules in 3 ms. Remains 323 /323 variables (removed 0) and now considering 560/560 (removed 0) transitions.
[2023-03-19 17:14:36] [INFO ] Invariant cache hit.
[2023-03-19 17:14:36] [INFO ] Implicit Places using invariants in 198 ms returned []
[2023-03-19 17:14:36] [INFO ] Invariant cache hit.
[2023-03-19 17:14:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 17:14:36] [INFO ] Implicit Places using invariants and state equation in 511 ms returned []
Implicit Place search using SMT with State Equation took 715 ms to find 0 implicit places.
[2023-03-19 17:14:36] [INFO ] Invariant cache hit.
[2023-03-19 17:14:37] [INFO ] Dead Transitions using invariants and state equation in 224 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 957 ms. Remains : 323/323 places, 560/560 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 : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 128 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) 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 1) seen :0
Finished probabilistic random walk after 61648 steps, run visited all 1 properties in 375 ms. (steps per millisecond=164 )
Probabilistic random walk after 61648 steps, saw 42051 distinct states, run finished after 376 ms. (steps per millisecond=163 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 196 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 57 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 56 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 21 reset in 473 ms.
Product exploration explored 100000 steps with 24 reset in 596 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 560/560 transitions.
Applied a total of 0 rules in 8 ms. Remains 323 /323 variables (removed 0) and now considering 560/560 (removed 0) transitions.
[2023-03-19 17:14:39] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-19 17:14:39] [INFO ] Invariant cache hit.
[2023-03-19 17:14:39] [INFO ] Dead Transitions using invariants and state equation in 274 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 315 ms. Remains : 323/323 places, 560/560 transitions.
Support contains 2 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 560/560 transitions.
Applied a total of 0 rules in 4 ms. Remains 323 /323 variables (removed 0) and now considering 560/560 (removed 0) transitions.
[2023-03-19 17:14:39] [INFO ] Invariant cache hit.
[2023-03-19 17:14:40] [INFO ] Implicit Places using invariants in 266 ms returned []
[2023-03-19 17:14:40] [INFO ] Invariant cache hit.
[2023-03-19 17:14:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 17:14:40] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 582 ms to find 0 implicit places.
[2023-03-19 17:14:40] [INFO ] Invariant cache hit.
[2023-03-19 17:14:40] [INFO ] Dead Transitions using invariants and state equation in 244 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 854 ms. Remains : 323/323 places, 560/560 transitions.
Treatment of property ShieldRVt-PT-040B-LTLCardinality-13 finished in 11060 ms.
[2023-03-19 17:14:40] [INFO ] Flatten gal took : 93 ms
[2023-03-19 17:14:40] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-19 17:14:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1573 places, 1573 transitions and 3866 arcs took 24 ms.
Total runtime 149761 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldRVt-PT-040B
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLCardinality

BK_STOP 1679246286358

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 ShieldRVt-PT-040B-LTLCardinality-13
lola: time limit : 3600 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3600 2/32 ShieldRVt-PT-040B-LTLCardinality-13 146374 m, 29274 m/sec, 518222 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3600 3/32 ShieldRVt-PT-040B-LTLCardinality-13 289786 m, 28682 m/sec, 1060289 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3600 4/32 ShieldRVt-PT-040B-LTLCardinality-13 411002 m, 24243 m/sec, 1598609 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3600 4/32 ShieldRVt-PT-040B-LTLCardinality-13 531440 m, 24087 m/sec, 2172877 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3600 5/32 ShieldRVt-PT-040B-LTLCardinality-13 661383 m, 25988 m/sec, 2768647 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3600 6/32 ShieldRVt-PT-040B-LTLCardinality-13 786625 m, 25048 m/sec, 3366312 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3600 7/32 ShieldRVt-PT-040B-LTLCardinality-13 910160 m, 24707 m/sec, 3957936 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/3600 8/32 ShieldRVt-PT-040B-LTLCardinality-13 1012916 m, 20551 m/sec, 4533000 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/3600 9/32 ShieldRVt-PT-040B-LTLCardinality-13 1116184 m, 20653 m/sec, 5126965 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/3600 10/32 ShieldRVt-PT-040B-LTLCardinality-13 1225745 m, 21912 m/sec, 5716810 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 55/3600 10/32 ShieldRVt-PT-040B-LTLCardinality-13 1351352 m, 25121 m/sec, 6309216 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 60/3600 11/32 ShieldRVt-PT-040B-LTLCardinality-13 1467071 m, 23143 m/sec, 6861689 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 65/3600 12/32 ShieldRVt-PT-040B-LTLCardinality-13 1597779 m, 26141 m/sec, 7456332 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 70/3600 13/32 ShieldRVt-PT-040B-LTLCardinality-13 1721929 m, 24830 m/sec, 8048785 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 75/3600 14/32 ShieldRVt-PT-040B-LTLCardinality-13 1841066 m, 23827 m/sec, 8638869 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 80/3600 15/32 ShieldRVt-PT-040B-LTLCardinality-13 1944144 m, 20615 m/sec, 9229985 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 85/3600 16/32 ShieldRVt-PT-040B-LTLCardinality-13 2046205 m, 20412 m/sec, 9817669 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 90/3600 16/32 ShieldRVt-PT-040B-LTLCardinality-13 2152811 m, 21321 m/sec, 10409933 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 95/3600 17/32 ShieldRVt-PT-040B-LTLCardinality-13 2255703 m, 20578 m/sec, 11003021 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 100/3600 18/32 ShieldRVt-PT-040B-LTLCardinality-13 2358279 m, 20515 m/sec, 11594101 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 105/3600 19/32 ShieldRVt-PT-040B-LTLCardinality-13 2455168 m, 19377 m/sec, 12185585 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 110/3600 19/32 ShieldRVt-PT-040B-LTLCardinality-13 2542682 m, 17502 m/sec, 12777610 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 115/3600 20/32 ShieldRVt-PT-040B-LTLCardinality-13 2629962 m, 17456 m/sec, 13367502 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 120/3600 21/32 ShieldRVt-PT-040B-LTLCardinality-13 2723906 m, 18788 m/sec, 13959570 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 125/3600 21/32 ShieldRVt-PT-040B-LTLCardinality-13 2818988 m, 19016 m/sec, 14501506 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 130/3600 22/32 ShieldRVt-PT-040B-LTLCardinality-13 2912218 m, 18646 m/sec, 15036780 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 135/3600 23/32 ShieldRVt-PT-040B-LTLCardinality-13 3006833 m, 18923 m/sec, 15565565 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 140/3600 24/32 ShieldRVt-PT-040B-LTLCardinality-13 3131798 m, 24993 m/sec, 16141620 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 145/3600 24/32 ShieldRVt-PT-040B-LTLCardinality-13 3255800 m, 24800 m/sec, 16735460 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 150/3600 25/32 ShieldRVt-PT-040B-LTLCardinality-13 3370277 m, 22895 m/sec, 17330023 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 155/3600 26/32 ShieldRVt-PT-040B-LTLCardinality-13 3472785 m, 20501 m/sec, 17922268 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 160/3600 27/32 ShieldRVt-PT-040B-LTLCardinality-13 3574800 m, 20403 m/sec, 18513221 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 165/3600 28/32 ShieldRVt-PT-040B-LTLCardinality-13 3682899 m, 21619 m/sec, 19108521 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 170/3600 28/32 ShieldRVt-PT-040B-LTLCardinality-13 3785526 m, 20525 m/sec, 19700513 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 175/3600 29/32 ShieldRVt-PT-040B-LTLCardinality-13 3887331 m, 20361 m/sec, 20290518 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 180/3600 30/32 ShieldRVt-PT-040B-LTLCardinality-13 3970178 m, 16569 m/sec, 20815900 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 185/3600 30/32 ShieldRVt-PT-040B-LTLCardinality-13 4050340 m, 16032 m/sec, 21359824 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 190/3600 31/32 ShieldRVt-PT-040B-LTLCardinality-13 4133697 m, 16671 m/sec, 21922994 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 195/3600 32/32 ShieldRVt-PT-040B-LTLCardinality-13 4225943 m, 18449 m/sec, 22497059 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 200/3600 32/32 ShieldRVt-PT-040B-LTLCardinality-13 4330352 m, 20881 m/sec, 23090443 t fired, .

Time elapsed: 200 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
lola: CANCELED task # 1 (type EXCL) for ShieldRVt-PT-040B-LTLCardinality-13 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

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

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

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

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-040B-LTLCardinality-13: LTL unknown AGGR


Time elapsed: 205 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-040B"
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-040B, 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-167905976600315"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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