Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r391-oct2-167903715100284.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is ShieldIIPt-PT-020B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r391-oct2-167903715100284
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 724K
-rw-r--r-- 1 mcc users 7.9K Feb 25 17:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 17:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 17:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 17:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 25 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 17:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 17:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 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 338K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPt-PT-020B-LTLFireability-00
FORMULA_NAME ShieldIIPt-PT-020B-LTLFireability-01
FORMULA_NAME ShieldIIPt-PT-020B-LTLFireability-02
FORMULA_NAME ShieldIIPt-PT-020B-LTLFireability-03
FORMULA_NAME ShieldIIPt-PT-020B-LTLFireability-04
FORMULA_NAME ShieldIIPt-PT-020B-LTLFireability-05
FORMULA_NAME ShieldIIPt-PT-020B-LTLFireability-06
FORMULA_NAME ShieldIIPt-PT-020B-LTLFireability-07
FORMULA_NAME ShieldIIPt-PT-020B-LTLFireability-08
FORMULA_NAME ShieldIIPt-PT-020B-LTLFireability-09
FORMULA_NAME ShieldIIPt-PT-020B-LTLFireability-10
FORMULA_NAME ShieldIIPt-PT-020B-LTLFireability-11
FORMULA_NAME ShieldIIPt-PT-020B-LTLFireability-12
FORMULA_NAME ShieldIIPt-PT-020B-LTLFireability-13
FORMULA_NAME ShieldIIPt-PT-020B-LTLFireability-14
FORMULA_NAME ShieldIIPt-PT-020B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679271493294

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-020B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 00:18:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 00:18:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 00:18:15] [INFO ] Load time of PNML (sax parser for PT used): 244 ms
[2023-03-20 00:18:15] [INFO ] Transformed 1403 places.
[2023-03-20 00:18:15] [INFO ] Transformed 1303 transitions.
[2023-03-20 00:18:15] [INFO ] Found NUPN structural information;
[2023-03-20 00:18:15] [INFO ] Parsed PT model containing 1403 places and 1303 transitions and 3246 arcs in 353 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldIIPt-PT-020B-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-020B-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 1403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1403/1403 places, 1303/1303 transitions.
Discarding 211 places :
Symmetric choice reduction at 0 with 211 rule applications. Total rules 211 place count 1192 transition count 1092
Iterating global reduction 0 with 211 rules applied. Total rules applied 422 place count 1192 transition count 1092
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 423 place count 1191 transition count 1091
Iterating global reduction 0 with 1 rules applied. Total rules applied 424 place count 1191 transition count 1091
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 425 place count 1190 transition count 1090
Iterating global reduction 0 with 1 rules applied. Total rules applied 426 place count 1190 transition count 1090
Applied a total of 426 rules in 503 ms. Remains 1190 /1403 variables (removed 213) and now considering 1090/1303 (removed 213) transitions.
// Phase 1: matrix 1090 rows 1190 cols
[2023-03-20 00:18:16] [INFO ] Computed 181 place invariants in 32 ms
[2023-03-20 00:18:16] [INFO ] Implicit Places using invariants in 595 ms returned []
[2023-03-20 00:18:16] [INFO ] Invariant cache hit.
[2023-03-20 00:18:18] [INFO ] Implicit Places using invariants and state equation in 1267 ms returned []
Implicit Place search using SMT with State Equation took 1911 ms to find 0 implicit places.
[2023-03-20 00:18:18] [INFO ] Invariant cache hit.
[2023-03-20 00:18:18] [INFO ] Dead Transitions using invariants and state equation in 678 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1190/1403 places, 1090/1303 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3094 ms. Remains : 1190/1403 places, 1090/1303 transitions.
Support contains 40 out of 1190 places after structural reductions.
[2023-03-20 00:18:19] [INFO ] Flatten gal took : 110 ms
[2023-03-20 00:18:19] [INFO ] Flatten gal took : 57 ms
[2023-03-20 00:18:19] [INFO ] Input system was already deterministic with 1090 transitions.
Support contains 37 out of 1190 places (down from 40) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 407 ms. (steps per millisecond=24 ) properties (out of 30) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 14) 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 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 14) 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 14) 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 14) 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 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 14) 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 14) 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 14) 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 14) seen :0
Running SMT prover for 14 properties.
[2023-03-20 00:18:20] [INFO ] Invariant cache hit.
[2023-03-20 00:18:20] [INFO ] [Real]Absence check using 181 positive place invariants in 157 ms returned sat
[2023-03-20 00:18:21] [INFO ] After 937ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-20 00:18:22] [INFO ] [Nat]Absence check using 181 positive place invariants in 96 ms returned sat
[2023-03-20 00:18:24] [INFO ] After 1586ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-20 00:18:24] [INFO ] Deduced a trap composed of 24 places in 294 ms of which 5 ms to minimize.
[2023-03-20 00:18:24] [INFO ] Deduced a trap composed of 30 places in 278 ms of which 1 ms to minimize.
[2023-03-20 00:18:25] [INFO ] Deduced a trap composed of 23 places in 238 ms of which 1 ms to minimize.
[2023-03-20 00:18:25] [INFO ] Deduced a trap composed of 21 places in 287 ms of which 3 ms to minimize.
[2023-03-20 00:18:25] [INFO ] Deduced a trap composed of 25 places in 237 ms of which 1 ms to minimize.
[2023-03-20 00:18:26] [INFO ] Deduced a trap composed of 33 places in 217 ms of which 1 ms to minimize.
[2023-03-20 00:18:26] [INFO ] Deduced a trap composed of 32 places in 214 ms of which 1 ms to minimize.
[2023-03-20 00:18:26] [INFO ] Deduced a trap composed of 29 places in 247 ms of which 1 ms to minimize.
[2023-03-20 00:18:27] [INFO ] Deduced a trap composed of 28 places in 221 ms of which 1 ms to minimize.
[2023-03-20 00:18:27] [INFO ] Deduced a trap composed of 24 places in 145 ms of which 1 ms to minimize.
[2023-03-20 00:18:27] [INFO ] Deduced a trap composed of 34 places in 167 ms of which 0 ms to minimize.
[2023-03-20 00:18:27] [INFO ] Deduced a trap composed of 20 places in 165 ms of which 1 ms to minimize.
[2023-03-20 00:18:27] [INFO ] Deduced a trap composed of 19 places in 188 ms of which 1 ms to minimize.
[2023-03-20 00:18:28] [INFO ] Deduced a trap composed of 18 places in 193 ms of which 0 ms to minimize.
[2023-03-20 00:18:28] [INFO ] Deduced a trap composed of 19 places in 180 ms of which 0 ms to minimize.
[2023-03-20 00:18:28] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 1 ms to minimize.
[2023-03-20 00:18:28] [INFO ] Deduced a trap composed of 26 places in 148 ms of which 0 ms to minimize.
[2023-03-20 00:18:28] [INFO ] Deduced a trap composed of 13 places in 172 ms of which 0 ms to minimize.
[2023-03-20 00:18:29] [INFO ] Deduced a trap composed of 26 places in 176 ms of which 0 ms to minimize.
[2023-03-20 00:18:29] [INFO ] Deduced a trap composed of 27 places in 191 ms of which 1 ms to minimize.
[2023-03-20 00:18:29] [INFO ] Deduced a trap composed of 25 places in 183 ms of which 0 ms to minimize.
[2023-03-20 00:18:29] [INFO ] Deduced a trap composed of 33 places in 218 ms of which 13 ms to minimize.
[2023-03-20 00:18:30] [INFO ] Deduced a trap composed of 32 places in 144 ms of which 1 ms to minimize.
[2023-03-20 00:18:30] [INFO ] Deduced a trap composed of 31 places in 170 ms of which 1 ms to minimize.
[2023-03-20 00:18:30] [INFO ] Deduced a trap composed of 25 places in 485 ms of which 1 ms to minimize.
[2023-03-20 00:18:31] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 0 ms to minimize.
[2023-03-20 00:18:31] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 6852 ms
[2023-03-20 00:18:31] [INFO ] Deduced a trap composed of 36 places in 146 ms of which 0 ms to minimize.
[2023-03-20 00:18:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 271 ms
[2023-03-20 00:18:32] [INFO ] Deduced a trap composed of 28 places in 179 ms of which 1 ms to minimize.
[2023-03-20 00:18:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 314 ms
[2023-03-20 00:18:32] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 2 ms to minimize.
[2023-03-20 00:18:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 250 ms
[2023-03-20 00:18:33] [INFO ] After 10537ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 1037 ms.
[2023-03-20 00:18:34] [INFO ] After 13043ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Fused 14 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 709 ms.
Support contains 21 out of 1190 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1190/1190 places, 1090/1090 transitions.
Drop transitions removed 226 transitions
Trivial Post-agglo rules discarded 226 transitions
Performed 226 trivial Post agglomeration. Transition count delta: 226
Iterating post reduction 0 with 226 rules applied. Total rules applied 226 place count 1190 transition count 864
Reduce places removed 226 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 230 rules applied. Total rules applied 456 place count 964 transition count 860
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 460 place count 960 transition count 860
Performed 150 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 150 Pre rules applied. Total rules applied 460 place count 960 transition count 710
Deduced a syphon composed of 150 places in 1 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 3 with 300 rules applied. Total rules applied 760 place count 810 transition count 710
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 763 place count 807 transition count 707
Iterating global reduction 3 with 3 rules applied. Total rules applied 766 place count 807 transition count 707
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 766 place count 807 transition count 704
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 772 place count 804 transition count 704
Performed 343 Post agglomeration using F-continuation condition.Transition count delta: 343
Deduced a syphon composed of 343 places in 1 ms
Reduce places removed 343 places and 0 transitions.
Iterating global reduction 3 with 686 rules applied. Total rules applied 1458 place count 461 transition count 361
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1459 place count 461 transition count 360
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1461 place count 460 transition count 359
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 4 with 104 rules applied. Total rules applied 1565 place count 408 transition count 388
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1566 place count 408 transition count 387
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1568 place count 408 transition count 385
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1570 place count 406 transition count 385
Partial Free-agglomeration rule applied 20 times.
Drop transitions removed 20 transitions
Iterating global reduction 6 with 20 rules applied. Total rules applied 1590 place count 406 transition count 385
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1591 place count 405 transition count 384
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1593 place count 403 transition count 384
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1593 place count 403 transition count 383
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1595 place count 402 transition count 383
Applied a total of 1595 rules in 196 ms. Remains 402 /1190 variables (removed 788) and now considering 383/1090 (removed 707) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 196 ms. Remains : 402/1190 places, 383/1090 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 308 ms. (steps per millisecond=32 ) properties (out of 14) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 9) 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 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 383 rows 402 cols
[2023-03-20 00:18:35] [INFO ] Computed 179 place invariants in 2 ms
[2023-03-20 00:18:36] [INFO ] [Real]Absence check using 179 positive place invariants in 25 ms returned sat
[2023-03-20 00:18:36] [INFO ] After 591ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-20 00:18:36] [INFO ] [Nat]Absence check using 179 positive place invariants in 74 ms returned sat
[2023-03-20 00:18:37] [INFO ] After 392ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-20 00:18:37] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-20 00:18:37] [INFO ] After 228ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-20 00:18:37] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 1 ms to minimize.
[2023-03-20 00:18:37] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2023-03-20 00:18:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 205 ms
[2023-03-20 00:18:37] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 1 ms to minimize.
[2023-03-20 00:18:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2023-03-20 00:18:38] [INFO ] After 842ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 245 ms.
[2023-03-20 00:18:38] [INFO ] After 1755ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 94 ms.
Support contains 15 out of 402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 402/402 places, 383/383 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 402 transition count 382
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 401 transition count 382
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 401 transition count 379
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 398 transition count 379
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 395 transition count 383
Applied a total of 14 rules in 41 ms. Remains 395 /402 variables (removed 7) and now considering 383/383 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 395/402 places, 383/383 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 312 ms. (steps per millisecond=32 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) 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 8) 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 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 383 rows 395 cols
[2023-03-20 00:18:39] [INFO ] Computed 179 place invariants in 1 ms
[2023-03-20 00:18:39] [INFO ] [Real]Absence check using 179 positive place invariants in 36 ms returned sat
[2023-03-20 00:18:39] [INFO ] After 477ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-20 00:18:39] [INFO ] [Nat]Absence check using 179 positive place invariants in 130 ms returned sat
[2023-03-20 00:18:40] [INFO ] After 464ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-20 00:18:40] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-20 00:18:40] [INFO ] After 249ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-20 00:18:40] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2023-03-20 00:18:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2023-03-20 00:18:41] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-20 00:18:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2023-03-20 00:18:41] [INFO ] After 758ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 166 ms.
[2023-03-20 00:18:41] [INFO ] After 1786ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 71 ms.
Support contains 12 out of 395 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 395/395 places, 383/383 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 395 transition count 381
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 393 transition count 381
Applied a total of 4 rules in 11 ms. Remains 393 /395 variables (removed 2) and now considering 381/383 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 393/395 places, 381/383 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 8) 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 8) 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 8) 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 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 42 ms. (steps per millisecond=238 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 153250 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 153250 steps, saw 96908 distinct states, run finished after 3004 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 381 rows 393 cols
[2023-03-20 00:18:44] [INFO ] Computed 179 place invariants in 1 ms
[2023-03-20 00:18:45] [INFO ] [Real]Absence check using 179 positive place invariants in 59 ms returned sat
[2023-03-20 00:18:45] [INFO ] After 236ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:6
[2023-03-20 00:18:45] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-20 00:18:45] [INFO ] After 74ms SMT Verify possible using 4 Read/Feed constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-20 00:18:45] [INFO ] After 590ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-20 00:18:45] [INFO ] [Nat]Absence check using 179 positive place invariants in 109 ms returned sat
[2023-03-20 00:18:46] [INFO ] After 332ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-20 00:18:46] [INFO ] After 151ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-20 00:18:46] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2023-03-20 00:18:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2023-03-20 00:18:46] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 13 ms to minimize.
[2023-03-20 00:18:46] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2023-03-20 00:18:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 177 ms
[2023-03-20 00:18:46] [INFO ] After 640ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 251 ms.
[2023-03-20 00:18:47] [INFO ] After 1611ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 92 ms.
Support contains 12 out of 393 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 381/381 transitions.
Applied a total of 0 rules in 24 ms. Remains 393 /393 variables (removed 0) and now considering 381/381 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 393/393 places, 381/381 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 381/381 transitions.
Applied a total of 0 rules in 11 ms. Remains 393 /393 variables (removed 0) and now considering 381/381 (removed 0) transitions.
[2023-03-20 00:18:47] [INFO ] Invariant cache hit.
[2023-03-20 00:18:47] [INFO ] Implicit Places using invariants in 198 ms returned [382]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 200 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 392/393 places, 381/381 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 391 transition count 380
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 391 transition count 380
Applied a total of 2 rules in 12 ms. Remains 391 /392 variables (removed 1) and now considering 380/381 (removed 1) transitions.
// Phase 1: matrix 380 rows 391 cols
[2023-03-20 00:18:47] [INFO ] Computed 178 place invariants in 2 ms
[2023-03-20 00:18:47] [INFO ] Implicit Places using invariants in 202 ms returned []
[2023-03-20 00:18:47] [INFO ] Invariant cache hit.
[2023-03-20 00:18:47] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 00:18:48] [INFO ] Implicit Places using invariants and state equation in 510 ms returned []
Implicit Place search using SMT with State Equation took 716 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 391/393 places, 380/381 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 952 ms. Remains : 391/393 places, 380/381 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) 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 41 ms. (steps per millisecond=243 ) 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.
[2023-03-20 00:18:48] [INFO ] Invariant cache hit.
[2023-03-20 00:18:48] [INFO ] [Real]Absence check using 178 positive place invariants in 19 ms returned sat
[2023-03-20 00:18:49] [INFO ] After 283ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:5
[2023-03-20 00:18:49] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 00:18:49] [INFO ] After 35ms SMT Verify possible using 3 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-20 00:18:49] [INFO ] After 454ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-20 00:18:49] [INFO ] [Nat]Absence check using 178 positive place invariants in 28 ms returned sat
[2023-03-20 00:18:49] [INFO ] After 250ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-20 00:18:49] [INFO ] After 131ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-20 00:18:49] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 0 ms to minimize.
[2023-03-20 00:18:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2023-03-20 00:18:49] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 1 ms to minimize.
[2023-03-20 00:18:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
[2023-03-20 00:18:50] [INFO ] After 694ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 176 ms.
[2023-03-20 00:18:50] [INFO ] After 1307ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 81 ms.
Support contains 10 out of 391 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 391/391 places, 380/380 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 391 transition count 379
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 390 transition count 379
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 390 transition count 378
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 389 transition count 378
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 388 transition count 377
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 388 transition count 376
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 387 transition count 376
Applied a total of 8 rules in 49 ms. Remains 387 /391 variables (removed 4) and now considering 376/380 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 387/391 places, 376/380 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 199169 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 199169 steps, saw 127402 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 376 rows 387 cols
[2023-03-20 00:18:54] [INFO ] Computed 178 place invariants in 1 ms
[2023-03-20 00:18:54] [INFO ] [Real]Absence check using 178 positive place invariants in 27 ms returned sat
[2023-03-20 00:18:54] [INFO ] After 240ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:3
[2023-03-20 00:18:54] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 00:18:54] [INFO ] After 100ms SMT Verify possible using 3 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-20 00:18:54] [INFO ] After 497ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-20 00:18:54] [INFO ] [Nat]Absence check using 178 positive place invariants in 163 ms returned sat
[2023-03-20 00:18:55] [INFO ] After 291ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-20 00:18:55] [INFO ] After 167ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-20 00:18:55] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2023-03-20 00:18:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2023-03-20 00:18:55] [INFO ] After 428ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 177 ms.
[2023-03-20 00:18:55] [INFO ] After 1302ms 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 64 ms.
Support contains 10 out of 387 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 387/387 places, 376/376 transitions.
Applied a total of 0 rules in 14 ms. Remains 387 /387 variables (removed 0) and now considering 376/376 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 387/387 places, 376/376 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 387/387 places, 376/376 transitions.
Applied a total of 0 rules in 9 ms. Remains 387 /387 variables (removed 0) and now considering 376/376 (removed 0) transitions.
[2023-03-20 00:18:55] [INFO ] Invariant cache hit.
[2023-03-20 00:18:56] [INFO ] Implicit Places using invariants in 265 ms returned []
[2023-03-20 00:18:56] [INFO ] Invariant cache hit.
[2023-03-20 00:18:56] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 00:18:56] [INFO ] Implicit Places using invariants and state equation in 589 ms returned []
Implicit Place search using SMT with State Equation took 867 ms to find 0 implicit places.
[2023-03-20 00:18:56] [INFO ] Redundant transitions in 37 ms returned []
[2023-03-20 00:18:56] [INFO ] Invariant cache hit.
[2023-03-20 00:18:57] [INFO ] Dead Transitions using invariants and state equation in 259 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1184 ms. Remains : 387/387 places, 376/376 transitions.
Partial Free-agglomeration rule applied 36 times.
Drop transitions removed 36 transitions
Iterating global reduction 0 with 36 rules applied. Total rules applied 36 place count 387 transition count 376
Applied a total of 36 rules in 19 ms. Remains 387 /387 variables (removed 0) and now considering 376/376 (removed 0) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 376 rows 387 cols
[2023-03-20 00:18:57] [INFO ] Computed 178 place invariants in 2 ms
[2023-03-20 00:18:57] [INFO ] [Real]Absence check using 178 positive place invariants in 46 ms returned sat
[2023-03-20 00:18:57] [INFO ] After 394ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:3
[2023-03-20 00:18:57] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-20 00:18:57] [INFO ] After 122ms SMT Verify possible using 30 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-20 00:18:57] [INFO ] After 780ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-20 00:18:58] [INFO ] [Nat]Absence check using 178 positive place invariants in 50 ms returned sat
[2023-03-20 00:18:58] [INFO ] After 303ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-20 00:18:58] [INFO ] After 235ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-20 00:18:58] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 1 ms to minimize.
[2023-03-20 00:18:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2023-03-20 00:18:59] [INFO ] After 664ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 176 ms.
[2023-03-20 00:18:59] [INFO ] After 1433ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Computed a total of 319 stabilizing places and 319 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(F((p1||G(p2))))))))'
Support contains 3 out of 1190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1190/1190 places, 1090/1090 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 238 transitions
Trivial Post-agglo rules discarded 238 transitions
Performed 238 trivial Post agglomeration. Transition count delta: 238
Iterating post reduction 0 with 238 rules applied. Total rules applied 238 place count 1189 transition count 851
Reduce places removed 238 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 239 rules applied. Total rules applied 477 place count 951 transition count 850
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 478 place count 950 transition count 850
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 154 Pre rules applied. Total rules applied 478 place count 950 transition count 696
Deduced a syphon composed of 154 places in 1 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 3 with 308 rules applied. Total rules applied 786 place count 796 transition count 696
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 791 place count 791 transition count 691
Iterating global reduction 3 with 5 rules applied. Total rules applied 796 place count 791 transition count 691
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 796 place count 791 transition count 686
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 806 place count 786 transition count 686
Performed 340 Post agglomeration using F-continuation condition.Transition count delta: 340
Deduced a syphon composed of 340 places in 0 ms
Reduce places removed 340 places and 0 transitions.
Iterating global reduction 3 with 680 rules applied. Total rules applied 1486 place count 446 transition count 346
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1487 place count 446 transition count 345
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1489 place count 445 transition count 344
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 4 with 114 rules applied. Total rules applied 1603 place count 388 transition count 380
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1605 place count 386 transition count 378
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1607 place count 384 transition count 378
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1607 place count 384 transition count 377
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1609 place count 383 transition count 377
Applied a total of 1609 rules in 138 ms. Remains 383 /1190 variables (removed 807) and now considering 377/1090 (removed 713) transitions.
// Phase 1: matrix 377 rows 383 cols
[2023-03-20 00:19:00] [INFO ] Computed 179 place invariants in 2 ms
[2023-03-20 00:19:00] [INFO ] Implicit Places using invariants in 279 ms returned [372]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 280 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 382/1190 places, 377/1090 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 381 transition count 376
Applied a total of 2 rules in 14 ms. Remains 381 /382 variables (removed 1) and now considering 376/377 (removed 1) transitions.
// Phase 1: matrix 376 rows 381 cols
[2023-03-20 00:19:00] [INFO ] Computed 178 place invariants in 1 ms
[2023-03-20 00:19:00] [INFO ] Implicit Places using invariants in 258 ms returned []
[2023-03-20 00:19:00] [INFO ] Invariant cache hit.
[2023-03-20 00:19:00] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 00:19:01] [INFO ] Implicit Places using invariants and state equation in 533 ms returned []
Implicit Place search using SMT with State Equation took 793 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 381/1190 places, 376/1090 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1225 ms. Remains : 381/1190 places, 376/1090 transitions.
Stuttering acceptance computed with spot in 384 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s269 1), p1:(EQ s292 1), p2:(EQ s60 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 4 ms.
FORMULA ShieldIIPt-PT-020B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-LTLFireability-00 finished in 1702 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(X(p0)) U p1)&&F(X((X(p0) U p2))))))'
Support contains 3 out of 1190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1190/1190 places, 1090/1090 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 241 rules applied. Total rules applied 241 place count 1189 transition count 848
Reduce places removed 241 places and 0 transitions.
Iterating post reduction 1 with 241 rules applied. Total rules applied 482 place count 948 transition count 848
Performed 155 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 155 Pre rules applied. Total rules applied 482 place count 948 transition count 693
Deduced a syphon composed of 155 places in 1 ms
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 2 with 310 rules applied. Total rules applied 792 place count 793 transition count 693
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 795 place count 790 transition count 690
Iterating global reduction 2 with 3 rules applied. Total rules applied 798 place count 790 transition count 690
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 798 place count 790 transition count 687
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 804 place count 787 transition count 687
Performed 341 Post agglomeration using F-continuation condition.Transition count delta: 341
Deduced a syphon composed of 341 places in 0 ms
Reduce places removed 341 places and 0 transitions.
Iterating global reduction 2 with 682 rules applied. Total rules applied 1486 place count 446 transition count 346
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1487 place count 446 transition count 345
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 1489 place count 445 transition count 344
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1607 place count 386 transition count 383
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1609 place count 384 transition count 381
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1611 place count 382 transition count 381
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1611 place count 382 transition count 380
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1613 place count 381 transition count 380
Applied a total of 1613 rules in 152 ms. Remains 381 /1190 variables (removed 809) and now considering 380/1090 (removed 710) transitions.
// Phase 1: matrix 380 rows 381 cols
[2023-03-20 00:19:01] [INFO ] Computed 179 place invariants in 2 ms
[2023-03-20 00:19:01] [INFO ] Implicit Places using invariants in 267 ms returned [369]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 269 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 380/1190 places, 380/1090 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 379 transition count 379
Applied a total of 2 rules in 10 ms. Remains 379 /380 variables (removed 1) and now considering 379/380 (removed 1) transitions.
// Phase 1: matrix 379 rows 379 cols
[2023-03-20 00:19:01] [INFO ] Computed 178 place invariants in 1 ms
[2023-03-20 00:19:02] [INFO ] Implicit Places using invariants in 165 ms returned []
[2023-03-20 00:19:02] [INFO ] Invariant cache hit.
[2023-03-20 00:19:02] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 00:19:02] [INFO ] Implicit Places using invariants and state equation in 457 ms returned []
Implicit Place search using SMT with State Equation took 624 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 379/1190 places, 379/1090 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1056 ms. Remains : 379/1190 places, 379/1090 transitions.
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s374 1), p2:(EQ s262 1), p0:(EQ s155 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-020B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-LTLFireability-01 finished in 1314 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(p1)))))'
Support contains 2 out of 1190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1190/1190 places, 1090/1090 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1182 transition count 1082
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1182 transition count 1082
Applied a total of 16 rules in 106 ms. Remains 1182 /1190 variables (removed 8) and now considering 1082/1090 (removed 8) transitions.
// Phase 1: matrix 1082 rows 1182 cols
[2023-03-20 00:19:02] [INFO ] Computed 181 place invariants in 8 ms
[2023-03-20 00:19:03] [INFO ] Implicit Places using invariants in 367 ms returned []
[2023-03-20 00:19:03] [INFO ] Invariant cache hit.
[2023-03-20 00:19:04] [INFO ] Implicit Places using invariants and state equation in 1047 ms returned []
Implicit Place search using SMT with State Equation took 1416 ms to find 0 implicit places.
[2023-03-20 00:19:04] [INFO ] Invariant cache hit.
[2023-03-20 00:19:05] [INFO ] Dead Transitions using invariants and state equation in 662 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1182/1190 places, 1082/1090 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2185 ms. Remains : 1182/1190 places, 1082/1090 transitions.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(EQ s878 1), p1:(EQ s234 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 453 ms.
Stack based approach found an accepted trace after 898 steps with 0 reset with depth 899 and stack size 899 in 5 ms.
FORMULA ShieldIIPt-PT-020B-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-020B-LTLFireability-02 finished in 2735 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 1190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1190/1190 places, 1090/1090 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1182 transition count 1082
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1182 transition count 1082
Applied a total of 16 rules in 59 ms. Remains 1182 /1190 variables (removed 8) and now considering 1082/1090 (removed 8) transitions.
// Phase 1: matrix 1082 rows 1182 cols
[2023-03-20 00:19:05] [INFO ] Computed 181 place invariants in 8 ms
[2023-03-20 00:19:05] [INFO ] Implicit Places using invariants in 331 ms returned []
[2023-03-20 00:19:05] [INFO ] Invariant cache hit.
[2023-03-20 00:19:07] [INFO ] Implicit Places using invariants and state equation in 1447 ms returned []
Implicit Place search using SMT with State Equation took 1780 ms to find 0 implicit places.
[2023-03-20 00:19:07] [INFO ] Invariant cache hit.
[2023-03-20 00:19:08] [INFO ] Dead Transitions using invariants and state equation in 654 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1182/1190 places, 1082/1090 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2494 ms. Remains : 1182/1190 places, 1082/1090 transitions.
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s75 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-020B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-LTLFireability-04 finished in 2626 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((X(p1)&&p0))||F(p2)))'
Support contains 3 out of 1190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1190/1190 places, 1090/1090 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1182 transition count 1082
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1182 transition count 1082
Applied a total of 16 rules in 64 ms. Remains 1182 /1190 variables (removed 8) and now considering 1082/1090 (removed 8) transitions.
// Phase 1: matrix 1082 rows 1182 cols
[2023-03-20 00:19:08] [INFO ] Computed 181 place invariants in 3 ms
[2023-03-20 00:19:08] [INFO ] Implicit Places using invariants in 317 ms returned []
[2023-03-20 00:19:08] [INFO ] Invariant cache hit.
[2023-03-20 00:19:09] [INFO ] Implicit Places using invariants and state equation in 1082 ms returned []
Implicit Place search using SMT with State Equation took 1447 ms to find 0 implicit places.
[2023-03-20 00:19:09] [INFO ] Invariant cache hit.
[2023-03-20 00:19:10] [INFO ] Dead Transitions using invariants and state equation in 696 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1182/1190 places, 1082/1090 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2209 ms. Remains : 1182/1190 places, 1082/1090 transitions.
Stuttering acceptance computed with spot in 84 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s304 1) (EQ s501 1)), p2:(EQ s304 1), p1:(EQ s338 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, null][false, false, false]]
Product exploration explored 100000 steps with 308 reset in 363 ms.
Product exploration explored 100000 steps with 313 reset in 411 ms.
Computed a total of 318 stabilizing places and 318 stable transitions
Computed a total of 318 stabilizing places and 318 stable transitions
Detected a total of 318/1182 stabilizing places and 318/1082 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))), (X (NOT p2)), (X (NOT (AND p0 (NOT p2) p1))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2) p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 481 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p2), (NOT p2)]
Finished random walk after 305 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=101 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))), (X (NOT p2)), (X (NOT (AND p0 (NOT p2) p1))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2) p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 8 factoid took 351 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p2)]
[2023-03-20 00:19:12] [INFO ] Invariant cache hit.
[2023-03-20 00:19:12] [INFO ] [Real]Absence check using 181 positive place invariants in 193 ms returned sat
[2023-03-20 00:19:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 00:19:15] [INFO ] [Real]Absence check using state equation in 2657 ms returned sat
[2023-03-20 00:19:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 00:19:16] [INFO ] [Nat]Absence check using 181 positive place invariants in 111 ms returned sat
[2023-03-20 00:19:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 00:19:19] [INFO ] [Nat]Absence check using state equation in 2801 ms returned sat
[2023-03-20 00:19:19] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2023-03-20 00:19:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 162 ms
[2023-03-20 00:19:19] [INFO ] Computed and/alt/rep : 1081/1622/1081 causal constraints (skipped 0 transitions) in 73 ms.
[2023-03-20 00:19:31] [INFO ] Deduced a trap composed of 16 places in 441 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java: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 00:19:31] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p2)
Could not prove EG (NOT p2)
Support contains 1 out of 1182 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1182/1182 places, 1082/1082 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 237 transitions
Trivial Post-agglo rules discarded 237 transitions
Performed 237 trivial Post agglomeration. Transition count delta: 237
Iterating post reduction 0 with 237 rules applied. Total rules applied 237 place count 1181 transition count 844
Reduce places removed 237 places and 0 transitions.
Iterating post reduction 1 with 237 rules applied. Total rules applied 474 place count 944 transition count 844
Performed 161 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 161 Pre rules applied. Total rules applied 474 place count 944 transition count 683
Deduced a syphon composed of 161 places in 0 ms
Reduce places removed 161 places and 0 transitions.
Iterating global reduction 2 with 322 rules applied. Total rules applied 796 place count 783 transition count 683
Performed 337 Post agglomeration using F-continuation condition.Transition count delta: 337
Deduced a syphon composed of 337 places in 0 ms
Reduce places removed 337 places and 0 transitions.
Iterating global reduction 2 with 674 rules applied. Total rules applied 1470 place count 446 transition count 346
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1471 place count 446 transition count 345
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 1473 place count 445 transition count 344
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1591 place count 386 transition count 383
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1593 place count 384 transition count 381
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1595 place count 382 transition count 381
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1595 place count 382 transition count 380
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1597 place count 381 transition count 380
Applied a total of 1597 rules in 73 ms. Remains 381 /1182 variables (removed 801) and now considering 380/1082 (removed 702) transitions.
// Phase 1: matrix 380 rows 381 cols
[2023-03-20 00:19:31] [INFO ] Computed 179 place invariants in 1 ms
[2023-03-20 00:19:31] [INFO ] Implicit Places using invariants in 201 ms returned [370]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 202 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 380/1182 places, 380/1082 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 379 transition count 379
Applied a total of 2 rules in 11 ms. Remains 379 /380 variables (removed 1) and now considering 379/380 (removed 1) transitions.
// Phase 1: matrix 379 rows 379 cols
[2023-03-20 00:19:31] [INFO ] Computed 178 place invariants in 1 ms
[2023-03-20 00:19:31] [INFO ] Implicit Places using invariants in 212 ms returned []
[2023-03-20 00:19:31] [INFO ] Invariant cache hit.
[2023-03-20 00:19:31] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 00:19:32] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 564 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 379/1182 places, 379/1082 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 850 ms. Remains : 379/1182 places, 379/1082 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/379 stabilizing places and 2/379 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p2), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 2 factoid took 227 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p2)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p2), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (F p2)]
Knowledge based reduction with 2 factoid took 286 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p2)]
[2023-03-20 00:19:32] [INFO ] Invariant cache hit.
[2023-03-20 00:19:33] [INFO ] [Real]Absence check using 178 positive place invariants in 53 ms returned sat
[2023-03-20 00:19:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 00:19:33] [INFO ] [Real]Absence check using state equation in 278 ms returned sat
[2023-03-20 00:19:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 00:19:33] [INFO ] [Nat]Absence check using 178 positive place invariants in 55 ms returned sat
[2023-03-20 00:19:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 00:19:33] [INFO ] [Nat]Absence check using state equation in 275 ms returned sat
[2023-03-20 00:19:33] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 00:19:33] [INFO ] [Nat]Added 3 Read/Feed constraints in 14 ms returned sat
[2023-03-20 00:19:33] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 2 ms to minimize.
[2023-03-20 00:19:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2023-03-20 00:19:34] [INFO ] Computed and/alt/rep : 374/579/374 causal constraints (skipped 0 transitions) in 44 ms.
[2023-03-20 00:19:36] [INFO ] Added : 287 causal constraints over 58 iterations in 2986 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 67 ms :[(NOT p2)]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-020B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-LTLFireability-05 finished in 28873 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 U (p1||G(p0))))))'
Support contains 2 out of 1190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1190/1190 places, 1090/1090 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1182 transition count 1082
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1182 transition count 1082
Applied a total of 16 rules in 82 ms. Remains 1182 /1190 variables (removed 8) and now considering 1082/1090 (removed 8) transitions.
// Phase 1: matrix 1082 rows 1182 cols
[2023-03-20 00:19:37] [INFO ] Computed 181 place invariants in 20 ms
[2023-03-20 00:19:37] [INFO ] Implicit Places using invariants in 474 ms returned []
[2023-03-20 00:19:37] [INFO ] Invariant cache hit.
[2023-03-20 00:19:38] [INFO ] Implicit Places using invariants and state equation in 906 ms returned []
Implicit Place search using SMT with State Equation took 1382 ms to find 0 implicit places.
[2023-03-20 00:19:38] [INFO ] Invariant cache hit.
[2023-03-20 00:19:39] [INFO ] Dead Transitions using invariants and state equation in 700 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1182/1190 places, 1082/1090 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2164 ms. Remains : 1182/1190 places, 1082/1090 transitions.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s77 1) (NEQ s536 1)), p0:(NEQ s536 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 453 ms.
Product exploration explored 100000 steps with 0 reset in 594 ms.
Computed a total of 319 stabilizing places and 319 stable transitions
Computed a total of 319 stabilizing places and 319 stable transitions
Detected a total of 319/1182 stabilizing places and 319/1082 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 315 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 237 steps, including 0 resets, run visited all 2 properties in 11 ms. (steps per millisecond=21 )
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 6 factoid took 463 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 1182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1182/1182 places, 1082/1082 transitions.
Applied a total of 0 rules in 83 ms. Remains 1182 /1182 variables (removed 0) and now considering 1082/1082 (removed 0) transitions.
[2023-03-20 00:19:41] [INFO ] Invariant cache hit.
[2023-03-20 00:19:42] [INFO ] Implicit Places using invariants in 404 ms returned []
[2023-03-20 00:19:42] [INFO ] Invariant cache hit.
[2023-03-20 00:19:43] [INFO ] Implicit Places using invariants and state equation in 1030 ms returned []
Implicit Place search using SMT with State Equation took 1467 ms to find 0 implicit places.
[2023-03-20 00:19:43] [INFO ] Invariant cache hit.
[2023-03-20 00:19:43] [INFO ] Dead Transitions using invariants and state equation in 528 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2080 ms. Remains : 1182/1182 places, 1082/1082 transitions.
Computed a total of 319 stabilizing places and 319 stable transitions
Computed a total of 319 stabilizing places and 319 stable transitions
Detected a total of 319/1182 stabilizing places and 319/1082 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 233 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 253 steps, including 0 resets, run visited all 2 properties in 9 ms. (steps per millisecond=28 )
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 6 factoid took 493 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 456 ms.
Product exploration explored 100000 steps with 0 reset in 583 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 1182 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1182/1182 places, 1082/1082 transitions.
Performed 237 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 237 rules applied. Total rules applied 237 place count 1182 transition count 1082
Performed 82 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 82 Pre rules applied. Total rules applied 237 place count 1182 transition count 1144
Deduced a syphon composed of 319 places in 1 ms
Iterating global reduction 1 with 82 rules applied. Total rules applied 319 place count 1182 transition count 1144
Performed 399 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 718 places in 0 ms
Iterating global reduction 1 with 399 rules applied. Total rules applied 718 place count 1182 transition count 1144
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 719 place count 1182 transition count 1143
Renaming transitions due to excessive name length > 1024 char.
Discarding 158 places :
Symmetric choice reduction at 2 with 158 rule applications. Total rules 877 place count 1024 transition count 985
Deduced a syphon composed of 560 places in 1 ms
Iterating global reduction 2 with 158 rules applied. Total rules applied 1035 place count 1024 transition count 985
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 561 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1036 place count 1024 transition count 985
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1038 place count 1022 transition count 983
Deduced a syphon composed of 559 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1040 place count 1022 transition count 983
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: -415
Deduced a syphon composed of 637 places in 0 ms
Iterating global reduction 2 with 78 rules applied. Total rules applied 1118 place count 1022 transition count 1398
Discarding 78 places :
Symmetric choice reduction at 2 with 78 rule applications. Total rules 1196 place count 944 transition count 1242
Deduced a syphon composed of 559 places in 0 ms
Iterating global reduction 2 with 78 rules applied. Total rules applied 1274 place count 944 transition count 1242
Deduced a syphon composed of 559 places in 0 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 1283 place count 944 transition count 1233
Deduced a syphon composed of 559 places in 1 ms
Applied a total of 1283 rules in 633 ms. Remains 944 /1182 variables (removed 238) and now considering 1233/1082 (removed -151) transitions.
[2023-03-20 00:19:47] [INFO ] Redundant transitions in 48 ms returned []
// Phase 1: matrix 1233 rows 944 cols
[2023-03-20 00:19:47] [INFO ] Computed 181 place invariants in 15 ms
[2023-03-20 00:19:47] [INFO ] Dead Transitions using invariants and state equation in 880 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 944/1182 places, 1233/1082 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1569 ms. Remains : 944/1182 places, 1233/1082 transitions.
Support contains 2 out of 1182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1182/1182 places, 1082/1082 transitions.
Applied a total of 0 rules in 42 ms. Remains 1182 /1182 variables (removed 0) and now considering 1082/1082 (removed 0) transitions.
// Phase 1: matrix 1082 rows 1182 cols
[2023-03-20 00:19:48] [INFO ] Computed 181 place invariants in 12 ms
[2023-03-20 00:19:48] [INFO ] Implicit Places using invariants in 534 ms returned []
[2023-03-20 00:19:48] [INFO ] Invariant cache hit.
[2023-03-20 00:19:49] [INFO ] Implicit Places using invariants and state equation in 889 ms returned []
Implicit Place search using SMT with State Equation took 1432 ms to find 0 implicit places.
[2023-03-20 00:19:49] [INFO ] Invariant cache hit.
[2023-03-20 00:19:50] [INFO ] Dead Transitions using invariants and state equation in 654 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2128 ms. Remains : 1182/1182 places, 1082/1082 transitions.
Treatment of property ShieldIIPt-PT-020B-LTLFireability-06 finished in 13119 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((p1 U p2)))))'
Support contains 2 out of 1190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1190/1190 places, 1090/1090 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1181 transition count 1081
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1181 transition count 1081
Applied a total of 18 rules in 63 ms. Remains 1181 /1190 variables (removed 9) and now considering 1081/1090 (removed 9) transitions.
// Phase 1: matrix 1081 rows 1181 cols
[2023-03-20 00:19:50] [INFO ] Computed 181 place invariants in 7 ms
[2023-03-20 00:19:50] [INFO ] Implicit Places using invariants in 309 ms returned []
[2023-03-20 00:19:50] [INFO ] Invariant cache hit.
[2023-03-20 00:19:51] [INFO ] Implicit Places using invariants and state equation in 1073 ms returned []
Implicit Place search using SMT with State Equation took 1382 ms to find 0 implicit places.
[2023-03-20 00:19:51] [INFO ] Invariant cache hit.
[2023-03-20 00:19:52] [INFO ] Dead Transitions using invariants and state equation in 567 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1181/1190 places, 1081/1090 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2014 ms. Remains : 1181/1190 places, 1081/1090 transitions.
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), true, (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(NEQ s251 1), p2:(AND (EQ s1116 1) (NEQ s251 1)), p1:(EQ s1116 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, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 645 ms.
Product exploration explored 100000 steps with 50000 reset in 684 ms.
Computed a total of 318 stabilizing places and 318 stable transitions
Computed a total of 318 stabilizing places and 318 stable transitions
Detected a total of 318/1181 stabilizing places and 318/1081 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X p0), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) (NOT p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 180 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-020B-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-020B-LTLFireability-07 finished in 3679 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((!X(p0) U p1))))'
Support contains 2 out of 1190 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1190/1190 places, 1090/1090 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1181 transition count 1081
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1181 transition count 1081
Applied a total of 18 rules in 100 ms. Remains 1181 /1190 variables (removed 9) and now considering 1081/1090 (removed 9) transitions.
[2023-03-20 00:19:53] [INFO ] Invariant cache hit.
[2023-03-20 00:19:54] [INFO ] Implicit Places using invariants in 424 ms returned []
[2023-03-20 00:19:54] [INFO ] Invariant cache hit.
[2023-03-20 00:19:55] [INFO ] Implicit Places using invariants and state equation in 1085 ms returned []
Implicit Place search using SMT with State Equation took 1510 ms to find 0 implicit places.
[2023-03-20 00:19:55] [INFO ] Invariant cache hit.
[2023-03-20 00:19:55] [INFO ] Dead Transitions using invariants and state equation in 522 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1181/1190 places, 1081/1090 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2146 ms. Remains : 1181/1190 places, 1081/1090 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s1078 1) (EQ s1102 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 153 reset in 379 ms.
Stack based approach found an accepted trace after 994 steps with 1 reset with depth 474 and stack size 474 in 4 ms.
FORMULA ShieldIIPt-PT-020B-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-020B-LTLFireability-08 finished in 2607 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 3 out of 1190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1190/1190 places, 1090/1090 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 241 rules applied. Total rules applied 241 place count 1189 transition count 848
Reduce places removed 241 places and 0 transitions.
Iterating post reduction 1 with 241 rules applied. Total rules applied 482 place count 948 transition count 848
Performed 153 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 153 Pre rules applied. Total rules applied 482 place count 948 transition count 695
Deduced a syphon composed of 153 places in 1 ms
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 2 with 306 rules applied. Total rules applied 788 place count 795 transition count 695
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 793 place count 790 transition count 690
Iterating global reduction 2 with 5 rules applied. Total rules applied 798 place count 790 transition count 690
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 798 place count 790 transition count 685
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 808 place count 785 transition count 685
Performed 341 Post agglomeration using F-continuation condition.Transition count delta: 341
Deduced a syphon composed of 341 places in 1 ms
Reduce places removed 341 places and 0 transitions.
Iterating global reduction 2 with 682 rules applied. Total rules applied 1490 place count 444 transition count 344
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1491 place count 444 transition count 343
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 1493 place count 443 transition count 342
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 1611 place count 384 transition count 381
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1613 place count 382 transition count 379
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1615 place count 380 transition count 379
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1615 place count 380 transition count 378
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1617 place count 379 transition count 378
Applied a total of 1617 rules in 149 ms. Remains 379 /1190 variables (removed 811) and now considering 378/1090 (removed 712) transitions.
// Phase 1: matrix 378 rows 379 cols
[2023-03-20 00:19:56] [INFO ] Computed 179 place invariants in 2 ms
[2023-03-20 00:19:56] [INFO ] Implicit Places using invariants in 239 ms returned [368]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 242 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 378/1190 places, 378/1090 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 377 transition count 377
Applied a total of 2 rules in 14 ms. Remains 377 /378 variables (removed 1) and now considering 377/378 (removed 1) transitions.
// Phase 1: matrix 377 rows 377 cols
[2023-03-20 00:19:56] [INFO ] Computed 178 place invariants in 0 ms
[2023-03-20 00:19:57] [INFO ] Implicit Places using invariants in 213 ms returned []
[2023-03-20 00:19:57] [INFO ] Invariant cache hit.
[2023-03-20 00:19:57] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 654 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 377/1190 places, 377/1090 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1059 ms. Remains : 377/1190 places, 377/1090 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-09 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 (NEQ s67 1) (NEQ s72 1) (NEQ s79 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]]
Entered a terminal (fully accepting) state of product in 95326 steps with 0 reset in 386 ms.
FORMULA ShieldIIPt-PT-020B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-LTLFireability-09 finished in 1552 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(X(X(X(G(p1))))))))'
Support contains 4 out of 1190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1190/1190 places, 1090/1090 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1181 transition count 1081
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1181 transition count 1081
Applied a total of 18 rules in 56 ms. Remains 1181 /1190 variables (removed 9) and now considering 1081/1090 (removed 9) transitions.
// Phase 1: matrix 1081 rows 1181 cols
[2023-03-20 00:19:58] [INFO ] Computed 181 place invariants in 7 ms
[2023-03-20 00:19:58] [INFO ] Implicit Places using invariants in 316 ms returned []
[2023-03-20 00:19:58] [INFO ] Invariant cache hit.
[2023-03-20 00:19:59] [INFO ] Implicit Places using invariants and state equation in 1033 ms returned []
Implicit Place search using SMT with State Equation took 1352 ms to find 0 implicit places.
[2023-03-20 00:19:59] [INFO ] Invariant cache hit.
[2023-03-20 00:19:59] [INFO ] Dead Transitions using invariants and state equation in 539 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1181/1190 places, 1081/1090 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1948 ms. Remains : 1181/1190 places, 1081/1090 transitions.
Stuttering acceptance computed with spot in 402 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}]], initial=1, aps=[p0:(OR (EQ s507 0) (EQ s518 0) (EQ s544 0)), p1:(NEQ s1069 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, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 738 ms.
Product exploration explored 100000 steps with 50000 reset in 700 ms.
Computed a total of 318 stabilizing places and 318 stable transitions
Computed a total of 318 stabilizing places and 318 stable transitions
Detected a total of 318/1181 stabilizing places and 318/1081 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 124 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-020B-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-020B-LTLFireability-10 finished in 3954 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 2 out of 1190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1190/1190 places, 1090/1090 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 239 rules applied. Total rules applied 239 place count 1189 transition count 850
Reduce places removed 239 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 240 rules applied. Total rules applied 479 place count 950 transition count 849
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 480 place count 949 transition count 849
Performed 155 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 155 Pre rules applied. Total rules applied 480 place count 949 transition count 694
Deduced a syphon composed of 155 places in 2 ms
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 3 with 310 rules applied. Total rules applied 790 place count 794 transition count 694
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 795 place count 789 transition count 689
Iterating global reduction 3 with 5 rules applied. Total rules applied 800 place count 789 transition count 689
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 800 place count 789 transition count 684
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 810 place count 784 transition count 684
Performed 339 Post agglomeration using F-continuation condition.Transition count delta: 339
Deduced a syphon composed of 339 places in 0 ms
Reduce places removed 339 places and 0 transitions.
Iterating global reduction 3 with 678 rules applied. Total rules applied 1488 place count 445 transition count 345
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1489 place count 445 transition count 344
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 4 with 2 rules applied. Total rules applied 1491 place count 444 transition count 343
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 1607 place count 386 transition count 381
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1609 place count 384 transition count 379
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1611 place count 382 transition count 379
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1611 place count 382 transition count 378
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1613 place count 381 transition count 378
Applied a total of 1613 rules in 145 ms. Remains 381 /1190 variables (removed 809) and now considering 378/1090 (removed 712) transitions.
// Phase 1: matrix 378 rows 381 cols
[2023-03-20 00:20:02] [INFO ] Computed 179 place invariants in 2 ms
[2023-03-20 00:20:02] [INFO ] Implicit Places using invariants in 232 ms returned [370]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 233 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 380/1190 places, 378/1090 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 379 transition count 377
Applied a total of 2 rules in 8 ms. Remains 379 /380 variables (removed 1) and now considering 377/378 (removed 1) transitions.
// Phase 1: matrix 377 rows 379 cols
[2023-03-20 00:20:02] [INFO ] Computed 178 place invariants in 1 ms
[2023-03-20 00:20:02] [INFO ] Implicit Places using invariants in 220 ms returned []
[2023-03-20 00:20:02] [INFO ] Invariant cache hit.
[2023-03-20 00:20:03] [INFO ] Implicit Places using invariants and state equation in 432 ms returned []
Implicit Place search using SMT with State Equation took 652 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 379/1190 places, 377/1090 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1038 ms. Remains : 379/1190 places, 377/1090 transitions.
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s271 1), p1:(EQ s210 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-020B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-LTLFireability-11 finished in 1244 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U X(G(!p0)))))'
Support contains 1 out of 1190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1190/1190 places, 1090/1090 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1182 transition count 1082
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1182 transition count 1082
Applied a total of 16 rules in 109 ms. Remains 1182 /1190 variables (removed 8) and now considering 1082/1090 (removed 8) transitions.
// Phase 1: matrix 1082 rows 1182 cols
[2023-03-20 00:20:03] [INFO ] Computed 181 place invariants in 7 ms
[2023-03-20 00:20:03] [INFO ] Implicit Places using invariants in 462 ms returned []
[2023-03-20 00:20:03] [INFO ] Invariant cache hit.
[2023-03-20 00:20:04] [INFO ] Implicit Places using invariants and state equation in 1019 ms returned []
Implicit Place search using SMT with State Equation took 1483 ms to find 0 implicit places.
[2023-03-20 00:20:04] [INFO ] Invariant cache hit.
[2023-03-20 00:20:05] [INFO ] Dead Transitions using invariants and state equation in 622 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1182/1190 places, 1082/1090 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2216 ms. Remains : 1182/1190 places, 1082/1090 transitions.
Stuttering acceptance computed with spot in 110 ms :[p0, p0, true, p0]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 0}, { cond=p0, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s165 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 378 ms.
Product exploration explored 100000 steps with 0 reset in 533 ms.
Computed a total of 318 stabilizing places and 318 stable transitions
Computed a total of 318 stabilizing places and 318 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 192 ms. Reduced automaton from 4 states, 6 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[true, p0, p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) 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 314929 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :{}
Probabilistic random walk after 314929 steps, saw 159308 distinct states, run finished after 3001 ms. (steps per millisecond=104 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 00:20:09] [INFO ] Invariant cache hit.
[2023-03-20 00:20:10] [INFO ] [Real]Absence check using 181 positive place invariants in 83 ms returned sat
[2023-03-20 00:20:10] [INFO ] After 480ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 00:20:11] [INFO ] Deduced a trap composed of 16 places in 279 ms of which 1 ms to minimize.
[2023-03-20 00:20:11] [INFO ] Deduced a trap composed of 27 places in 324 ms of which 1 ms to minimize.
[2023-03-20 00:20:11] [INFO ] Deduced a trap composed of 32 places in 247 ms of which 0 ms to minimize.
[2023-03-20 00:20:12] [INFO ] Deduced a trap composed of 20 places in 222 ms of which 1 ms to minimize.
[2023-03-20 00:20:12] [INFO ] Deduced a trap composed of 26 places in 242 ms of which 0 ms to minimize.
[2023-03-20 00:20:12] [INFO ] Deduced a trap composed of 34 places in 239 ms of which 0 ms to minimize.
[2023-03-20 00:20:12] [INFO ] Deduced a trap composed of 34 places in 247 ms of which 1 ms to minimize.
[2023-03-20 00:20:13] [INFO ] Deduced a trap composed of 21 places in 244 ms of which 1 ms to minimize.
[2023-03-20 00:20:13] [INFO ] Deduced a trap composed of 21 places in 223 ms of which 1 ms to minimize.
[2023-03-20 00:20:13] [INFO ] Deduced a trap composed of 20 places in 239 ms of which 3 ms to minimize.
[2023-03-20 00:20:14] [INFO ] Deduced a trap composed of 32 places in 218 ms of which 1 ms to minimize.
[2023-03-20 00:20:14] [INFO ] Deduced a trap composed of 32 places in 194 ms of which 0 ms to minimize.
[2023-03-20 00:20:14] [INFO ] Deduced a trap composed of 30 places in 155 ms of which 0 ms to minimize.
[2023-03-20 00:20:14] [INFO ] Deduced a trap composed of 16 places in 191 ms of which 1 ms to minimize.
[2023-03-20 00:20:14] [INFO ] Deduced a trap composed of 32 places in 200 ms of which 0 ms to minimize.
[2023-03-20 00:20:15] [INFO ] Deduced a trap composed of 31 places in 189 ms of which 0 ms to minimize.
[2023-03-20 00:20:15] [INFO ] Deduced a trap composed of 31 places in 188 ms of which 0 ms to minimize.
[2023-03-20 00:20:15] [INFO ] Deduced a trap composed of 29 places in 166 ms of which 1 ms to minimize.
[2023-03-20 00:20:15] [INFO ] Deduced a trap composed of 34 places in 176 ms of which 0 ms to minimize.
[2023-03-20 00:20:16] [INFO ] Deduced a trap composed of 27 places in 135 ms of which 0 ms to minimize.
[2023-03-20 00:20:16] [INFO ] Deduced a trap composed of 34 places in 144 ms of which 0 ms to minimize.
[2023-03-20 00:20:16] [INFO ] Deduced a trap composed of 30 places in 160 ms of which 1 ms to minimize.
[2023-03-20 00:20:16] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 0 ms to minimize.
[2023-03-20 00:20:16] [INFO ] Deduced a trap composed of 35 places in 141 ms of which 0 ms to minimize.
[2023-03-20 00:20:17] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 6342 ms
[2023-03-20 00:20:17] [INFO ] After 6897ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:20:17] [INFO ] After 7189ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:20:17] [INFO ] [Nat]Absence check using 181 positive place invariants in 82 ms returned sat
[2023-03-20 00:20:18] [INFO ] After 532ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:20:18] [INFO ] Deduced a trap composed of 16 places in 306 ms of which 1 ms to minimize.
[2023-03-20 00:20:18] [INFO ] Deduced a trap composed of 27 places in 333 ms of which 1 ms to minimize.
[2023-03-20 00:20:19] [INFO ] Deduced a trap composed of 32 places in 314 ms of which 1 ms to minimize.
[2023-03-20 00:20:19] [INFO ] Deduced a trap composed of 20 places in 248 ms of which 1 ms to minimize.
[2023-03-20 00:20:19] [INFO ] Deduced a trap composed of 26 places in 246 ms of which 0 ms to minimize.
[2023-03-20 00:20:20] [INFO ] Deduced a trap composed of 34 places in 228 ms of which 0 ms to minimize.
[2023-03-20 00:20:20] [INFO ] Deduced a trap composed of 34 places in 254 ms of which 1 ms to minimize.
[2023-03-20 00:20:20] [INFO ] Deduced a trap composed of 21 places in 218 ms of which 1 ms to minimize.
[2023-03-20 00:20:20] [INFO ] Deduced a trap composed of 21 places in 202 ms of which 0 ms to minimize.
[2023-03-20 00:20:21] [INFO ] Deduced a trap composed of 20 places in 277 ms of which 1 ms to minimize.
[2023-03-20 00:20:21] [INFO ] Deduced a trap composed of 32 places in 278 ms of which 0 ms to minimize.
[2023-03-20 00:20:21] [INFO ] Deduced a trap composed of 32 places in 187 ms of which 1 ms to minimize.
[2023-03-20 00:20:22] [INFO ] Deduced a trap composed of 30 places in 281 ms of which 1 ms to minimize.
[2023-03-20 00:20:22] [INFO ] Deduced a trap composed of 16 places in 158 ms of which 0 ms to minimize.
[2023-03-20 00:20:22] [INFO ] Deduced a trap composed of 32 places in 231 ms of which 1 ms to minimize.
[2023-03-20 00:20:22] [INFO ] Deduced a trap composed of 31 places in 163 ms of which 1 ms to minimize.
[2023-03-20 00:20:22] [INFO ] Deduced a trap composed of 31 places in 190 ms of which 0 ms to minimize.
[2023-03-20 00:20:23] [INFO ] Deduced a trap composed of 29 places in 186 ms of which 0 ms to minimize.
[2023-03-20 00:20:23] [INFO ] Deduced a trap composed of 34 places in 152 ms of which 1 ms to minimize.
[2023-03-20 00:20:23] [INFO ] Deduced a trap composed of 27 places in 190 ms of which 0 ms to minimize.
[2023-03-20 00:20:23] [INFO ] Deduced a trap composed of 34 places in 172 ms of which 0 ms to minimize.
[2023-03-20 00:20:24] [INFO ] Deduced a trap composed of 30 places in 142 ms of which 1 ms to minimize.
[2023-03-20 00:20:24] [INFO ] Deduced a trap composed of 25 places in 143 ms of which 0 ms to minimize.
[2023-03-20 00:20:24] [INFO ] Deduced a trap composed of 37 places in 154 ms of which 0 ms to minimize.
[2023-03-20 00:20:24] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 0 ms to minimize.
[2023-03-20 00:20:24] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 1 ms to minimize.
[2023-03-20 00:20:24] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 6775 ms
[2023-03-20 00:20:24] [INFO ] After 7356ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 66 ms.
[2023-03-20 00:20:24] [INFO ] After 7832ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 1182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1182/1182 places, 1082/1082 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 239 rules applied. Total rules applied 239 place count 1182 transition count 843
Reduce places removed 239 places and 0 transitions.
Iterating post reduction 1 with 239 rules applied. Total rules applied 478 place count 943 transition count 843
Performed 160 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 160 Pre rules applied. Total rules applied 478 place count 943 transition count 683
Deduced a syphon composed of 160 places in 0 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 2 with 320 rules applied. Total rules applied 798 place count 783 transition count 683
Performed 341 Post agglomeration using F-continuation condition.Transition count delta: 341
Deduced a syphon composed of 341 places in 0 ms
Reduce places removed 341 places and 0 transitions.
Iterating global reduction 2 with 682 rules applied. Total rules applied 1480 place count 442 transition count 342
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1481 place count 442 transition count 341
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 1483 place count 441 transition count 340
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 1599 place count 383 transition count 378
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1600 place count 383 transition count 377
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1601 place count 383 transition count 376
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1602 place count 382 transition count 376
Partial Free-agglomeration rule applied 20 times.
Drop transitions removed 20 transitions
Iterating global reduction 5 with 20 rules applied. Total rules applied 1622 place count 382 transition count 376
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1623 place count 381 transition count 375
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1625 place count 379 transition count 375
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1625 place count 379 transition count 374
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1627 place count 378 transition count 374
Applied a total of 1627 rules in 94 ms. Remains 378 /1182 variables (removed 804) and now considering 374/1082 (removed 708) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 378/1182 places, 374/1082 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 564058 steps, run timeout after 3001 ms. (steps per millisecond=187 ) properties seen :{}
Probabilistic random walk after 564058 steps, saw 362400 distinct states, run finished after 3001 ms. (steps per millisecond=187 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 374 rows 378 cols
[2023-03-20 00:20:28] [INFO ] Computed 179 place invariants in 4 ms
[2023-03-20 00:20:28] [INFO ] [Real]Absence check using 179 positive place invariants in 38 ms returned sat
[2023-03-20 00:20:28] [INFO ] After 184ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 00:20:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 00:20:28] [INFO ] After 19ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:20:28] [INFO ] After 351ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:20:28] [INFO ] [Nat]Absence check using 179 positive place invariants in 30 ms returned sat
[2023-03-20 00:20:28] [INFO ] After 184ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:20:28] [INFO ] After 18ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 00:20:28] [INFO ] After 61ms 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 00:20:28] [INFO ] After 400ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 378 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 374/374 transitions.
Applied a total of 0 rules in 8 ms. Remains 378 /378 variables (removed 0) and now considering 374/374 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 378/378 places, 374/374 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 374/374 transitions.
Applied a total of 0 rules in 10 ms. Remains 378 /378 variables (removed 0) and now considering 374/374 (removed 0) transitions.
[2023-03-20 00:20:28] [INFO ] Invariant cache hit.
[2023-03-20 00:20:29] [INFO ] Implicit Places using invariants in 268 ms returned [367]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 284 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 377/378 places, 374/374 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 376 transition count 373
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 376 transition count 373
Applied a total of 2 rules in 26 ms. Remains 376 /377 variables (removed 1) and now considering 373/374 (removed 1) transitions.
// Phase 1: matrix 373 rows 376 cols
[2023-03-20 00:20:29] [INFO ] Computed 178 place invariants in 2 ms
[2023-03-20 00:20:29] [INFO ] Implicit Places using invariants in 325 ms returned []
[2023-03-20 00:20:29] [INFO ] Invariant cache hit.
[2023-03-20 00:20:29] [INFO ] Implicit Places using invariants and state equation in 406 ms returned []
Implicit Place search using SMT with State Equation took 756 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 376/378 places, 373/374 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1088 ms. Remains : 376/378 places, 373/374 transitions.
Finished random walk after 4493 steps, including 1 resets, run visited all 1 properties in 22 ms. (steps per millisecond=204 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 222 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 165 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 178 ms :[true, p0, p0]
Support contains 1 out of 1182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1182/1182 places, 1082/1082 transitions.
Applied a total of 0 rules in 114 ms. Remains 1182 /1182 variables (removed 0) and now considering 1082/1082 (removed 0) transitions.
// Phase 1: matrix 1082 rows 1182 cols
[2023-03-20 00:20:30] [INFO ] Computed 181 place invariants in 5 ms
[2023-03-20 00:20:31] [INFO ] Implicit Places using invariants in 356 ms returned []
[2023-03-20 00:20:31] [INFO ] Invariant cache hit.
[2023-03-20 00:20:32] [INFO ] Implicit Places using invariants and state equation in 1009 ms returned []
Implicit Place search using SMT with State Equation took 1367 ms to find 0 implicit places.
[2023-03-20 00:20:32] [INFO ] Invariant cache hit.
[2023-03-20 00:20:32] [INFO ] Dead Transitions using invariants and state equation in 545 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2029 ms. Remains : 1182/1182 places, 1082/1082 transitions.
Computed a total of 318 stabilizing places and 318 stable transitions
Computed a total of 318 stabilizing places and 318 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 192 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 144 ms :[true, p0, p0]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 311336 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :{}
Probabilistic random walk after 311336 steps, saw 157734 distinct states, run finished after 3001 ms. (steps per millisecond=103 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 00:20:36] [INFO ] Invariant cache hit.
[2023-03-20 00:20:36] [INFO ] [Real]Absence check using 181 positive place invariants in 44 ms returned sat
[2023-03-20 00:20:36] [INFO ] After 484ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 00:20:37] [INFO ] Deduced a trap composed of 16 places in 306 ms of which 2 ms to minimize.
[2023-03-20 00:20:37] [INFO ] Deduced a trap composed of 27 places in 285 ms of which 0 ms to minimize.
[2023-03-20 00:20:37] [INFO ] Deduced a trap composed of 32 places in 239 ms of which 1 ms to minimize.
[2023-03-20 00:20:38] [INFO ] Deduced a trap composed of 20 places in 219 ms of which 1 ms to minimize.
[2023-03-20 00:20:38] [INFO ] Deduced a trap composed of 26 places in 214 ms of which 1 ms to minimize.
[2023-03-20 00:20:38] [INFO ] Deduced a trap composed of 34 places in 264 ms of which 0 ms to minimize.
[2023-03-20 00:20:38] [INFO ] Deduced a trap composed of 34 places in 272 ms of which 2 ms to minimize.
[2023-03-20 00:20:39] [INFO ] Deduced a trap composed of 21 places in 276 ms of which 1 ms to minimize.
[2023-03-20 00:20:39] [INFO ] Deduced a trap composed of 21 places in 188 ms of which 1 ms to minimize.
[2023-03-20 00:20:39] [INFO ] Deduced a trap composed of 20 places in 336 ms of which 1 ms to minimize.
[2023-03-20 00:20:40] [INFO ] Deduced a trap composed of 32 places in 199 ms of which 0 ms to minimize.
[2023-03-20 00:20:40] [INFO ] Deduced a trap composed of 32 places in 175 ms of which 0 ms to minimize.
[2023-03-20 00:20:40] [INFO ] Deduced a trap composed of 30 places in 206 ms of which 0 ms to minimize.
[2023-03-20 00:20:41] [INFO ] Deduced a trap composed of 16 places in 369 ms of which 1 ms to minimize.
[2023-03-20 00:20:41] [INFO ] Deduced a trap composed of 32 places in 409 ms of which 1 ms to minimize.
[2023-03-20 00:20:41] [INFO ] Deduced a trap composed of 31 places in 211 ms of which 1 ms to minimize.
[2023-03-20 00:20:42] [INFO ] Deduced a trap composed of 31 places in 216 ms of which 1 ms to minimize.
[2023-03-20 00:20:42] [INFO ] Deduced a trap composed of 29 places in 118 ms of which 1 ms to minimize.
[2023-03-20 00:20:42] [INFO ] Deduced a trap composed of 34 places in 137 ms of which 0 ms to minimize.
[2023-03-20 00:20:42] [INFO ] Deduced a trap composed of 27 places in 164 ms of which 0 ms to minimize.
[2023-03-20 00:20:43] [INFO ] Deduced a trap composed of 34 places in 200 ms of which 1 ms to minimize.
[2023-03-20 00:20:43] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 0 ms to minimize.
[2023-03-20 00:20:43] [INFO ] Deduced a trap composed of 25 places in 189 ms of which 1 ms to minimize.
[2023-03-20 00:20:43] [INFO ] Deduced a trap composed of 35 places in 135 ms of which 1 ms to minimize.
[2023-03-20 00:20:43] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 6824 ms
[2023-03-20 00:20:43] [INFO ] After 7372ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:20:43] [INFO ] After 7617ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:20:43] [INFO ] [Nat]Absence check using 181 positive place invariants in 50 ms returned sat
[2023-03-20 00:20:44] [INFO ] After 548ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:20:44] [INFO ] Deduced a trap composed of 16 places in 193 ms of which 1 ms to minimize.
[2023-03-20 00:20:44] [INFO ] Deduced a trap composed of 27 places in 186 ms of which 1 ms to minimize.
[2023-03-20 00:20:45] [INFO ] Deduced a trap composed of 32 places in 171 ms of which 0 ms to minimize.
[2023-03-20 00:20:45] [INFO ] Deduced a trap composed of 20 places in 165 ms of which 1 ms to minimize.
[2023-03-20 00:20:45] [INFO ] Deduced a trap composed of 26 places in 339 ms of which 1 ms to minimize.
[2023-03-20 00:20:46] [INFO ] Deduced a trap composed of 34 places in 207 ms of which 1 ms to minimize.
[2023-03-20 00:20:46] [INFO ] Deduced a trap composed of 34 places in 187 ms of which 0 ms to minimize.
[2023-03-20 00:20:46] [INFO ] Deduced a trap composed of 21 places in 221 ms of which 1 ms to minimize.
[2023-03-20 00:20:46] [INFO ] Deduced a trap composed of 21 places in 195 ms of which 0 ms to minimize.
[2023-03-20 00:20:46] [INFO ] Deduced a trap composed of 20 places in 242 ms of which 1 ms to minimize.
[2023-03-20 00:20:47] [INFO ] Deduced a trap composed of 32 places in 207 ms of which 0 ms to minimize.
[2023-03-20 00:20:47] [INFO ] Deduced a trap composed of 32 places in 299 ms of which 0 ms to minimize.
[2023-03-20 00:20:47] [INFO ] Deduced a trap composed of 30 places in 161 ms of which 0 ms to minimize.
[2023-03-20 00:20:48] [INFO ] Deduced a trap composed of 16 places in 210 ms of which 1 ms to minimize.
[2023-03-20 00:20:48] [INFO ] Deduced a trap composed of 32 places in 153 ms of which 0 ms to minimize.
[2023-03-20 00:20:48] [INFO ] Deduced a trap composed of 31 places in 195 ms of which 0 ms to minimize.
[2023-03-20 00:20:48] [INFO ] Deduced a trap composed of 31 places in 191 ms of which 1 ms to minimize.
[2023-03-20 00:20:49] [INFO ] Deduced a trap composed of 29 places in 217 ms of which 1 ms to minimize.
[2023-03-20 00:20:49] [INFO ] Deduced a trap composed of 34 places in 157 ms of which 1 ms to minimize.
[2023-03-20 00:20:49] [INFO ] Deduced a trap composed of 27 places in 307 ms of which 2 ms to minimize.
[2023-03-20 00:20:49] [INFO ] Deduced a trap composed of 34 places in 193 ms of which 1 ms to minimize.
[2023-03-20 00:20:50] [INFO ] Deduced a trap composed of 30 places in 168 ms of which 0 ms to minimize.
[2023-03-20 00:20:50] [INFO ] Deduced a trap composed of 25 places in 186 ms of which 1 ms to minimize.
[2023-03-20 00:20:50] [INFO ] Deduced a trap composed of 37 places in 123 ms of which 0 ms to minimize.
[2023-03-20 00:20:50] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 1 ms to minimize.
[2023-03-20 00:20:50] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 1 ms to minimize.
[2023-03-20 00:20:50] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 6371 ms
[2023-03-20 00:20:50] [INFO ] After 6976ms 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 00:20:51] [INFO ] After 7284ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 1182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1182/1182 places, 1082/1082 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 239 rules applied. Total rules applied 239 place count 1182 transition count 843
Reduce places removed 239 places and 0 transitions.
Iterating post reduction 1 with 239 rules applied. Total rules applied 478 place count 943 transition count 843
Performed 160 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 160 Pre rules applied. Total rules applied 478 place count 943 transition count 683
Deduced a syphon composed of 160 places in 2 ms
Reduce places removed 160 places and 0 transitions.
Iterating global reduction 2 with 320 rules applied. Total rules applied 798 place count 783 transition count 683
Performed 341 Post agglomeration using F-continuation condition.Transition count delta: 341
Deduced a syphon composed of 341 places in 1 ms
Reduce places removed 341 places and 0 transitions.
Iterating global reduction 2 with 682 rules applied. Total rules applied 1480 place count 442 transition count 342
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1481 place count 442 transition count 341
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 1483 place count 441 transition count 340
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 1599 place count 383 transition count 378
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1600 place count 383 transition count 377
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1601 place count 383 transition count 376
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1602 place count 382 transition count 376
Partial Free-agglomeration rule applied 20 times.
Drop transitions removed 20 transitions
Iterating global reduction 5 with 20 rules applied. Total rules applied 1622 place count 382 transition count 376
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1623 place count 381 transition count 375
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1625 place count 379 transition count 375
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1625 place count 379 transition count 374
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1627 place count 378 transition count 374
Applied a total of 1627 rules in 85 ms. Remains 378 /1182 variables (removed 804) and now considering 374/1082 (removed 708) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 378/1182 places, 374/1082 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 619268 steps, run timeout after 3001 ms. (steps per millisecond=206 ) properties seen :{}
Probabilistic random walk after 619268 steps, saw 397361 distinct states, run finished after 3001 ms. (steps per millisecond=206 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 374 rows 378 cols
[2023-03-20 00:20:54] [INFO ] Computed 179 place invariants in 3 ms
[2023-03-20 00:20:54] [INFO ] [Real]Absence check using 179 positive place invariants in 35 ms returned sat
[2023-03-20 00:20:54] [INFO ] After 177ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 00:20:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 00:20:54] [INFO ] After 18ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:20:54] [INFO ] After 336ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:20:54] [INFO ] [Nat]Absence check using 179 positive place invariants in 27 ms returned sat
[2023-03-20 00:20:54] [INFO ] After 176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:20:54] [INFO ] After 37ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 00:20:54] [INFO ] After 80ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-20 00:20:54] [INFO ] After 387ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 378 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 374/374 transitions.
Applied a total of 0 rules in 10 ms. Remains 378 /378 variables (removed 0) and now considering 374/374 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 378/378 places, 374/374 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 374/374 transitions.
Applied a total of 0 rules in 10 ms. Remains 378 /378 variables (removed 0) and now considering 374/374 (removed 0) transitions.
[2023-03-20 00:20:54] [INFO ] Invariant cache hit.
[2023-03-20 00:20:55] [INFO ] Implicit Places using invariants in 326 ms returned [367]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 326 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 377/378 places, 374/374 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 376 transition count 373
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 376 transition count 373
Applied a total of 2 rules in 6 ms. Remains 376 /377 variables (removed 1) and now considering 373/374 (removed 1) transitions.
// Phase 1: matrix 373 rows 376 cols
[2023-03-20 00:20:55] [INFO ] Computed 178 place invariants in 1 ms
[2023-03-20 00:20:55] [INFO ] Implicit Places using invariants in 285 ms returned []
[2023-03-20 00:20:55] [INFO ] Invariant cache hit.
[2023-03-20 00:20:55] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 603 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 376/378 places, 373/374 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 946 ms. Remains : 376/378 places, 373/374 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 622360 steps, run timeout after 3001 ms. (steps per millisecond=207 ) properties seen :{}
Probabilistic random walk after 622360 steps, saw 400309 distinct states, run finished after 3001 ms. (steps per millisecond=207 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 00:20:58] [INFO ] Invariant cache hit.
[2023-03-20 00:20:59] [INFO ] [Real]Absence check using 178 positive place invariants in 92 ms returned sat
[2023-03-20 00:20:59] [INFO ] After 141ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 00:20:59] [INFO ] After 172ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-03-20 00:20:59] [INFO ] After 407ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 376 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 376/376 places, 373/373 transitions.
Applied a total of 0 rules in 6 ms. Remains 376 /376 variables (removed 0) and now considering 373/373 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 376/376 places, 373/373 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 376/376 places, 373/373 transitions.
Applied a total of 0 rules in 5 ms. Remains 376 /376 variables (removed 0) and now considering 373/373 (removed 0) transitions.
[2023-03-20 00:20:59] [INFO ] Invariant cache hit.
[2023-03-20 00:20:59] [INFO ] Implicit Places using invariants in 295 ms returned []
[2023-03-20 00:20:59] [INFO ] Invariant cache hit.
[2023-03-20 00:21:00] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 699 ms to find 0 implicit places.
[2023-03-20 00:21:00] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-20 00:21:00] [INFO ] Invariant cache hit.
[2023-03-20 00:21:00] [INFO ] Dead Transitions using invariants and state equation in 245 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 980 ms. Remains : 376/376 places, 373/373 transitions.
Partial Free-agglomeration rule applied 39 times.
Drop transitions removed 39 transitions
Iterating global reduction 0 with 39 rules applied. Total rules applied 39 place count 376 transition count 373
Applied a total of 39 rules in 7 ms. Remains 376 /376 variables (removed 0) and now considering 373/373 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 373 rows 376 cols
[2023-03-20 00:21:00] [INFO ] Computed 178 place invariants in 0 ms
[2023-03-20 00:21:00] [INFO ] [Real]Absence check using 178 positive place invariants in 65 ms returned sat
[2023-03-20 00:21:00] [INFO ] After 291ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 00:21:00] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-20 00:21:00] [INFO ] After 70ms SMT Verify possible using 37 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:21:00] [INFO ] After 518ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:21:00] [INFO ] [Nat]Absence check using 178 positive place invariants in 56 ms returned sat
[2023-03-20 00:21:01] [INFO ] After 165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:21:01] [INFO ] After 32ms SMT Verify possible using 37 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 00:21:01] [INFO ] After 66ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-20 00:21:01] [INFO ] After 442ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 291 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 176 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 135 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 128 ms :[true, p0, p0]
Product exploration explored 100000 steps with 0 reset in 384 ms.
Product exploration explored 100000 steps with 0 reset in 550 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 115 ms :[true, p0, p0]
Support contains 1 out of 1182 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1182/1182 places, 1082/1082 transitions.
Performed 239 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 239 rules applied. Total rules applied 239 place count 1182 transition count 1082
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 81 Pre rules applied. Total rules applied 239 place count 1182 transition count 1144
Deduced a syphon composed of 320 places in 1 ms
Iterating global reduction 1 with 81 rules applied. Total rules applied 320 place count 1182 transition count 1144
Performed 400 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 720 places in 1 ms
Iterating global reduction 1 with 400 rules applied. Total rules applied 720 place count 1182 transition count 1144
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 721 place count 1182 transition count 1143
Renaming transitions due to excessive name length > 1024 char.
Discarding 160 places :
Symmetric choice reduction at 2 with 160 rule applications. Total rules 881 place count 1022 transition count 983
Deduced a syphon composed of 560 places in 1 ms
Iterating global reduction 2 with 160 rules applied. Total rules applied 1041 place count 1022 transition count 983
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 561 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1042 place count 1022 transition count 983
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1044 place count 1020 transition count 981
Deduced a syphon composed of 559 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1046 place count 1020 transition count 981
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: -418
Deduced a syphon composed of 637 places in 1 ms
Iterating global reduction 2 with 78 rules applied. Total rules applied 1124 place count 1020 transition count 1399
Discarding 78 places :
Symmetric choice reduction at 2 with 78 rule applications. Total rules 1202 place count 942 transition count 1243
Deduced a syphon composed of 559 places in 0 ms
Iterating global reduction 2 with 78 rules applied. Total rules applied 1280 place count 942 transition count 1243
Deduced a syphon composed of 559 places in 1 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 1289 place count 942 transition count 1234
Deduced a syphon composed of 559 places in 1 ms
Applied a total of 1289 rules in 251 ms. Remains 942 /1182 variables (removed 240) and now considering 1234/1082 (removed -152) transitions.
[2023-03-20 00:21:03] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 1234 rows 942 cols
[2023-03-20 00:21:03] [INFO ] Computed 181 place invariants in 18 ms
[2023-03-20 00:21:04] [INFO ] Dead Transitions using invariants and state equation in 521 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 942/1182 places, 1234/1082 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 808 ms. Remains : 942/1182 places, 1234/1082 transitions.
Support contains 1 out of 1182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1182/1182 places, 1082/1082 transitions.
Applied a total of 0 rules in 71 ms. Remains 1182 /1182 variables (removed 0) and now considering 1082/1082 (removed 0) transitions.
// Phase 1: matrix 1082 rows 1182 cols
[2023-03-20 00:21:04] [INFO ] Computed 181 place invariants in 7 ms
[2023-03-20 00:21:04] [INFO ] Implicit Places using invariants in 406 ms returned []
[2023-03-20 00:21:04] [INFO ] Invariant cache hit.
[2023-03-20 00:21:05] [INFO ] Implicit Places using invariants and state equation in 1041 ms returned []
Implicit Place search using SMT with State Equation took 1464 ms to find 0 implicit places.
[2023-03-20 00:21:05] [INFO ] Invariant cache hit.
[2023-03-20 00:21:06] [INFO ] Dead Transitions using invariants and state equation in 608 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2145 ms. Remains : 1182/1182 places, 1082/1082 transitions.
Treatment of property ShieldIIPt-PT-020B-LTLFireability-12 finished in 63027 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&&G(p1)))&&X(X(F(p2))))))'
Support contains 5 out of 1190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1190/1190 places, 1090/1090 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 1182 transition count 1082
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 1182 transition count 1082
Applied a total of 16 rules in 52 ms. Remains 1182 /1190 variables (removed 8) and now considering 1082/1090 (removed 8) transitions.
// Phase 1: matrix 1082 rows 1182 cols
[2023-03-20 00:21:06] [INFO ] Computed 181 place invariants in 4 ms
[2023-03-20 00:21:06] [INFO ] Implicit Places using invariants in 286 ms returned []
[2023-03-20 00:21:06] [INFO ] Invariant cache hit.
[2023-03-20 00:21:07] [INFO ] Implicit Places using invariants and state equation in 907 ms returned []
Implicit Place search using SMT with State Equation took 1195 ms to find 0 implicit places.
[2023-03-20 00:21:07] [INFO ] Invariant cache hit.
[2023-03-20 00:21:08] [INFO ] Dead Transitions using invariants and state equation in 881 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1182/1190 places, 1082/1090 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2129 ms. Remains : 1182/1190 places, 1082/1090 transitions.
Stuttering acceptance computed with spot in 373 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s972 0) (EQ s983 0) (EQ s1009 0)), p1:(EQ s298 0), p2:(EQ s1179 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 464 ms.
Stack based approach found an accepted trace after 27267 steps with 0 reset with depth 27268 and stack size 26743 in 144 ms.
FORMULA ShieldIIPt-PT-020B-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-020B-LTLFireability-14 finished in 3134 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 3 out of 1190 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1190/1190 places, 1090/1090 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 239 rules applied. Total rules applied 239 place count 1189 transition count 850
Reduce places removed 239 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 240 rules applied. Total rules applied 479 place count 950 transition count 849
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 480 place count 949 transition count 849
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 154 Pre rules applied. Total rules applied 480 place count 949 transition count 695
Deduced a syphon composed of 154 places in 1 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 3 with 308 rules applied. Total rules applied 788 place count 795 transition count 695
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 793 place count 790 transition count 690
Iterating global reduction 3 with 5 rules applied. Total rules applied 798 place count 790 transition count 690
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 798 place count 790 transition count 685
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 808 place count 785 transition count 685
Performed 342 Post agglomeration using F-continuation condition.Transition count delta: 342
Deduced a syphon composed of 342 places in 1 ms
Reduce places removed 342 places and 0 transitions.
Iterating global reduction 3 with 684 rules applied. Total rules applied 1492 place count 443 transition count 343
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1493 place count 443 transition count 342
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1495 place count 442 transition count 341
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 1611 place count 384 transition count 378
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1613 place count 382 transition count 376
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1615 place count 380 transition count 376
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1615 place count 380 transition count 375
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1617 place count 379 transition count 375
Applied a total of 1617 rules in 132 ms. Remains 379 /1190 variables (removed 811) and now considering 375/1090 (removed 715) transitions.
// Phase 1: matrix 375 rows 379 cols
[2023-03-20 00:21:09] [INFO ] Computed 179 place invariants in 1 ms
[2023-03-20 00:21:09] [INFO ] Implicit Places using invariants in 315 ms returned [368]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 318 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 378/1190 places, 375/1090 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 377 transition count 374
Applied a total of 2 rules in 8 ms. Remains 377 /378 variables (removed 1) and now considering 374/375 (removed 1) transitions.
// Phase 1: matrix 374 rows 377 cols
[2023-03-20 00:21:09] [INFO ] Computed 178 place invariants in 1 ms
[2023-03-20 00:21:10] [INFO ] Implicit Places using invariants in 194 ms returned []
[2023-03-20 00:21:10] [INFO ] Invariant cache hit.
[2023-03-20 00:21:10] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 621 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 377/1190 places, 374/1090 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1093 ms. Remains : 377/1190 places, 374/1090 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s179 1) (EQ s181 1)), p0:(EQ s155 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-020B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-020B-LTLFireability-15 finished in 1251 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 U (p1||G(p0))))))'
Found a Shortening insensitive property : ShieldIIPt-PT-020B-LTLFireability-06
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 1190 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1190/1190 places, 1090/1090 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 238 transitions
Trivial Post-agglo rules discarded 238 transitions
Performed 238 trivial Post agglomeration. Transition count delta: 238
Iterating post reduction 0 with 238 rules applied. Total rules applied 238 place count 1189 transition count 851
Reduce places removed 238 places and 0 transitions.
Iterating post reduction 1 with 238 rules applied. Total rules applied 476 place count 951 transition count 851
Performed 156 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 156 Pre rules applied. Total rules applied 476 place count 951 transition count 695
Deduced a syphon composed of 156 places in 0 ms
Reduce places removed 156 places and 0 transitions.
Iterating global reduction 2 with 312 rules applied. Total rules applied 788 place count 795 transition count 695
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 792 place count 791 transition count 691
Iterating global reduction 2 with 4 rules applied. Total rules applied 796 place count 791 transition count 691
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 796 place count 791 transition count 687
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 804 place count 787 transition count 687
Performed 342 Post agglomeration using F-continuation condition.Transition count delta: 342
Deduced a syphon composed of 342 places in 0 ms
Reduce places removed 342 places and 0 transitions.
Iterating global reduction 2 with 684 rules applied. Total rules applied 1488 place count 445 transition count 345
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1489 place count 445 transition count 344
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 1491 place count 444 transition count 343
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 1607 place count 386 transition count 380
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1609 place count 384 transition count 378
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1611 place count 382 transition count 378
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1611 place count 382 transition count 377
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1613 place count 381 transition count 377
Applied a total of 1613 rules in 89 ms. Remains 381 /1190 variables (removed 809) and now considering 377/1090 (removed 713) transitions.
// Phase 1: matrix 377 rows 381 cols
[2023-03-20 00:21:10] [INFO ] Computed 179 place invariants in 2 ms
[2023-03-20 00:21:11] [INFO ] Implicit Places using invariants in 351 ms returned [370]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 352 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 380/1190 places, 377/1090 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 379 transition count 376
Applied a total of 2 rules in 9 ms. Remains 379 /380 variables (removed 1) and now considering 376/377 (removed 1) transitions.
// Phase 1: matrix 376 rows 379 cols
[2023-03-20 00:21:11] [INFO ] Computed 178 place invariants in 1 ms
[2023-03-20 00:21:11] [INFO ] Implicit Places using invariants in 246 ms returned []
[2023-03-20 00:21:11] [INFO ] Invariant cache hit.
[2023-03-20 00:21:11] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 00:21:11] [INFO ] Implicit Places using invariants and state equation in 421 ms returned []
Implicit Place search using SMT with State Equation took 687 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 379/1190 places, 376/1090 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1137 ms. Remains : 379/1190 places, 376/1090 transitions.
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s21 1) (NEQ s174 1)), p0:(NEQ s174 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
Treatment of property ShieldIIPt-PT-020B-LTLFireability-06 finished in 1393 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((p0 U X(G(!p0)))))'
Found a Lengthening insensitive property : ShieldIIPt-PT-020B-LTLFireability-12
Stuttering acceptance computed with spot in 185 ms :[p0, p0, true, p0]
Support contains 1 out of 1190 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1190/1190 places, 1090/1090 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 240 transitions
Trivial Post-agglo rules discarded 240 transitions
Performed 240 trivial Post agglomeration. Transition count delta: 240
Iterating post reduction 0 with 240 rules applied. Total rules applied 240 place count 1189 transition count 849
Reduce places removed 240 places and 0 transitions.
Iterating post reduction 1 with 240 rules applied. Total rules applied 480 place count 949 transition count 849
Performed 155 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 155 Pre rules applied. Total rules applied 480 place count 949 transition count 694
Deduced a syphon composed of 155 places in 2 ms
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 2 with 310 rules applied. Total rules applied 790 place count 794 transition count 694
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 795 place count 789 transition count 689
Iterating global reduction 2 with 5 rules applied. Total rules applied 800 place count 789 transition count 689
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 800 place count 789 transition count 684
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 810 place count 784 transition count 684
Performed 341 Post agglomeration using F-continuation condition.Transition count delta: 341
Deduced a syphon composed of 341 places in 1 ms
Reduce places removed 341 places and 0 transitions.
Iterating global reduction 2 with 682 rules applied. Total rules applied 1492 place count 443 transition count 343
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1493 place count 443 transition count 342
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 1495 place count 442 transition count 341
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 1611 place count 384 transition count 379
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1613 place count 382 transition count 377
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1615 place count 380 transition count 377
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1615 place count 380 transition count 376
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1617 place count 379 transition count 376
Applied a total of 1617 rules in 130 ms. Remains 379 /1190 variables (removed 811) and now considering 376/1090 (removed 714) transitions.
// Phase 1: matrix 376 rows 379 cols
[2023-03-20 00:21:12] [INFO ] Computed 179 place invariants in 2 ms
[2023-03-20 00:21:12] [INFO ] Implicit Places using invariants in 328 ms returned [368]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 328 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 378/1190 places, 376/1090 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 377 transition count 375
Applied a total of 2 rules in 7 ms. Remains 377 /378 variables (removed 1) and now considering 375/376 (removed 1) transitions.
// Phase 1: matrix 375 rows 377 cols
[2023-03-20 00:21:12] [INFO ] Computed 178 place invariants in 1 ms
[2023-03-20 00:21:12] [INFO ] Implicit Places using invariants in 218 ms returned []
[2023-03-20 00:21:12] [INFO ] Invariant cache hit.
[2023-03-20 00:21:13] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 616 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 377/1190 places, 375/1090 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1083 ms. Remains : 377/1190 places, 375/1090 transitions.
Running random walk in product with property : ShieldIIPt-PT-020B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 0}, { cond=p0, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s52 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 73784 steps with 0 reset in 317 ms.
Treatment of property ShieldIIPt-PT-020B-LTLFireability-12 finished in 1688 ms.
FORMULA ShieldIIPt-PT-020B-LTLFireability-12 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2023-03-20 00:21:13] [INFO ] Flatten gal took : 38 ms
[2023-03-20 00:21:13] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-20 00:21:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1190 places, 1090 transitions and 2820 arcs took 6 ms.
Total runtime 178471 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldIIPt-PT-020B
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/368
LTLFireability

