Execution Chart

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

Trace from the execution

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

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

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-040B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 10:58:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 10:58:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 10:58:30] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2023-03-20 10:58:30] [INFO ] Transformed 2003 places.
[2023-03-20 10:58:30] [INFO ] Transformed 2003 transitions.
[2023-03-20 10:58:30] [INFO ] Found NUPN structural information;
[2023-03-20 10:58:30] [INFO ] Parsed PT model containing 2003 places and 2003 transitions and 4726 arcs in 216 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 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 657 ms. Remains 1573 /2003 variables (removed 430) and now considering 1573/2003 (removed 430) transitions.
// Phase 1: matrix 1573 rows 1573 cols
[2023-03-20 10:58:31] [INFO ] Computed 161 place invariants in 28 ms
[2023-03-20 10:58:31] [INFO ] Implicit Places using invariants in 582 ms returned []
[2023-03-20 10:58:31] [INFO ] Invariant cache hit.
[2023-03-20 10:58:33] [INFO ] Implicit Places using invariants and state equation in 1358 ms returned []
Implicit Place search using SMT with State Equation took 1970 ms to find 0 implicit places.
[2023-03-20 10:58:33] [INFO ] Invariant cache hit.
[2023-03-20 10:58:33] [INFO ] Dead Transitions using invariants and state equation in 802 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 3432 ms. Remains : 1573/2003 places, 1573/2003 transitions.
Support contains 33 out of 1573 places after structural reductions.
[2023-03-20 10:58:34] [INFO ] Flatten gal took : 110 ms
[2023-03-20 10:58:34] [INFO ] Flatten gal took : 60 ms
[2023-03-20 10:58:34] [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 468 ms. (steps per millisecond=21 ) properties (out of 16) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-20 10:58:35] [INFO ] Invariant cache hit.
[2023-03-20 10:58:35] [INFO ] [Real]Absence check using 161 positive place invariants in 52 ms returned sat
[2023-03-20 10:58:35] [INFO ] After 461ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-20 10:58:35] [INFO ] [Nat]Absence check using 161 positive place invariants in 48 ms returned sat
[2023-03-20 10:58:37] [INFO ] After 993ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-20 10:58:37] [INFO ] Deduced a trap composed of 22 places in 265 ms of which 6 ms to minimize.
[2023-03-20 10:58:37] [INFO ] Deduced a trap composed of 34 places in 285 ms of which 1 ms to minimize.
[2023-03-20 10:58:38] [INFO ] Deduced a trap composed of 23 places in 249 ms of which 1 ms to minimize.
[2023-03-20 10:58:38] [INFO ] Deduced a trap composed of 61 places in 252 ms of which 2 ms to minimize.
[2023-03-20 10:58:38] [INFO ] Deduced a trap composed of 24 places in 238 ms of which 1 ms to minimize.
[2023-03-20 10:58:38] [INFO ] Deduced a trap composed of 21 places in 256 ms of which 1 ms to minimize.
[2023-03-20 10:58:39] [INFO ] Deduced a trap composed of 38 places in 199 ms of which 1 ms to minimize.
[2023-03-20 10:58:39] [INFO ] Deduced a trap composed of 36 places in 222 ms of which 1 ms to minimize.
[2023-03-20 10:58:39] [INFO ] Deduced a trap composed of 33 places in 203 ms of which 1 ms to minimize.
[2023-03-20 10:58:39] [INFO ] Deduced a trap composed of 46 places in 208 ms of which 0 ms to minimize.
[2023-03-20 10:58:40] [INFO ] Deduced a trap composed of 31 places in 197 ms of which 0 ms to minimize.
[2023-03-20 10:58:40] [INFO ] Deduced a trap composed of 44 places in 197 ms of which 1 ms to minimize.
[2023-03-20 10:58:40] [INFO ] Deduced a trap composed of 52 places in 180 ms of which 0 ms to minimize.
[2023-03-20 10:58:40] [INFO ] Deduced a trap composed of 57 places in 176 ms of which 1 ms to minimize.
[2023-03-20 10:58:41] [INFO ] Deduced a trap composed of 41 places in 259 ms of which 1 ms to minimize.
[2023-03-20 10:58:41] [INFO ] Deduced a trap composed of 57 places in 219 ms of which 1 ms to minimize.
[2023-03-20 10:58:41] [INFO ] Deduced a trap composed of 53 places in 182 ms of which 1 ms to minimize.
[2023-03-20 10:58:41] [INFO ] Deduced a trap composed of 42 places in 224 ms of which 1 ms to minimize.
[2023-03-20 10:58:42] [INFO ] Deduced a trap composed of 45 places in 169 ms of which 1 ms to minimize.
[2023-03-20 10:58:42] [INFO ] Deduced a trap composed of 60 places in 190 ms of which 1 ms to minimize.
[2023-03-20 10:58:42] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 5400 ms
[2023-03-20 10:58:43] [INFO ] Deduced a trap composed of 38 places in 180 ms of which 0 ms to minimize.
[2023-03-20 10:58:43] [INFO ] Deduced a trap composed of 38 places in 179 ms of which 1 ms to minimize.
[2023-03-20 10:58:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 555 ms
[2023-03-20 10:58:43] [INFO ] After 7877ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 655 ms.
[2023-03-20 10:58:44] [INFO ] After 9043ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 549 ms.
Support contains 16 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 15 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 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1484 place count 830 transition count 830
Iterating global reduction 2 with 2 rules applied. Total rules applied 1486 place count 830 transition count 830
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1486 place count 830 transition count 828
Deduced a syphon composed of 2 places in 11 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1490 place count 828 transition count 828
Performed 365 Post agglomeration using F-continuation condition.Transition count delta: 365
Deduced a syphon composed of 365 places in 1 ms
Reduce places removed 365 places and 0 transitions.
Iterating global reduction 2 with 730 rules applied. Total rules applied 2220 place count 463 transition count 463
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2221 place count 463 transition count 462
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 2223 place count 462 transition count 461
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -92
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 2425 place count 361 transition count 553
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 2455 place count 346 transition count 568
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2456 place count 346 transition count 567
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2458 place count 346 transition count 565
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2460 place count 344 transition count 565
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 2462 place count 344 transition count 563
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 2463 place count 344 transition count 563
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2464 place count 343 transition count 562
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2465 place count 342 transition count 562
Applied a total of 2465 rules in 788 ms. Remains 342 /1573 variables (removed 1231) and now considering 562/1573 (removed 1011) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 788 ms. Remains : 342/1573 places, 562/1573 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 442 ms. (steps per millisecond=22 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) 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
Running SMT prover for 6 properties.
// Phase 1: matrix 562 rows 342 cols
[2023-03-20 10:58:46] [INFO ] Computed 160 place invariants in 2 ms
[2023-03-20 10:58:46] [INFO ] [Real]Absence check using 160 positive place invariants in 30 ms returned sat
[2023-03-20 10:58:46] [INFO ] After 129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-20 10:58:46] [INFO ] [Nat]Absence check using 160 positive place invariants in 19 ms returned sat
[2023-03-20 10:58:47] [INFO ] After 252ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-20 10:58:47] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-20 10:58:47] [INFO ] After 74ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-20 10:58:47] [INFO ] After 254ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 83 ms.
[2023-03-20 10:58:47] [INFO ] After 741ms 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 152 ms.
Support contains 12 out of 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 562/562 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 342 transition count 561
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 341 transition count 561
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 340 transition count 560
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 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 9 place count 337 transition count 559
Applied a total of 9 rules in 54 ms. Remains 337 /342 variables (removed 5) and now considering 559/562 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 337/342 places, 559/562 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 360 ms. (steps per millisecond=27 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 559 rows 337 cols
[2023-03-20 10:58:48] [INFO ] Computed 160 place invariants in 7 ms
[2023-03-20 10:58:48] [INFO ] [Real]Absence check using 160 positive place invariants in 25 ms returned sat
[2023-03-20 10:58:48] [INFO ] After 190ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 10:58:48] [INFO ] [Nat]Absence check using 160 positive place invariants in 19 ms returned sat
[2023-03-20 10:58:48] [INFO ] After 196ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 10:58:48] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-20 10:58:49] [INFO ] After 85ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-20 10:58:49] [INFO ] After 254ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 78 ms.
[2023-03-20 10:58:49] [INFO ] After 647ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 120 ms.
Support contains 10 out of 337 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 337/337 places, 559/559 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 337 transition count 557
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 335 transition count 557
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 335 transition count 556
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 334 transition count 556
Applied a total of 6 rules in 29 ms. Remains 334 /337 variables (removed 3) and now considering 556/559 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 334/337 places, 556/559 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 332 ms. (steps per millisecond=30 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 5) seen :1
Running SMT prover for 4 properties.
// Phase 1: matrix 556 rows 334 cols
[2023-03-20 10:58:50] [INFO ] Computed 160 place invariants in 15 ms
[2023-03-20 10:58:50] [INFO ] [Real]Absence check using 160 positive place invariants in 29 ms returned sat
[2023-03-20 10:58:50] [INFO ] After 148ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 10:58:50] [INFO ] [Nat]Absence check using 160 positive place invariants in 22 ms returned sat
[2023-03-20 10:58:50] [INFO ] After 199ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 10:58:50] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-20 10:58:50] [INFO ] After 55ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-20 10:58:50] [INFO ] After 145ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 55 ms.
[2023-03-20 10:58:50] [INFO ] After 540ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 132 ms.
Support contains 8 out of 334 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 334/334 places, 556/556 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 334 transition count 554
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 332 transition count 554
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 331 transition count 553
Applied a total of 5 rules in 47 ms. Remains 331 /334 variables (removed 3) and now considering 553/556 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 331/334 places, 553/556 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 337 ms. (steps per millisecond=29 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 105751 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{0=1}
Probabilistic random walk after 105751 steps, saw 70894 distinct states, run finished after 3003 ms. (steps per millisecond=35 ) properties seen :1
Running SMT prover for 3 properties.
// Phase 1: matrix 553 rows 331 cols
[2023-03-20 10:58:54] [INFO ] Computed 160 place invariants in 4 ms
[2023-03-20 10:58:54] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 10:58:54] [INFO ] [Nat]Absence check using 160 positive place invariants in 29 ms returned sat
[2023-03-20 10:58:55] [INFO ] After 190ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 10:58:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 10:58:55] [INFO ] After 38ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-20 10:58:55] [INFO ] After 108ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 70 ms.
[2023-03-20 10:58:55] [INFO ] After 515ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 142 ms.
Support contains 4 out of 331 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 331/331 places, 553/553 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 331 transition count 552
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 330 transition count 552
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 330 transition count 551
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 329 transition count 551
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 12 place count 325 transition count 555
Applied a total of 12 rules in 20 ms. Remains 325 /331 variables (removed 6) and now considering 555/553 (removed -2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 325/331 places, 555/553 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 242 ms. (steps per millisecond=41 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) 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 3) seen :0
Interrupted probabilistic random walk after 379879 steps, run timeout after 3001 ms. (steps per millisecond=126 ) properties seen :{1=1, 2=1}
Probabilistic random walk after 379879 steps, saw 252823 distinct states, run finished after 3003 ms. (steps per millisecond=126 ) properties seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 555 rows 325 cols
[2023-03-20 10:58:58] [INFO ] Computed 160 place invariants in 7 ms
[2023-03-20 10:58:59] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 10:58:59] [INFO ] [Nat]Absence check using 160 positive place invariants in 31 ms returned sat
[2023-03-20 10:58:59] [INFO ] After 271ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 10:58:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-20 10:58:59] [INFO ] After 48ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 10:58:59] [INFO ] After 85ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-20 10:58:59] [INFO ] After 505ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 23 ms.
Support contains 2 out of 325 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 325/325 places, 555/555 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 325 transition count 554
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 324 transition count 554
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 324 transition count 553
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 323 transition count 553
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 322 transition count 552
Applied a total of 5 rules in 27 ms. Remains 322 /325 variables (removed 3) and now considering 552/555 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 322/325 places, 552/555 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 468246 steps, run timeout after 3001 ms. (steps per millisecond=156 ) properties seen :{}
Probabilistic random walk after 468246 steps, saw 309876 distinct states, run finished after 3018 ms. (steps per millisecond=155 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 552 rows 322 cols
[2023-03-20 10:59:02] [INFO ] Computed 160 place invariants in 5 ms
[2023-03-20 10:59:02] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 10:59:03] [INFO ] [Nat]Absence check using 160 positive place invariants in 26 ms returned sat
[2023-03-20 10:59:03] [INFO ] After 152ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 10:59:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 10:59:03] [INFO ] After 13ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 10:59:03] [INFO ] After 36ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-20 10:59:03] [INFO ] After 319ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 17 ms.
Support contains 2 out of 322 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 322/322 places, 552/552 transitions.
Applied a total of 0 rules in 7 ms. Remains 322 /322 variables (removed 0) and now considering 552/552 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 322/322 places, 552/552 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 322/322 places, 552/552 transitions.
Applied a total of 0 rules in 7 ms. Remains 322 /322 variables (removed 0) and now considering 552/552 (removed 0) transitions.
[2023-03-20 10:59:03] [INFO ] Invariant cache hit.
[2023-03-20 10:59:03] [INFO ] Implicit Places using invariants in 259 ms returned []
[2023-03-20 10:59:03] [INFO ] Invariant cache hit.
[2023-03-20 10:59:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 10:59:03] [INFO ] Implicit Places using invariants and state equation in 447 ms returned []
Implicit Place search using SMT with State Equation took 710 ms to find 0 implicit places.
[2023-03-20 10:59:04] [INFO ] Redundant transitions in 37 ms returned []
[2023-03-20 10:59:04] [INFO ] Invariant cache hit.
[2023-03-20 10:59:04] [INFO ] Dead Transitions using invariants and state equation in 325 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1100 ms. Remains : 322/322 places, 552/552 transitions.
Graph (trivial) has 157 edges and 322 vertex of which 4 / 322 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 1103 edges and 320 vertex of which 318 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 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 154 edges and 316 vertex of which 4 / 316 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 314 transition count 543
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 153 edges and 312 vertex of which 6 / 312 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 309 transition count 534
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 151 edges and 306 vertex of which 8 / 306 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 302 transition count 523
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 147 edges and 298 vertex of which 8 / 298 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 294 transition count 509
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 143 edges and 290 vertex of which 8 / 290 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 286 transition count 495
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 139 edges and 282 vertex of which 8 / 282 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 278 transition count 481
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 135 edges and 274 vertex of which 8 / 274 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 270 transition count 467
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 131 edges and 266 vertex of which 8 / 266 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 262 transition count 453
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 127 edges and 258 vertex of which 8 / 258 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 254 transition count 439
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 123 edges and 250 vertex of which 8 / 250 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 19 rules applied. Total rules applied 168 place count 246 transition count 425
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 119 edges and 242 vertex of which 8 / 242 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 187 place count 238 transition count 411
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 115 edges and 234 vertex of which 8 / 234 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 206 place count 230 transition count 397
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 111 edges and 226 vertex of which 8 / 226 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 225 place count 222 transition count 383
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 107 edges and 218 vertex of which 8 / 218 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 13 with 19 rules applied. Total rules applied 244 place count 214 transition count 369
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 103 edges and 210 vertex of which 8 / 210 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 14 with 19 rules applied. Total rules applied 263 place count 206 transition count 355
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 99 edges and 202 vertex of which 8 / 202 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 19 rules applied. Total rules applied 282 place count 198 transition count 341
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 95 edges and 194 vertex of which 8 / 194 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 16 with 19 rules applied. Total rules applied 301 place count 190 transition count 327
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 91 edges and 186 vertex of which 6 / 186 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 17 with 19 rules applied. Total rules applied 320 place count 183 transition count 313
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 87 edges and 180 vertex of which 4 / 180 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 18 with 14 rules applied. Total rules applied 334 place count 178 transition count 303
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 84 edges and 176 vertex of which 2 / 176 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 19 with 9 rules applied. Total rules applied 343 place count 175 transition count 297
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 20 with 5 rules applied. Total rules applied 348 place count 174 transition count 293
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 21 with 1 Pre rules applied. Total rules applied 348 place count 174 transition count 292
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 21 with 3 rules applied. Total rules applied 351 place count 172 transition count 292
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 2 places and 0 transitions.
Iterating global reduction 21 with 3 rules applied. Total rules applied 354 place count 170 transition count 291
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 81 edges and 170 vertex of which 2 / 170 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 21 with 4 rules applied. Total rules applied 358 place count 169 transition count 288
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 82 edges and 168 vertex of which 4 / 168 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 22 with 4 rules applied. Total rules applied 362 place count 166 transition count 286
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (trivial) has 80 edges and 164 vertex of which 2 / 164 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 23 with 8 rules applied. Total rules applied 370 place count 163 transition count 281
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (trivial) has 80 edges and 162 vertex of which 4 / 162 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 24 with 7 rules applied. Total rules applied 377 place count 160 transition count 276
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 79 edges and 158 vertex of which 6 / 158 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 25 with 12 rules applied. Total rules applied 389 place count 155 transition count 267
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 77 edges and 152 vertex of which 8 / 152 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 26 with 15 rules applied. Total rules applied 404 place count 148 transition count 256
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (complete) has 476 edges and 144 vertex of which 138 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Graph (trivial) has 70 edges and 138 vertex of which 8 / 138 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 27 with 21 rules applied. Total rules applied 425 place count 134 transition count 234
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 66 edges and 130 vertex of which 8 / 130 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 28 with 19 rules applied. Total rules applied 444 place count 126 transition count 220
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (trivial) has 62 edges and 122 vertex of which 8 / 122 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 29 with 18 rules applied. Total rules applied 462 place count 118 transition count 207
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 58 edges and 114 vertex of which 8 / 114 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 30 with 19 rules applied. Total rules applied 481 place count 110 transition count 193
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 54 edges and 107 vertex of which 6 / 107 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 31 with 18 rules applied. Total rules applied 499 place count 104 transition count 179
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 52 edges and 101 vertex of which 8 / 101 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 32 with 15 rules applied. Total rules applied 514 place count 97 transition count 168
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (trivial) has 48 edges and 93 vertex of which 8 / 93 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 33 with 20 rules applied. Total rules applied 534 place count 89 transition count 153
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 44 edges and 85 vertex of which 8 / 85 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 34 with 19 rules applied. Total rules applied 553 place count 81 transition count 139
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 40 edges and 77 vertex of which 8 / 77 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 35 with 19 rules applied. Total rules applied 572 place count 73 transition count 125
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 36 edges and 69 vertex of which 8 / 69 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 36 with 19 rules applied. Total rules applied 591 place count 65 transition count 111
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 32 edges and 61 vertex of which 8 / 61 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 37 with 19 rules applied. Total rules applied 610 place count 57 transition count 97
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 28 edges and 53 vertex of which 8 / 53 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 38 with 19 rules applied. Total rules applied 629 place count 49 transition count 83
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 24 edges and 45 vertex of which 8 / 45 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 39 with 19 rules applied. Total rules applied 648 place count 41 transition count 69
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 20 edges and 37 vertex of which 8 / 37 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 40 with 19 rules applied. Total rules applied 667 place count 33 transition count 55
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 16 edges and 29 vertex of which 8 / 29 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 41 with 19 rules applied. Total rules applied 686 place count 25 transition count 41
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 12 edges and 21 vertex of which 6 / 21 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 42 with 19 rules applied. Total rules applied 705 place count 18 transition count 27
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 8 edges and 15 vertex of which 4 / 15 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 43 with 14 rules applied. Total rules applied 719 place count 13 transition count 17
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 5 edges and 11 vertex of which 2 / 11 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 44 with 9 rules applied. Total rules applied 728 place count 10 transition count 11
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 45 with 5 rules applied. Total rules applied 733 place count 9 transition count 7
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 46 with 2 Pre rules applied. Total rules applied 733 place count 9 transition count 5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 46 with 5 rules applied. Total rules applied 738 place count 6 transition count 5
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 2 places and 0 transitions.
Iterating global reduction 46 with 3 rules applied. Total rules applied 741 place count 4 transition count 4
Applied a total of 741 rules in 109 ms. Remains 4 /322 variables (removed 318) and now considering 4/552 (removed 548) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 4 rows 4 cols
[2023-03-20 10:59:04] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-20 10:59:04] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 10:59:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-20 10:59:04] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 10:59:04] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-20 10:59:04] [INFO ] After 30ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
FORMULA ShieldRVt-PT-040B-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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 219 ms. Remains 1564 /1573 variables (removed 9) and now considering 1564/1573 (removed 9) transitions.
// Phase 1: matrix 1564 rows 1564 cols
[2023-03-20 10:59:05] [INFO ] Computed 161 place invariants in 14 ms
[2023-03-20 10:59:05] [INFO ] Implicit Places using invariants in 546 ms returned []
[2023-03-20 10:59:05] [INFO ] Invariant cache hit.
[2023-03-20 10:59:06] [INFO ] Implicit Places using invariants and state equation in 1194 ms returned []
Implicit Place search using SMT with State Equation took 1742 ms to find 0 implicit places.
[2023-03-20 10:59:06] [INFO ] Invariant cache hit.
[2023-03-20 10:59:07] [INFO ] Dead Transitions using invariants and state equation in 782 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 2747 ms. Remains : 1564/1573 places, 1564/1573 transitions.
Stuttering acceptance computed with spot in 351 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 2 ms.
FORMULA ShieldRVt-PT-040B-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLCardinality-03 finished in 3178 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 103 ms. Remains 1563 /1573 variables (removed 10) and now considering 1563/1573 (removed 10) transitions.
// Phase 1: matrix 1563 rows 1563 cols
[2023-03-20 10:59:08] [INFO ] Computed 161 place invariants in 9 ms
[2023-03-20 10:59:08] [INFO ] Implicit Places using invariants in 446 ms returned []
[2023-03-20 10:59:08] [INFO ] Invariant cache hit.
[2023-03-20 10:59:09] [INFO ] Implicit Places using invariants and state equation in 1185 ms returned []
Implicit Place search using SMT with State Equation took 1634 ms to find 0 implicit places.
[2023-03-20 10:59:09] [INFO ] Invariant cache hit.
[2023-03-20 10:59:10] [INFO ] Dead Transitions using invariants and state equation in 1058 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 2799 ms. Remains : 1563/1573 places, 1563/1573 transitions.
Stuttering acceptance computed with spot in 92 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]]
Stuttering criterion allowed to conclude after 72698 steps with 4 reset in 592 ms.
FORMULA ShieldRVt-PT-040B-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLCardinality-05 finished in 3512 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 105 ms. Remains 1561 /1573 variables (removed 12) and now considering 1561/1573 (removed 12) transitions.
// Phase 1: matrix 1561 rows 1561 cols
[2023-03-20 10:59:11] [INFO ] Computed 161 place invariants in 11 ms
[2023-03-20 10:59:11] [INFO ] Implicit Places using invariants in 468 ms returned []
[2023-03-20 10:59:12] [INFO ] Invariant cache hit.
[2023-03-20 10:59:13] [INFO ] Implicit Places using invariants and state equation in 1211 ms returned []
Implicit Place search using SMT with State Equation took 1690 ms to find 0 implicit places.
[2023-03-20 10:59:13] [INFO ] Invariant cache hit.
[2023-03-20 10:59:14] [INFO ] Dead Transitions using invariants and state equation in 1039 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 2837 ms. Remains : 1561/1573 places, 1561/1573 transitions.
Stuttering acceptance computed with spot in 120 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 30 reset in 422 ms.
Product exploration explored 100000 steps with 5 reset in 636 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 234 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 125 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 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 10:59:15] [INFO ] Invariant cache hit.
[2023-03-20 10:59:16] [INFO ] After 361ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 10:59:16] [INFO ] [Nat]Absence check using 161 positive place invariants in 56 ms returned sat
[2023-03-20 10:59:17] [INFO ] After 719ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 10:59:18] [INFO ] Deduced a trap composed of 20 places in 691 ms of which 2 ms to minimize.
[2023-03-20 10:59:18] [INFO ] Deduced a trap composed of 21 places in 380 ms of which 1 ms to minimize.
[2023-03-20 10:59:18] [INFO ] Deduced a trap composed of 32 places in 356 ms of which 0 ms to minimize.
[2023-03-20 10:59:19] [INFO ] Deduced a trap composed of 26 places in 379 ms of which 2 ms to minimize.
[2023-03-20 10:59:19] [INFO ] Deduced a trap composed of 26 places in 377 ms of which 1 ms to minimize.
[2023-03-20 10:59:20] [INFO ] Deduced a trap composed of 44 places in 366 ms of which 1 ms to minimize.
[2023-03-20 10:59:20] [INFO ] Deduced a trap composed of 29 places in 412 ms of which 2 ms to minimize.
[2023-03-20 10:59:21] [INFO ] Deduced a trap composed of 43 places in 321 ms of which 1 ms to minimize.
[2023-03-20 10:59:21] [INFO ] Deduced a trap composed of 25 places in 532 ms of which 2 ms to minimize.
[2023-03-20 10:59:22] [INFO ] Deduced a trap composed of 27 places in 396 ms of which 1 ms to minimize.
[2023-03-20 10:59:22] [INFO ] Deduced a trap composed of 42 places in 530 ms of which 2 ms to minimize.
[2023-03-20 10:59:23] [INFO ] Deduced a trap composed of 36 places in 416 ms of which 1 ms to minimize.
[2023-03-20 10:59:23] [INFO ] Deduced a trap composed of 40 places in 403 ms of which 1 ms to minimize.
[2023-03-20 10:59:24] [INFO ] Deduced a trap composed of 30 places in 350 ms of which 1 ms to minimize.
[2023-03-20 10:59:24] [INFO ] Deduced a trap composed of 48 places in 359 ms of which 1 ms to minimize.
[2023-03-20 10:59:25] [INFO ] Deduced a trap composed of 42 places in 332 ms of which 1 ms to minimize.
[2023-03-20 10:59:25] [INFO ] Deduced a trap composed of 42 places in 308 ms of which 1 ms to minimize.
[2023-03-20 10:59:25] [INFO ] Deduced a trap composed of 38 places in 371 ms of which 1 ms to minimize.
[2023-03-20 10:59:25] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 8518 ms
[2023-03-20 10:59:25] [INFO ] After 9324ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 68 ms.
[2023-03-20 10:59:26] [INFO ] After 9710ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 281 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=93 )
Parikh walk visited 1 properties in 4 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 450 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 87 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 93 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
[2023-03-20 10:59:26] [INFO ] Invariant cache hit.
[2023-03-20 10:59:27] [INFO ] [Real]Absence check using 161 positive place invariants in 130 ms returned sat
[2023-03-20 10:59:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 10:59:31] [INFO ] [Real]Absence check using state equation in 4092 ms returned sat
[2023-03-20 10:59:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 10:59:32] [INFO ] [Nat]Absence check using 161 positive place invariants in 121 ms returned sat
[2023-03-20 10:59:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 10:59:36] [INFO ] [Nat]Absence check using state equation in 4200 ms returned sat
[2023-03-20 10:59:36] [INFO ] Computed and/alt/rep : 1560/2281/1560 causal constraints (skipped 0 transitions) in 107 ms.
[2023-03-20 10:59:47] [INFO ] Deduced a trap composed of 12 places in 747 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-20 10:59:47] [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 56 ms. Remains 1561 /1561 variables (removed 0) and now considering 1561/1561 (removed 0) transitions.
[2023-03-20 10:59:47] [INFO ] Invariant cache hit.
[2023-03-20 10:59:47] [INFO ] Implicit Places using invariants in 389 ms returned []
[2023-03-20 10:59:47] [INFO ] Invariant cache hit.
[2023-03-20 10:59:48] [INFO ] Implicit Places using invariants and state equation in 1103 ms returned []
Implicit Place search using SMT with State Equation took 1506 ms to find 0 implicit places.
[2023-03-20 10:59:48] [INFO ] Invariant cache hit.
[2023-03-20 10:59:55] [INFO ] Dead Transitions using invariants and state equation in 6571 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8140 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 287 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 113 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Finished random walk after 7040 steps, including 2 resets, run visited all 3 properties in 50 ms. (steps per millisecond=140 )
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 320 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 119 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 131 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
[2023-03-20 10:59:56] [INFO ] Invariant cache hit.
[2023-03-20 10:59:57] [INFO ] [Real]Absence check using 161 positive place invariants in 153 ms returned sat
[2023-03-20 10:59:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 11:00:00] [INFO ] [Real]Absence check using state equation in 3544 ms returned sat
[2023-03-20 11:00:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 11:00:01] [INFO ] [Nat]Absence check using 161 positive place invariants in 117 ms returned sat
[2023-03-20 11:00:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 11:00:05] [INFO ] [Nat]Absence check using state equation in 3923 ms returned sat
[2023-03-20 11:00:05] [INFO ] Computed and/alt/rep : 1560/2281/1560 causal constraints (skipped 0 transitions) in 71 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java: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-20 11:00:16] [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 114 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Product exploration explored 100000 steps with 22 reset in 506 ms.
Product exploration explored 100000 steps with 11 reset in 666 ms.
Applying partial POR strategy [true, true, false]
Stuttering acceptance computed with spot in 113 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Support contains 4 out of 1561 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1561/1561 places, 1561/1561 transitions.
Performed 438 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 438 rules applied. Total rules applied 438 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 438 place count 1561 transition count 1721
Deduced a syphon composed of 598 places in 3 ms
Iterating global reduction 1 with 160 rules applied. Total rules applied 598 place count 1561 transition count 1721
Performed 475 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1073 places in 2 ms
Iterating global reduction 1 with 475 rules applied. Total rules applied 1073 place count 1561 transition count 1722
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1074 place count 1561 transition count 1721
Renaming transitions due to excessive name length > 1024 char.
Discarding 318 places :
Symmetric choice reduction at 2 with 318 rule applications. Total rules 1392 place count 1243 transition count 1403
Deduced a syphon composed of 755 places in 2 ms
Iterating global reduction 2 with 318 rules applied. Total rules applied 1710 place count 1243 transition count 1403
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 756 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1711 place count 1243 transition count 1403
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1713 place count 1241 transition count 1401
Deduced a syphon composed of 754 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1715 place count 1241 transition count 1401
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -721
Deduced a syphon composed of 855 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1816 place count 1241 transition count 2122
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 1917 place count 1140 transition count 1920
Deduced a syphon composed of 754 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2018 place count 1140 transition count 1920
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: -413
Deduced a syphon composed of 811 places in 0 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 2075 place count 1140 transition count 2333
Discarding 57 places :
Symmetric choice reduction at 2 with 57 rule applications. Total rules 2132 place count 1083 transition count 2219
Deduced a syphon composed of 754 places in 1 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 2189 place count 1083 transition count 2219
Deduced a syphon composed of 754 places in 0 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 2192 place count 1083 transition count 2216
Deduced a syphon composed of 754 places in 1 ms
Applied a total of 2192 rules in 802 ms. Remains 1083 /1561 variables (removed 478) and now considering 2216/1561 (removed -655) transitions.
[2023-03-20 11:00:18] [INFO ] Redundant transitions in 151 ms returned []
// Phase 1: matrix 2216 rows 1083 cols
[2023-03-20 11:00:18] [INFO ] Computed 161 place invariants in 8 ms
[2023-03-20 11:00:23] [INFO ] Dead Transitions using invariants and state equation in 5342 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1083/1561 places, 2216/1561 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6356 ms. Remains : 1083/1561 places, 2216/1561 transitions.
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 123 ms. Remains 1561 /1561 variables (removed 0) and now considering 1561/1561 (removed 0) transitions.
// Phase 1: matrix 1561 rows 1561 cols
[2023-03-20 11:00:24] [INFO ] Computed 161 place invariants in 7 ms
[2023-03-20 11:00:24] [INFO ] Implicit Places using invariants in 571 ms returned []
[2023-03-20 11:00:24] [INFO ] Invariant cache hit.
[2023-03-20 11:00:25] [INFO ] Implicit Places using invariants and state equation in 1141 ms returned []
Implicit Place search using SMT with State Equation took 1728 ms to find 0 implicit places.
[2023-03-20 11:00:25] [INFO ] Invariant cache hit.
[2023-03-20 11:00:26] [INFO ] Dead Transitions using invariants and state equation in 961 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2815 ms. Remains : 1561/1561 places, 1561/1561 transitions.
Treatment of property ShieldRVt-PT-040B-LTLCardinality-08 finished in 75545 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 0 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 1 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 173 ms. Remains 322 /1573 variables (removed 1251) and now considering 559/1573 (removed 1014) transitions.
// Phase 1: matrix 559 rows 322 cols
[2023-03-20 11:00:27] [INFO ] Computed 160 place invariants in 7 ms
[2023-03-20 11:00:27] [INFO ] Implicit Places using invariants in 210 ms returned []
[2023-03-20 11:00:27] [INFO ] Invariant cache hit.
[2023-03-20 11:00:27] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-20 11:00:27] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 557 ms to find 0 implicit places.
[2023-03-20 11:00:27] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-20 11:00:27] [INFO ] Invariant cache hit.
[2023-03-20 11:00:28] [INFO ] Dead Transitions using invariants and state equation in 280 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 1041 ms. Remains : 322/1573 places, 559/1573 transitions.
Stuttering acceptance computed with spot in 96 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 1 ms.
FORMULA ShieldRVt-PT-040B-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLCardinality-09 finished in 1166 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 2 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 2 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 185 ms. Remains 322 /1573 variables (removed 1251) and now considering 558/1573 (removed 1015) transitions.
// Phase 1: matrix 558 rows 322 cols
[2023-03-20 11:00:28] [INFO ] Computed 160 place invariants in 1 ms
[2023-03-20 11:00:28] [INFO ] Implicit Places using invariants in 180 ms returned []
[2023-03-20 11:00:28] [INFO ] Invariant cache hit.
[2023-03-20 11:00:28] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 494 ms to find 0 implicit places.
[2023-03-20 11:00:28] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-20 11:00:28] [INFO ] Invariant cache hit.
[2023-03-20 11:00:29] [INFO ] Dead Transitions using invariants and state equation in 243 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 937 ms. Remains : 322/1573 places, 558/1573 transitions.
Stuttering acceptance computed with spot in 59 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 35 reset in 768 ms.
Product exploration explored 100000 steps with 18 reset in 487 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 182 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 40 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 1) 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 1) seen :0
Finished probabilistic random walk after 27598 steps, run visited all 1 properties in 234 ms. (steps per millisecond=117 )
Probabilistic random walk after 27598 steps, saw 17184 distinct states, run finished after 234 ms. (steps per millisecond=117 ) 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 111 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 3014 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 181 ms. Remains 1561 /1573 variables (removed 12) and now considering 1561/1573 (removed 12) transitions.
// Phase 1: matrix 1561 rows 1561 cols
[2023-03-20 11:00:31] [INFO ] Computed 161 place invariants in 6 ms
[2023-03-20 11:00:31] [INFO ] Implicit Places using invariants in 605 ms returned []
[2023-03-20 11:00:31] [INFO ] Invariant cache hit.
[2023-03-20 11:00:32] [INFO ] Implicit Places using invariants and state equation in 1007 ms returned []
Implicit Place search using SMT with State Equation took 1616 ms to find 0 implicit places.
[2023-03-20 11:00:32] [INFO ] Invariant cache hit.
[2023-03-20 11:00:33] [INFO ] Dead Transitions using invariants and state equation in 729 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 2527 ms. Remains : 1561/1573 places, 1561/1573 transitions.
Stuttering acceptance computed with spot in 91 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 2649 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 141 ms. Remains 1561 /1573 variables (removed 12) and now considering 1561/1573 (removed 12) transitions.
[2023-03-20 11:00:33] [INFO ] Invariant cache hit.
[2023-03-20 11:00:34] [INFO ] Implicit Places using invariants in 407 ms returned []
[2023-03-20 11:00:34] [INFO ] Invariant cache hit.
[2023-03-20 11:00:35] [INFO ] Implicit Places using invariants and state equation in 1342 ms returned []
Implicit Place search using SMT with State Equation took 1774 ms to find 0 implicit places.
[2023-03-20 11:00:35] [INFO ] Invariant cache hit.
[2023-03-20 11:00:36] [INFO ] Dead Transitions using invariants and state equation in 886 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 2803 ms. Remains : 1561/1573 places, 1561/1573 transitions.
Stuttering acceptance computed with spot in 123 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 2 reset in 483 ms.
Product exploration explored 100000 steps with 3 reset in 569 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 327 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 137 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 225 ms. (steps per millisecond=44 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) 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 4) seen :0
Interrupted probabilistic random walk after 88584 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 88584 steps, saw 51377 distinct states, run finished after 3001 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-20 11:00:41] [INFO ] Invariant cache hit.
[2023-03-20 11:00:41] [INFO ] After 220ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2023-03-20 11:00:42] [INFO ] [Nat]Absence check using 161 positive place invariants in 45 ms returned sat
[2023-03-20 11:00:43] [INFO ] After 932ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-20 11:00:43] [INFO ] Deduced a trap composed of 21 places in 376 ms of which 2 ms to minimize.
[2023-03-20 11:00:43] [INFO ] Deduced a trap composed of 26 places in 289 ms of which 1 ms to minimize.
[2023-03-20 11:00:44] [INFO ] Deduced a trap composed of 33 places in 275 ms of which 1 ms to minimize.
[2023-03-20 11:00:44] [INFO ] Deduced a trap composed of 37 places in 427 ms of which 1 ms to minimize.
[2023-03-20 11:00:45] [INFO ] Deduced a trap composed of 27 places in 349 ms of which 1 ms to minimize.
[2023-03-20 11:00:45] [INFO ] Deduced a trap composed of 30 places in 381 ms of which 3 ms to minimize.
[2023-03-20 11:00:45] [INFO ] Deduced a trap composed of 25 places in 334 ms of which 1 ms to minimize.
[2023-03-20 11:00:46] [INFO ] Deduced a trap composed of 32 places in 333 ms of which 1 ms to minimize.
[2023-03-20 11:00:46] [INFO ] Deduced a trap composed of 25 places in 291 ms of which 1 ms to minimize.
[2023-03-20 11:00:47] [INFO ] Deduced a trap composed of 20 places in 453 ms of which 1 ms to minimize.
[2023-03-20 11:00:47] [INFO ] Deduced a trap composed of 48 places in 330 ms of which 1 ms to minimize.
[2023-03-20 11:00:47] [INFO ] Deduced a trap composed of 43 places in 255 ms of which 1 ms to minimize.
[2023-03-20 11:00:48] [INFO ] Deduced a trap composed of 36 places in 234 ms of which 1 ms to minimize.
[2023-03-20 11:00:48] [INFO ] Deduced a trap composed of 48 places in 225 ms of which 0 ms to minimize.
[2023-03-20 11:00:48] [INFO ] Deduced a trap composed of 35 places in 272 ms of which 0 ms to minimize.
[2023-03-20 11:00:48] [INFO ] Deduced a trap composed of 34 places in 226 ms of which 2 ms to minimize.
[2023-03-20 11:00:49] [INFO ] Deduced a trap composed of 44 places in 263 ms of which 1 ms to minimize.
[2023-03-20 11:00:49] [INFO ] Deduced a trap composed of 48 places in 228 ms of which 4 ms to minimize.
[2023-03-20 11:00:49] [INFO ] Deduced a trap composed of 44 places in 219 ms of which 1 ms to minimize.
[2023-03-20 11:00:50] [INFO ] Deduced a trap composed of 37 places in 223 ms of which 1 ms to minimize.
[2023-03-20 11:00:50] [INFO ] Deduced a trap composed of 41 places in 219 ms of which 1 ms to minimize.
[2023-03-20 11:00:50] [INFO ] Deduced a trap composed of 42 places in 231 ms of which 1 ms to minimize.
[2023-03-20 11:00:50] [INFO ] Deduced a trap composed of 42 places in 193 ms of which 1 ms to minimize.
[2023-03-20 11:00:51] [INFO ] Deduced a trap composed of 57 places in 186 ms of which 1 ms to minimize.
[2023-03-20 11:00:51] [INFO ] Deduced a trap composed of 56 places in 207 ms of which 0 ms to minimize.
[2023-03-20 11:00:51] [INFO ] Deduced a trap composed of 42 places in 190 ms of which 1 ms to minimize.
[2023-03-20 11:00:51] [INFO ] Deduced a trap composed of 53 places in 186 ms of which 1 ms to minimize.
[2023-03-20 11:00:52] [INFO ] Deduced a trap composed of 52 places in 185 ms of which 0 ms to minimize.
[2023-03-20 11:00:52] [INFO ] Deduced a trap composed of 53 places in 178 ms of which 0 ms to minimize.
[2023-03-20 11:00:52] [INFO ] Deduced a trap composed of 45 places in 225 ms of which 1 ms to minimize.
[2023-03-20 11:00:52] [INFO ] Deduced a trap composed of 47 places in 161 ms of which 2 ms to minimize.
[2023-03-20 11:00:52] [INFO ] Deduced a trap composed of 67 places in 153 ms of which 1 ms to minimize.
[2023-03-20 11:00:53] [INFO ] Deduced a trap composed of 56 places in 176 ms of which 1 ms to minimize.
[2023-03-20 11:00:53] [INFO ] Deduced a trap composed of 59 places in 141 ms of which 0 ms to minimize.
[2023-03-20 11:00:53] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 10311 ms
[2023-03-20 11:00:53] [INFO ] After 11481ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 133 ms.
[2023-03-20 11:00:53] [INFO ] After 11959ms 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 42 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 99 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 99 ms. Remains : 323/1561 places, 559/1561 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) 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 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
Finished probabilistic random walk after 14403 steps, run visited all 3 properties in 146 ms. (steps per millisecond=98 )
Probabilistic random walk after 14403 steps, saw 9198 distinct states, run finished after 148 ms. (steps per millisecond=97 ) 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 304 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 56 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 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 51 ms. Remains 1561 /1561 variables (removed 0) and now considering 1561/1561 (removed 0) transitions.
[2023-03-20 11:00:54] [INFO ] Invariant cache hit.
[2023-03-20 11:00:55] [INFO ] Implicit Places using invariants in 292 ms returned []
[2023-03-20 11:00:55] [INFO ] Invariant cache hit.
[2023-03-20 11:00:56] [INFO ] Implicit Places using invariants and state equation in 1095 ms returned []
Implicit Place search using SMT with State Equation took 1413 ms to find 0 implicit places.
[2023-03-20 11:00:56] [INFO ] Invariant cache hit.
[2023-03-20 11:00:57] [INFO ] Dead Transitions using invariants and state equation in 837 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2304 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 136 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 84 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 261541 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :{}
Probabilistic random walk after 261541 steps, saw 124314 distinct states, run finished after 3002 ms. (steps per millisecond=87 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 11:01:00] [INFO ] Invariant cache hit.
[2023-03-20 11:01:00] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 11:01:00] [INFO ] [Nat]Absence check using 161 positive place invariants in 44 ms returned sat
[2023-03-20 11:01:01] [INFO ] After 606ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 11:01:01] [INFO ] Deduced a trap composed of 21 places in 366 ms of which 1 ms to minimize.
[2023-03-20 11:01:02] [INFO ] Deduced a trap composed of 26 places in 328 ms of which 1 ms to minimize.
[2023-03-20 11:01:02] [INFO ] Deduced a trap composed of 33 places in 308 ms of which 1 ms to minimize.
[2023-03-20 11:01:02] [INFO ] Deduced a trap composed of 37 places in 261 ms of which 1 ms to minimize.
[2023-03-20 11:01:03] [INFO ] Deduced a trap composed of 27 places in 360 ms of which 1 ms to minimize.
[2023-03-20 11:01:03] [INFO ] Deduced a trap composed of 30 places in 351 ms of which 1 ms to minimize.
[2023-03-20 11:01:04] [INFO ] Deduced a trap composed of 25 places in 328 ms of which 1 ms to minimize.
[2023-03-20 11:01:04] [INFO ] Deduced a trap composed of 32 places in 325 ms of which 1 ms to minimize.
[2023-03-20 11:01:04] [INFO ] Deduced a trap composed of 25 places in 320 ms of which 1 ms to minimize.
[2023-03-20 11:01:05] [INFO ] Deduced a trap composed of 20 places in 320 ms of which 1 ms to minimize.
[2023-03-20 11:01:05] [INFO ] Deduced a trap composed of 48 places in 456 ms of which 1 ms to minimize.
[2023-03-20 11:01:06] [INFO ] Deduced a trap composed of 43 places in 273 ms of which 1 ms to minimize.
[2023-03-20 11:01:06] [INFO ] Deduced a trap composed of 36 places in 289 ms of which 1 ms to minimize.
[2023-03-20 11:01:07] [INFO ] Deduced a trap composed of 48 places in 443 ms of which 1 ms to minimize.
[2023-03-20 11:01:07] [INFO ] Deduced a trap composed of 35 places in 285 ms of which 1 ms to minimize.
[2023-03-20 11:01:07] [INFO ] Deduced a trap composed of 34 places in 287 ms of which 1 ms to minimize.
[2023-03-20 11:01:08] [INFO ] Deduced a trap composed of 44 places in 244 ms of which 1 ms to minimize.
[2023-03-20 11:01:08] [INFO ] Deduced a trap composed of 48 places in 281 ms of which 1 ms to minimize.
[2023-03-20 11:01:08] [INFO ] Deduced a trap composed of 44 places in 223 ms of which 1 ms to minimize.
[2023-03-20 11:01:09] [INFO ] Deduced a trap composed of 37 places in 242 ms of which 1 ms to minimize.
[2023-03-20 11:01:09] [INFO ] Deduced a trap composed of 41 places in 214 ms of which 1 ms to minimize.
[2023-03-20 11:01:09] [INFO ] Deduced a trap composed of 42 places in 221 ms of which 1 ms to minimize.
[2023-03-20 11:01:09] [INFO ] Deduced a trap composed of 42 places in 240 ms of which 0 ms to minimize.
[2023-03-20 11:01:10] [INFO ] Deduced a trap composed of 57 places in 226 ms of which 1 ms to minimize.
[2023-03-20 11:01:10] [INFO ] Deduced a trap composed of 56 places in 212 ms of which 1 ms to minimize.
[2023-03-20 11:01:10] [INFO ] Deduced a trap composed of 42 places in 210 ms of which 0 ms to minimize.
[2023-03-20 11:01:10] [INFO ] Deduced a trap composed of 53 places in 266 ms of which 1 ms to minimize.
[2023-03-20 11:01:11] [INFO ] Deduced a trap composed of 52 places in 230 ms of which 1 ms to minimize.
[2023-03-20 11:01:11] [INFO ] Deduced a trap composed of 53 places in 225 ms of which 1 ms to minimize.
[2023-03-20 11:01:11] [INFO ] Deduced a trap composed of 45 places in 263 ms of which 0 ms to minimize.
[2023-03-20 11:01:12] [INFO ] Deduced a trap composed of 47 places in 276 ms of which 0 ms to minimize.
[2023-03-20 11:01:12] [INFO ] Deduced a trap composed of 67 places in 325 ms of which 1 ms to minimize.
[2023-03-20 11:01:12] [INFO ] Deduced a trap composed of 56 places in 279 ms of which 1 ms to minimize.
[2023-03-20 11:01:13] [INFO ] Deduced a trap composed of 59 places in 272 ms of which 1 ms to minimize.
[2023-03-20 11:01:13] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 12075 ms
[2023-03-20 11:01:13] [INFO ] After 12743ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 76 ms.
[2023-03-20 11:01:13] [INFO ] After 13021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 17 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 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 197 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 198 ms. Remains : 323/1561 places, 559/1561 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Finished probabilistic random walk after 14403 steps, run visited all 1 properties in 118 ms. (steps per millisecond=122 )
Probabilistic random walk after 14403 steps, saw 9198 distinct states, run finished after 118 ms. (steps per millisecond=122 ) 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 298 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 166 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 142 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2 reset in 542 ms.
Product exploration explored 100000 steps with 0 reset in 615 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 176 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 2 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 2 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 2 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 1 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 1 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 0 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 1 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 601 ms. Remains 1081 /1561 variables (removed 480) and now considering 2225/1561 (removed -664) transitions.
[2023-03-20 11:01:16] [INFO ] Redundant transitions in 61 ms returned []
// Phase 1: matrix 2225 rows 1081 cols
[2023-03-20 11:01:16] [INFO ] Computed 161 place invariants in 25 ms
[2023-03-20 11:01:18] [INFO ] Dead Transitions using invariants and state equation in 1155 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 1831 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 55 ms. Remains 1561 /1561 variables (removed 0) and now considering 1561/1561 (removed 0) transitions.
// Phase 1: matrix 1561 rows 1561 cols
[2023-03-20 11:01:18] [INFO ] Computed 161 place invariants in 7 ms
[2023-03-20 11:01:18] [INFO ] Implicit Places using invariants in 305 ms returned []
[2023-03-20 11:01:18] [INFO ] Invariant cache hit.
[2023-03-20 11:01:19] [INFO ] Implicit Places using invariants and state equation in 1037 ms returned []
Implicit Place search using SMT with State Equation took 1356 ms to find 0 implicit places.
[2023-03-20 11:01:19] [INFO ] Invariant cache hit.
[2023-03-20 11:01:20] [INFO ] Dead Transitions using invariants and state equation in 1102 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2515 ms. Remains : 1561/1561 places, 1561/1561 transitions.
Treatment of property ShieldRVt-PT-040B-LTLCardinality-13 finished in 46840 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 131 ms. Remains 1564 /1573 variables (removed 9) and now considering 1564/1573 (removed 9) transitions.
// Phase 1: matrix 1564 rows 1564 cols
[2023-03-20 11:01:20] [INFO ] Computed 161 place invariants in 10 ms
[2023-03-20 11:01:21] [INFO ] Implicit Places using invariants in 507 ms returned []
[2023-03-20 11:01:21] [INFO ] Invariant cache hit.
[2023-03-20 11:01:22] [INFO ] Implicit Places using invariants and state equation in 1239 ms returned []
Implicit Place search using SMT with State Equation took 1748 ms to find 0 implicit places.
[2023-03-20 11:01:22] [INFO ] Invariant cache hit.
[2023-03-20 11:01:23] [INFO ] Dead Transitions using invariants and state equation in 749 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 2642 ms. Remains : 1564/1573 places, 1564/1573 transitions.
Stuttering acceptance computed with spot in 153 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 30367 steps with 0 reset in 183 ms.
FORMULA ShieldRVt-PT-040B-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLCardinality-14 finished in 3031 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))))))'
Found a Shortening insensitive property : ShieldRVt-PT-040B-LTLCardinality-08
Stuttering acceptance computed with spot in 166 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Support contains 4 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 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 312 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 312 Pre rules applied. Total rules applied 872 place count 1136 transition count 824
Deduced a syphon composed of 312 places in 1 ms
Reduce places removed 312 places and 0 transitions.
Iterating global reduction 2 with 624 rules applied. Total rules applied 1496 place count 824 transition count 824
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 1506 place count 814 transition count 814
Iterating global reduction 2 with 10 rules applied. Total rules applied 1516 place count 814 transition count 814
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 1516 place count 814 transition count 804
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 1536 place count 804 transition count 804
Performed 355 Post agglomeration using F-continuation condition.Transition count delta: 355
Deduced a syphon composed of 355 places in 0 ms
Reduce places removed 355 places and 0 transitions.
Iterating global reduction 2 with 710 rules applied. Total rules applied 2246 place count 449 transition count 449
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2247 place count 449 transition count 448
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 2249 place count 448 transition count 447
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 2451 place count 347 transition count 547
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 2485 place count 330 transition count 563
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2487 place count 328 transition count 561
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2488 place count 327 transition count 561
Applied a total of 2488 rules in 203 ms. Remains 327 /1573 variables (removed 1246) and now considering 561/1573 (removed 1012) transitions.
// Phase 1: matrix 561 rows 327 cols
[2023-03-20 11:01:24] [INFO ] Computed 160 place invariants in 3 ms
[2023-03-20 11:01:24] [INFO ] Implicit Places using invariants in 338 ms returned []
[2023-03-20 11:01:24] [INFO ] Invariant cache hit.
[2023-03-20 11:01:24] [INFO ] State equation strengthened by 234 read => feed constraints.
[2023-03-20 11:01:25] [INFO ] Implicit Places using invariants and state equation in 1250 ms returned []
Implicit Place search using SMT with State Equation took 1591 ms to find 0 implicit places.
[2023-03-20 11:01:25] [INFO ] Invariant cache hit.
[2023-03-20 11:01:26] [INFO ] Dead Transitions using invariants and state equation in 292 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 327/1573 places, 561/1573 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2113 ms. Remains : 327/1573 places, 561/1573 transitions.
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 s176 0) (EQ s184 1)), p0:(AND (NEQ s117 0) (NEQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
Treatment of property ShieldRVt-PT-040B-LTLCardinality-08 finished in 2444 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
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 135 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 2 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 1 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 0 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 304 ms. Remains 323 /1573 variables (removed 1250) and now considering 560/1573 (removed 1013) transitions.
// Phase 1: matrix 560 rows 323 cols
[2023-03-20 11:01:26] [INFO ] Computed 160 place invariants in 2 ms
[2023-03-20 11:01:26] [INFO ] Implicit Places using invariants in 263 ms returned []
[2023-03-20 11:01:26] [INFO ] Invariant cache hit.
[2023-03-20 11:01:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 11:01:27] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 682 ms to find 0 implicit places.
[2023-03-20 11:01:27] [INFO ] Invariant cache hit.
[2023-03-20 11:01:27] [INFO ] Dead Transitions using invariants and state equation in 296 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 1285 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 32 reset in 573 ms.
Product exploration explored 100000 steps with 18 reset in 590 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 400 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 132 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 307 ms. (steps per millisecond=32 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 410210 steps, run timeout after 3001 ms. (steps per millisecond=136 ) properties seen :{0=1, 1=1, 3=1}
Probabilistic random walk after 410210 steps, saw 262488 distinct states, run finished after 3001 ms. (steps per millisecond=136 ) properties seen :3
Running SMT prover for 1 properties.
[2023-03-20 11:01:32] [INFO ] Invariant cache hit.
[2023-03-20 11:01:32] [INFO ] After 67ms 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 444 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 67 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 92 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 4 ms. Remains 323 /323 variables (removed 0) and now considering 560/560 (removed 0) transitions.
[2023-03-20 11:01:33] [INFO ] Invariant cache hit.
[2023-03-20 11:01:33] [INFO ] Implicit Places using invariants in 190 ms returned []
[2023-03-20 11:01:33] [INFO ] Invariant cache hit.
[2023-03-20 11:01:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 11:01:34] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 581 ms to find 0 implicit places.
[2023-03-20 11:01:34] [INFO ] Invariant cache hit.
[2023-03-20 11:01:34] [INFO ] Dead Transitions using invariants and state equation in 229 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 833 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 103 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 55 ms :[true, (NOT p0), (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 10000 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 378 ms. (steps per millisecond=163 )
Probabilistic random walk after 61648 steps, saw 42051 distinct states, run finished after 380 ms. (steps per millisecond=162 ) 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 66 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 34 reset in 387 ms.
Product exploration explored 100000 steps with 25 reset in 499 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 100 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 9 ms. Remains 323 /323 variables (removed 0) and now considering 560/560 (removed 0) transitions.
[2023-03-20 11:01:36] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-20 11:01:36] [INFO ] Invariant cache hit.
[2023-03-20 11:01:36] [INFO ] Dead Transitions using invariants and state equation in 328 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 354 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-20 11:01:36] [INFO ] Invariant cache hit.
[2023-03-20 11:01:37] [INFO ] Implicit Places using invariants in 200 ms returned []
[2023-03-20 11:01:37] [INFO ] Invariant cache hit.
[2023-03-20 11:01:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 11:01:37] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 614 ms to find 0 implicit places.
[2023-03-20 11:01:37] [INFO ] Invariant cache hit.
[2023-03-20 11:01:37] [INFO ] Dead Transitions using invariants and state equation in 232 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 851 ms. Remains : 323/323 places, 560/560 transitions.
Treatment of property ShieldRVt-PT-040B-LTLCardinality-13 finished in 11628 ms.
[2023-03-20 11:01:37] [INFO ] Flatten gal took : 50 ms
[2023-03-20 11:01:37] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-20 11:01:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1573 places, 1573 transitions and 3866 arcs took 9 ms.
Total runtime 187768 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1863/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1863/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldRVt-PT-040B-LTLCardinality-08
Could not compute solution for formula : ShieldRVt-PT-040B-LTLCardinality-13

BK_STOP 1679310099819

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

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

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="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is ShieldRVt-PT-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 r425-tajo-167905978000315"
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 ;