BK_STOP 1679271879434

--------------------
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 LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/368/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/368/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/368/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:433
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 4 (type EXCL) for 3 ShieldIIPt-PT-020B-LTLFireability-12
lola: time limit : 1800 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-020B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-020B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/1800 4/32 ShieldIIPt-PT-020B-LTLFireability-12 204051 m, 40810 m/sec, 778225 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-020B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-020B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/1800 7/32 ShieldIIPt-PT-020B-LTLFireability-12 382853 m, 35760 m/sec, 1588011 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-020B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-020B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/1800 10/32 ShieldIIPt-PT-020B-LTLFireability-12 580587 m, 39546 m/sec, 2382871 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-020B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-020B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/1800 12/32 ShieldIIPt-PT-020B-LTLFireability-12 742963 m, 32475 m/sec, 3184578 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-020B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-020B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/1800 14/32 ShieldIIPt-PT-020B-LTLFireability-12 905566 m, 32520 m/sec, 3957868 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-020B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-020B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 30/1800 15/32 ShieldIIPt-PT-020B-LTLFireability-12 1078883 m, 34663 m/sec, 4750521 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-020B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-020B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 35/1800 16/32 ShieldIIPt-PT-020B-LTLFireability-12 1221215 m, 28466 m/sec, 5544558 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-020B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-020B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 40/1800 17/32 ShieldIIPt-PT-020B-LTLFireability-12 1366018 m, 28960 m/sec, 6332466 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-020B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-020B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 45/1800 18/32 ShieldIIPt-PT-020B-LTLFireability-12 1525640 m, 31924 m/sec, 7109841 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-020B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-020B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 50/1800 19/32 ShieldIIPt-PT-020B-LTLFireability-12 1660996 m, 27071 m/sec, 7905982 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-020B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-020B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 55/1800 20/32 ShieldIIPt-PT-020B-LTLFireability-12 1800791 m, 27959 m/sec, 8693193 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-020B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-020B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 60/1800 22/32 ShieldIIPt-PT-020B-LTLFireability-12 1958733 m, 31588 m/sec, 9469501 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-020B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-020B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 65/1800 23/32 ShieldIIPt-PT-020B-LTLFireability-12 2105794 m, 29412 m/sec, 10255508 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-020B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-020B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 70/1800 25/32 ShieldIIPt-PT-020B-LTLFireability-12 2258276 m, 30496 m/sec, 11039937 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-020B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-020B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 75/1800 26/32 ShieldIIPt-PT-020B-LTLFireability-12 2440029 m, 36350 m/sec, 11804465 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-020B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-020B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 80/1800 27/32 ShieldIIPt-PT-020B-LTLFireability-12 2579320 m, 27858 m/sec, 12621606 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-020B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-020B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 85/1800 28/32 ShieldIIPt-PT-020B-LTLFireability-12 2699334 m, 24002 m/sec, 13452071 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-020B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-020B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 90/1800 29/32 ShieldIIPt-PT-020B-LTLFireability-12 2856095 m, 31352 m/sec, 14251941 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-020B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-020B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 95/1800 31/32 ShieldIIPt-PT-020B-LTLFireability-12 3027441 m, 34269 m/sec, 15046706 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-020B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-020B-LTLFireability-12: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 100/1800 32/32 ShieldIIPt-PT-020B-LTLFireability-12 3193745 m, 33260 m/sec, 15838814 t fired, .

Time elapsed: 100 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 4 (type EXCL) for ShieldIIPt-PT-020B-LTLFireability-12 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-020B-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ShieldIIPt-PT-020B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 105 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 1 (type EXCL) for 0 ShieldIIPt-PT-020B-LTLFireability-06
lola: time limit : 3495 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-020B-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-020B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3495 4/32 ShieldIIPt-PT-020B-LTLFireability-06 215238 m, 43047 m/sec, 822810 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-020B-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-020B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3495 7/32 ShieldIIPt-PT-020B-LTLFireability-06 401716 m, 37295 m/sec, 1649145 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-020B-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-020B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3495 10/32 ShieldIIPt-PT-020B-LTLFireability-06 596297 m, 38916 m/sec, 2460864 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-020B-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-020B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3495 12/32 ShieldIIPt-PT-020B-LTLFireability-06 763243 m, 33389 m/sec, 3276386 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-020B-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-020B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3495 14/32 ShieldIIPt-PT-020B-LTLFireability-06 939828 m, 35317 m/sec, 4080261 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-020B-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-020B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3495 15/32 ShieldIIPt-PT-020B-LTLFireability-06 1106443 m, 33323 m/sec, 4879630 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-020B-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-020B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3495 16/32 ShieldIIPt-PT-020B-LTLFireability-06 1248643 m, 28440 m/sec, 5700935 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-020B-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-020B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/3495 17/32 ShieldIIPt-PT-020B-LTLFireability-06 1403206 m, 30912 m/sec, 6514712 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-020B-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-020B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/3495 18/32 ShieldIIPt-PT-020B-LTLFireability-06 1565503 m, 32459 m/sec, 7325276 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-020B-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-020B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/3495 19/32 ShieldIIPt-PT-020B-LTLFireability-06 1703768 m, 27653 m/sec, 8146196 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-020B-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-020B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 55/3495 20/32 ShieldIIPt-PT-020B-LTLFireability-06 1844144 m, 28075 m/sec, 8959086 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-020B-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-020B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 60/3495 22/32 ShieldIIPt-PT-020B-LTLFireability-06 2016881 m, 34547 m/sec, 9765129 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-020B-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-020B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 65/3495 24/32 ShieldIIPt-PT-020B-LTLFireability-06 2159276 m, 28479 m/sec, 10590429 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-020B-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-020B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 70/3495 26/32 ShieldIIPt-PT-020B-LTLFireability-06 2344440 m, 37032 m/sec, 11364979 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-020B-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-020B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 75/3495 27/32 ShieldIIPt-PT-020B-LTLFireability-06 2505104 m, 32132 m/sec, 12166059 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-020B-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-020B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 80/3495 28/32 ShieldIIPt-PT-020B-LTLFireability-06 2635499 m, 26079 m/sec, 12988846 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-020B-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-020B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 85/3495 29/32 ShieldIIPt-PT-020B-LTLFireability-06 2757026 m, 24305 m/sec, 13817988 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-020B-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-020B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 90/3495 30/32 ShieldIIPt-PT-020B-LTLFireability-06 2930800 m, 34754 m/sec, 14603849 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-020B-LTLFireability-06: LTL 0 0 1 0 1 0 0 0
ShieldIIPt-PT-020B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 95/3495 31/32 ShieldIIPt-PT-020B-LTLFireability-06 3100878 m, 34015 m/sec, 15395065 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldIIPt-PT-020B-LTLFireability-06: LTL 0 0 0 0 1 0 1 0
ShieldIIPt-PT-020B-LTLFireability-12: LTL 0 0 0 0 1 0 1 0

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

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

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-020B-LTLFireability-06: LTL unknown AGGR
ShieldIIPt-PT-020B-LTLFireability-12: LTL unknown AGGR


Time elapsed: 205 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is ShieldIIPt-PT-020B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r391-oct2-167903715100284"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-020B.tgz
mv ShieldIIPt-PT-020B execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;