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-167903715100316.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-040B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r391-oct2-167903715100316
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.0K Feb 25 17:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 17:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 17:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 17:06 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 4.1K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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 9.6K Feb 25 17:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 17:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 17:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 25 17:07 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 686K 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-040B-LTLFireability-00
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-01
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-02
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-03
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-04
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-05
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-06
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-07
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-08
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-09
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-10
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-11
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-12
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-13
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-14
FORMULA_NAME ShieldIIPt-PT-040B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679273109250

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-040B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 00:45:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 00:45:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 00:45:11] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2023-03-20 00:45:11] [INFO ] Transformed 2803 places.
[2023-03-20 00:45:11] [INFO ] Transformed 2603 transitions.
[2023-03-20 00:45:11] [INFO ] Found NUPN structural information;
[2023-03-20 00:45:12] [INFO ] Parsed PT model containing 2803 places and 2603 transitions and 6486 arcs in 333 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Support contains 43 out of 2803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2803/2803 places, 2603/2603 transitions.
Discarding 429 places :
Symmetric choice reduction at 0 with 429 rule applications. Total rules 429 place count 2374 transition count 2174
Iterating global reduction 0 with 429 rules applied. Total rules applied 858 place count 2374 transition count 2174
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 859 place count 2373 transition count 2173
Iterating global reduction 0 with 1 rules applied. Total rules applied 860 place count 2373 transition count 2173
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 861 place count 2372 transition count 2172
Iterating global reduction 0 with 1 rules applied. Total rules applied 862 place count 2372 transition count 2172
Applied a total of 862 rules in 1164 ms. Remains 2372 /2803 variables (removed 431) and now considering 2172/2603 (removed 431) transitions.
// Phase 1: matrix 2172 rows 2372 cols
[2023-03-20 00:45:13] [INFO ] Computed 361 place invariants in 40 ms
[2023-03-20 00:45:15] [INFO ] Implicit Places using invariants in 1568 ms returned []
[2023-03-20 00:45:15] [INFO ] Invariant cache hit.
[2023-03-20 00:45:18] [INFO ] Implicit Places using invariants and state equation in 3025 ms returned []
Implicit Place search using SMT with State Equation took 4640 ms to find 0 implicit places.
[2023-03-20 00:45:18] [INFO ] Invariant cache hit.
[2023-03-20 00:45:20] [INFO ] Dead Transitions using invariants and state equation in 2219 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2372/2803 places, 2172/2603 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8028 ms. Remains : 2372/2803 places, 2172/2603 transitions.
Support contains 43 out of 2372 places after structural reductions.
[2023-03-20 00:45:20] [INFO ] Flatten gal took : 157 ms
[2023-03-20 00:45:20] [INFO ] Flatten gal took : 88 ms
[2023-03-20 00:45:20] [INFO ] Input system was already deterministic with 2172 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 651 ms. (steps per millisecond=15 ) properties (out of 36) seen :16
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
[2023-03-20 00:45:21] [INFO ] Invariant cache hit.
[2023-03-20 00:45:23] [INFO ] After 1629ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2023-03-20 00:45:25] [INFO ] [Nat]Absence check using 361 positive place invariants in 184 ms returned sat
[2023-03-20 00:45:30] [INFO ] After 3991ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :20
[2023-03-20 00:45:31] [INFO ] Deduced a trap composed of 19 places in 580 ms of which 17 ms to minimize.
[2023-03-20 00:45:31] [INFO ] Deduced a trap composed of 35 places in 661 ms of which 1 ms to minimize.
[2023-03-20 00:45:32] [INFO ] Deduced a trap composed of 19 places in 594 ms of which 12 ms to minimize.
[2023-03-20 00:45:33] [INFO ] Deduced a trap composed of 19 places in 591 ms of which 1 ms to minimize.
[2023-03-20 00:45:33] [INFO ] Deduced a trap composed of 17 places in 637 ms of which 16 ms to minimize.
[2023-03-20 00:45:34] [INFO ] Deduced a trap composed of 18 places in 495 ms of which 4 ms to minimize.
[2023-03-20 00:45:35] [INFO ] Deduced a trap composed of 20 places in 539 ms of which 10 ms to minimize.
[2023-03-20 00:45:35] [INFO ] Deduced a trap composed of 17 places in 652 ms of which 1 ms to minimize.
[2023-03-20 00:45:36] [INFO ] Deduced a trap composed of 19 places in 441 ms of which 4 ms to minimize.
[2023-03-20 00:45:36] [INFO ] Deduced a trap composed of 29 places in 450 ms of which 2 ms to minimize.
[2023-03-20 00:45:37] [INFO ] Deduced a trap composed of 39 places in 543 ms of which 1 ms to minimize.
[2023-03-20 00:45:37] [INFO ] Deduced a trap composed of 17 places in 425 ms of which 1 ms to minimize.
[2023-03-20 00:45:38] [INFO ] Deduced a trap composed of 19 places in 359 ms of which 1 ms to minimize.
[2023-03-20 00:45:38] [INFO ] Deduced a trap composed of 29 places in 416 ms of which 1 ms to minimize.
[2023-03-20 00:45:39] [INFO ] Deduced a trap composed of 29 places in 408 ms of which 1 ms to minimize.
[2023-03-20 00:45:39] [INFO ] Deduced a trap composed of 22 places in 386 ms of which 1 ms to minimize.
[2023-03-20 00:45:40] [INFO ] Deduced a trap composed of 26 places in 445 ms of which 1 ms to minimize.
[2023-03-20 00:45:40] [INFO ] Deduced a trap composed of 23 places in 391 ms of which 1 ms to minimize.
[2023-03-20 00:45:41] [INFO ] Deduced a trap composed of 31 places in 343 ms of which 1 ms to minimize.
[2023-03-20 00:45:41] [INFO ] Deduced a trap composed of 31 places in 452 ms of which 1 ms to minimize.
[2023-03-20 00:45:42] [INFO ] Deduced a trap composed of 37 places in 356 ms of which 1 ms to minimize.
[2023-03-20 00:45:42] [INFO ] Deduced a trap composed of 31 places in 468 ms of which 1 ms to minimize.
[2023-03-20 00:45:43] [INFO ] Deduced a trap composed of 26 places in 372 ms of which 1 ms to minimize.
[2023-03-20 00:45:43] [INFO ] Deduced a trap composed of 27 places in 379 ms of which 1 ms to minimize.
[2023-03-20 00:45:44] [INFO ] Deduced a trap composed of 31 places in 335 ms of which 1 ms to minimize.
[2023-03-20 00:45:44] [INFO ] Deduced a trap composed of 30 places in 281 ms of which 1 ms to minimize.
[2023-03-20 00:45:44] [INFO ] Deduced a trap composed of 20 places in 415 ms of which 4 ms to minimize.
[2023-03-20 00:45:45] [INFO ] Deduced a trap composed of 45 places in 316 ms of which 1 ms to minimize.
[2023-03-20 00:45:45] [INFO ] Deduced a trap composed of 27 places in 298 ms of which 1 ms to minimize.
[2023-03-20 00:45:45] [INFO ] Deduced a trap composed of 36 places in 310 ms of which 1 ms to minimize.
[2023-03-20 00:45:46] [INFO ] Deduced a trap composed of 32 places in 380 ms of which 0 ms to minimize.
[2023-03-20 00:45:46] [INFO ] Deduced a trap composed of 34 places in 278 ms of which 1 ms to minimize.
[2023-03-20 00:45:47] [INFO ] Deduced a trap composed of 36 places in 298 ms of which 1 ms to minimize.
[2023-03-20 00:45:47] [INFO ] Deduced a trap composed of 34 places in 351 ms of which 5 ms to minimize.
[2023-03-20 00:45:47] [INFO ] Deduced a trap composed of 43 places in 327 ms of which 1 ms to minimize.
[2023-03-20 00:45:48] [INFO ] Deduced a trap composed of 35 places in 354 ms of which 0 ms to minimize.
[2023-03-20 00:45:48] [INFO ] Deduced a trap composed of 42 places in 421 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.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
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:45:48] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 00:45:48] [INFO ] After 25395ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:20
Fused 20 Parikh solutions to 18 different solutions.
Parikh walk visited 0 properties in 1528 ms.
Support contains 26 out of 2372 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2372/2372 places, 2172/2172 transitions.
Drop transitions removed 466 transitions
Trivial Post-agglo rules discarded 466 transitions
Performed 466 trivial Post agglomeration. Transition count delta: 466
Iterating post reduction 0 with 466 rules applied. Total rules applied 466 place count 2372 transition count 1706
Reduce places removed 466 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 469 rules applied. Total rules applied 935 place count 1906 transition count 1703
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 938 place count 1903 transition count 1703
Performed 307 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 307 Pre rules applied. Total rules applied 938 place count 1903 transition count 1396
Deduced a syphon composed of 307 places in 2 ms
Reduce places removed 307 places and 0 transitions.
Iterating global reduction 3 with 614 rules applied. Total rules applied 1552 place count 1596 transition count 1396
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1554 place count 1594 transition count 1394
Iterating global reduction 3 with 2 rules applied. Total rules applied 1556 place count 1594 transition count 1394
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 1556 place count 1594 transition count 1392
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1560 place count 1592 transition count 1392
Performed 683 Post agglomeration using F-continuation condition.Transition count delta: 683
Deduced a syphon composed of 683 places in 2 ms
Reduce places removed 683 places and 0 transitions.
Iterating global reduction 3 with 1366 rules applied. Total rules applied 2926 place count 909 transition count 709
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2927 place count 909 transition count 708
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 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2929 place count 908 transition count 707
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -62
Deduced a syphon composed of 101 places in 2 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3131 place count 807 transition count 769
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 11 places in 3 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 3153 place count 796 transition count 776
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3154 place count 796 transition count 775
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 3157 place count 796 transition count 772
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 3160 place count 793 transition count 772
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 6 with 40 rules applied. Total rules applied 3200 place count 793 transition count 772
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 3201 place count 792 transition count 771
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 3203 place count 790 transition count 771
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 3203 place count 790 transition count 770
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 3205 place count 789 transition count 770
Applied a total of 3205 rules in 550 ms. Remains 789 /2372 variables (removed 1583) and now considering 770/2172 (removed 1402) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 551 ms. Remains : 789/2372 places, 770/2172 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 380 ms. (steps per millisecond=26 ) properties (out of 20) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
// Phase 1: matrix 770 rows 789 cols
[2023-03-20 00:45:51] [INFO ] Computed 359 place invariants in 4 ms
[2023-03-20 00:45:51] [INFO ] After 464ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2023-03-20 00:45:52] [INFO ] [Nat]Absence check using 359 positive place invariants in 96 ms returned sat
[2023-03-20 00:45:53] [INFO ] After 1093ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2023-03-20 00:45:53] [INFO ] State equation strengthened by 82 read => feed constraints.
[2023-03-20 00:45:54] [INFO ] After 679ms SMT Verify possible using 82 Read/Feed constraints in natural domain returned unsat :0 sat :18
[2023-03-20 00:45:55] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 0 ms to minimize.
[2023-03-20 00:45:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 270 ms
[2023-03-20 00:45:55] [INFO ] After 2065ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :18
Attempting to minimize the solution found.
Minimization took 579 ms.
[2023-03-20 00:45:56] [INFO ] After 4454ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :18
Parikh walk visited 0 properties in 425 ms.
Support contains 24 out of 789 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 789/789 places, 770/770 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 789 transition count 769
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 788 transition count 769
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 787 transition count 769
Applied a total of 4 rules in 42 ms. Remains 787 /789 variables (removed 2) and now considering 769/770 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 787/789 places, 769/770 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 503 ms. (steps per millisecond=19 ) properties (out of 18) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 769 rows 787 cols
[2023-03-20 00:45:57] [INFO ] Computed 359 place invariants in 2 ms
[2023-03-20 00:45:57] [INFO ] After 247ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-20 00:45:58] [INFO ] [Nat]Absence check using 359 positive place invariants in 111 ms returned sat
[2023-03-20 00:45:59] [INFO ] After 1091ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-20 00:45:59] [INFO ] State equation strengthened by 82 read => feed constraints.
[2023-03-20 00:46:00] [INFO ] After 697ms SMT Verify possible using 82 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2023-03-20 00:46:01] [INFO ] After 1900ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 701 ms.
[2023-03-20 00:46:02] [INFO ] After 4346ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Parikh walk visited 0 properties in 287 ms.
Support contains 21 out of 787 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 787/787 places, 769/769 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 787 transition count 768
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 786 transition count 768
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 784 transition count 766
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 783 transition count 767
Applied a total of 8 rules in 48 ms. Remains 783 /787 variables (removed 4) and now considering 767/769 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 783/787 places, 767/769 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 308 ms. (steps per millisecond=32 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 70151 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 70151 steps, saw 44719 distinct states, run finished after 3003 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 15 properties.
// Phase 1: matrix 767 rows 783 cols
[2023-03-20 00:46:05] [INFO ] Computed 359 place invariants in 2 ms
[2023-03-20 00:46:06] [INFO ] After 264ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-20 00:46:06] [INFO ] [Nat]Absence check using 359 positive place invariants in 100 ms returned sat
[2023-03-20 00:46:08] [INFO ] After 1310ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-20 00:46:08] [INFO ] State equation strengthened by 82 read => feed constraints.
[2023-03-20 00:46:09] [INFO ] After 924ms SMT Verify possible using 82 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2023-03-20 00:46:10] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 1 ms to minimize.
[2023-03-20 00:46:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 244 ms
[2023-03-20 00:46:10] [INFO ] After 2429ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 706 ms.
[2023-03-20 00:46:11] [INFO ] After 5393ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Fused 15 Parikh solutions to 14 different solutions.
Parikh walk visited 0 properties in 521 ms.
Support contains 21 out of 783 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 783/783 places, 767/767 transitions.
Applied a total of 0 rules in 17 ms. Remains 783 /783 variables (removed 0) and now considering 767/767 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 783/783 places, 767/767 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 783/783 places, 767/767 transitions.
Applied a total of 0 rules in 16 ms. Remains 783 /783 variables (removed 0) and now considering 767/767 (removed 0) transitions.
[2023-03-20 00:46:12] [INFO ] Invariant cache hit.
[2023-03-20 00:46:12] [INFO ] Implicit Places using invariants in 431 ms returned [772]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 435 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 782/783 places, 767/767 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 781 transition count 766
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 781 transition count 766
Applied a total of 2 rules in 25 ms. Remains 781 /782 variables (removed 1) and now considering 766/767 (removed 1) transitions.
// Phase 1: matrix 766 rows 781 cols
[2023-03-20 00:46:12] [INFO ] Computed 358 place invariants in 1 ms
[2023-03-20 00:46:12] [INFO ] Implicit Places using invariants in 342 ms returned []
[2023-03-20 00:46:12] [INFO ] Invariant cache hit.
[2023-03-20 00:46:13] [INFO ] State equation strengthened by 81 read => feed constraints.
[2023-03-20 00:46:14] [INFO ] Implicit Places using invariants and state equation in 1998 ms returned []
Implicit Place search using SMT with State Equation took 2356 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 781/783 places, 766/767 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2832 ms. Remains : 781/783 places, 766/767 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 94875 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 94875 steps, saw 61148 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 15 properties.
[2023-03-20 00:46:18] [INFO ] Invariant cache hit.
[2023-03-20 00:46:18] [INFO ] After 244ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-20 00:46:18] [INFO ] [Nat]Absence check using 358 positive place invariants in 59 ms returned sat
[2023-03-20 00:46:20] [INFO ] After 1038ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-20 00:46:20] [INFO ] State equation strengthened by 81 read => feed constraints.
[2023-03-20 00:46:21] [INFO ] After 941ms SMT Verify possible using 81 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2023-03-20 00:46:22] [INFO ] After 2092ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 780 ms.
[2023-03-20 00:46:23] [INFO ] After 4765ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Fused 15 Parikh solutions to 14 different solutions.
Parikh walk visited 0 properties in 364 ms.
Support contains 21 out of 781 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 781/781 places, 766/766 transitions.
Applied a total of 0 rules in 16 ms. Remains 781 /781 variables (removed 0) and now considering 766/766 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 781/781 places, 766/766 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 781/781 places, 766/766 transitions.
Applied a total of 0 rules in 14 ms. Remains 781 /781 variables (removed 0) and now considering 766/766 (removed 0) transitions.
[2023-03-20 00:46:23] [INFO ] Invariant cache hit.
[2023-03-20 00:46:24] [INFO ] Implicit Places using invariants in 472 ms returned []
[2023-03-20 00:46:24] [INFO ] Invariant cache hit.
[2023-03-20 00:46:24] [INFO ] State equation strengthened by 81 read => feed constraints.
[2023-03-20 00:46:26] [INFO ] Implicit Places using invariants and state equation in 2142 ms returned []
Implicit Place search using SMT with State Equation took 2631 ms to find 0 implicit places.
[2023-03-20 00:46:26] [INFO ] Redundant transitions in 46 ms returned []
[2023-03-20 00:46:26] [INFO ] Invariant cache hit.
[2023-03-20 00:46:26] [INFO ] Dead Transitions using invariants and state equation in 574 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3285 ms. Remains : 781/781 places, 766/766 transitions.
Partial Free-agglomeration rule applied 99 times.
Drop transitions removed 99 transitions
Iterating global reduction 0 with 99 rules applied. Total rules applied 99 place count 781 transition count 766
Applied a total of 99 rules in 29 ms. Remains 781 /781 variables (removed 0) and now considering 766/766 (removed 0) transitions.
Running SMT prover for 15 properties.
// Phase 1: matrix 766 rows 781 cols
[2023-03-20 00:46:26] [INFO ] Computed 358 place invariants in 2 ms
[2023-03-20 00:46:27] [INFO ] After 397ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-20 00:46:27] [INFO ] [Nat]Absence check using 358 positive place invariants in 103 ms returned sat
[2023-03-20 00:46:29] [INFO ] After 1129ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-20 00:46:29] [INFO ] State equation strengthened by 97 read => feed constraints.
[2023-03-20 00:46:30] [INFO ] After 913ms SMT Verify possible using 97 Read/Feed constraints in natural domain returned unsat :0 sat :15
[2023-03-20 00:46:31] [INFO ] After 2192ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 733 ms.
[2023-03-20 00:46:32] [INFO ] After 4970ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Computed a total of 639 stabilizing places and 639 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((G(p1)||p0)))))'
Support contains 4 out of 2372 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2372/2372 places, 2172/2172 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 2361 transition count 2161
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 2361 transition count 2161
Applied a total of 22 rules in 368 ms. Remains 2361 /2372 variables (removed 11) and now considering 2161/2172 (removed 11) transitions.
// Phase 1: matrix 2161 rows 2361 cols
[2023-03-20 00:46:33] [INFO ] Computed 361 place invariants in 11 ms
[2023-03-20 00:46:34] [INFO ] Implicit Places using invariants in 1073 ms returned []
[2023-03-20 00:46:34] [INFO ] Invariant cache hit.
[2023-03-20 00:46:36] [INFO ] Implicit Places using invariants and state equation in 2569 ms returned []
Implicit Place search using SMT with State Equation took 3664 ms to find 0 implicit places.
[2023-03-20 00:46:36] [INFO ] Invariant cache hit.
[2023-03-20 00:46:38] [INFO ] Dead Transitions using invariants and state equation in 1392 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2361/2372 places, 2161/2172 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5437 ms. Remains : 2361/2372 places, 2161/2172 transitions.
Stuttering acceptance computed with spot in 440 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(EQ s321 0), p0:(OR (EQ s994 0) (EQ s1019 0) (EQ s1028 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 885 ms.
Product exploration explored 100000 steps with 0 reset in 1032 ms.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 364 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 268 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 320 ms. (steps per millisecond=31 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 91559 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{}
Probabilistic random walk after 91559 steps, saw 59791 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-20 00:46:44] [INFO ] Invariant cache hit.
[2023-03-20 00:46:45] [INFO ] After 388ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 00:46:46] [INFO ] [Nat]Absence check using 361 positive place invariants in 423 ms returned sat
[2023-03-20 00:46:48] [INFO ] After 1913ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 00:46:48] [INFO ] Deduced a trap composed of 17 places in 499 ms of which 1 ms to minimize.
[2023-03-20 00:46:49] [INFO ] Deduced a trap composed of 23 places in 708 ms of which 2 ms to minimize.
[2023-03-20 00:46:50] [INFO ] Deduced a trap composed of 30 places in 750 ms of which 1 ms to minimize.
[2023-03-20 00:46:51] [INFO ] Deduced a trap composed of 30 places in 631 ms of which 1 ms to minimize.
[2023-03-20 00:46:51] [INFO ] Deduced a trap composed of 28 places in 535 ms of which 1 ms to minimize.
[2023-03-20 00:46:52] [INFO ] Deduced a trap composed of 33 places in 517 ms of which 1 ms to minimize.
[2023-03-20 00:46:53] [INFO ] Deduced a trap composed of 34 places in 538 ms of which 1 ms to minimize.
[2023-03-20 00:46:53] [INFO ] Deduced a trap composed of 34 places in 432 ms of which 2 ms to minimize.
[2023-03-20 00:46:54] [INFO ] Deduced a trap composed of 16 places in 511 ms of which 1 ms to minimize.
[2023-03-20 00:46:54] [INFO ] Deduced a trap composed of 32 places in 473 ms of which 2 ms to minimize.
[2023-03-20 00:46:55] [INFO ] Deduced a trap composed of 19 places in 476 ms of which 1 ms to minimize.
[2023-03-20 00:46:55] [INFO ] Deduced a trap composed of 32 places in 437 ms of which 1 ms to minimize.
[2023-03-20 00:46:56] [INFO ] Deduced a trap composed of 20 places in 478 ms of which 1 ms to minimize.
[2023-03-20 00:46:56] [INFO ] Deduced a trap composed of 35 places in 454 ms of which 1 ms to minimize.
[2023-03-20 00:46:57] [INFO ] Deduced a trap composed of 26 places in 449 ms of which 1 ms to minimize.
[2023-03-20 00:46:58] [INFO ] Deduced a trap composed of 18 places in 469 ms of which 1 ms to minimize.
[2023-03-20 00:46:58] [INFO ] Deduced a trap composed of 25 places in 480 ms of which 1 ms to minimize.
[2023-03-20 00:46:59] [INFO ] Deduced a trap composed of 30 places in 420 ms of which 1 ms to minimize.
[2023-03-20 00:46:59] [INFO ] Deduced a trap composed of 22 places in 447 ms of which 1 ms to minimize.
[2023-03-20 00:47:00] [INFO ] Deduced a trap composed of 22 places in 497 ms of which 1 ms to minimize.
[2023-03-20 00:47:00] [INFO ] Deduced a trap composed of 27 places in 439 ms of which 2 ms to minimize.
[2023-03-20 00:47:01] [INFO ] Deduced a trap composed of 19 places in 431 ms of which 17 ms to minimize.
[2023-03-20 00:47:01] [INFO ] Deduced a trap composed of 35 places in 454 ms of which 1 ms to minimize.
[2023-03-20 00:47:02] [INFO ] Deduced a trap composed of 23 places in 486 ms of which 1 ms to minimize.
[2023-03-20 00:47:02] [INFO ] Deduced a trap composed of 28 places in 351 ms of which 1 ms to minimize.
[2023-03-20 00:47:03] [INFO ] Deduced a trap composed of 27 places in 633 ms of which 2 ms to minimize.
[2023-03-20 00:47:04] [INFO ] Deduced a trap composed of 29 places in 388 ms of which 1 ms to minimize.
[2023-03-20 00:47:04] [INFO ] Deduced a trap composed of 26 places in 458 ms of which 1 ms to minimize.
[2023-03-20 00:47:05] [INFO ] Deduced a trap composed of 36 places in 410 ms of which 1 ms to minimize.
[2023-03-20 00:47:05] [INFO ] Deduced a trap composed of 31 places in 545 ms of which 1 ms to minimize.
[2023-03-20 00:47:06] [INFO ] Deduced a trap composed of 27 places in 399 ms of which 1 ms to minimize.
[2023-03-20 00:47:06] [INFO ] Deduced a trap composed of 23 places in 437 ms of which 1 ms to minimize.
[2023-03-20 00:47:07] [INFO ] Deduced a trap composed of 25 places in 407 ms of which 2 ms to minimize.
[2023-03-20 00:47:07] [INFO ] Deduced a trap composed of 31 places in 341 ms of which 1 ms to minimize.
[2023-03-20 00:47:08] [INFO ] Deduced a trap composed of 32 places in 788 ms of which 1 ms to minimize.
[2023-03-20 00:47:08] [INFO ] Deduced a trap composed of 19 places in 331 ms of which 1 ms to minimize.
[2023-03-20 00:47:09] [INFO ] Deduced a trap composed of 34 places in 346 ms of which 1 ms to minimize.
[2023-03-20 00:47:09] [INFO ] Deduced a trap composed of 38 places in 426 ms of which 1 ms to minimize.
[2023-03-20 00:47:10] [INFO ] Deduced a trap composed of 29 places in 330 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
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:47:10] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 00:47:10] [INFO ] After 25048ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 347 ms.
Support contains 4 out of 2361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2361/2361 places, 2161/2161 transitions.
Drop transitions removed 477 transitions
Trivial Post-agglo rules discarded 477 transitions
Performed 477 trivial Post agglomeration. Transition count delta: 477
Iterating post reduction 0 with 477 rules applied. Total rules applied 477 place count 2361 transition count 1684
Reduce places removed 477 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 478 rules applied. Total rules applied 955 place count 1884 transition count 1683
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 956 place count 1883 transition count 1683
Performed 319 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 319 Pre rules applied. Total rules applied 956 place count 1883 transition count 1364
Deduced a syphon composed of 319 places in 2 ms
Reduce places removed 319 places and 0 transitions.
Iterating global reduction 3 with 638 rules applied. Total rules applied 1594 place count 1564 transition count 1364
Performed 680 Post agglomeration using F-continuation condition.Transition count delta: 680
Deduced a syphon composed of 680 places in 1 ms
Reduce places removed 680 places and 0 transitions.
Iterating global reduction 3 with 1360 rules applied. Total rules applied 2954 place count 884 transition count 684
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2955 place count 884 transition count 683
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 2957 place count 883 transition count 682
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -67
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3159 place count 782 transition count 749
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 3193 place count 765 transition count 760
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3194 place count 765 transition count 759
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 5 with 40 rules applied. Total rules applied 3234 place count 765 transition count 759
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3235 place count 764 transition count 758
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 3237 place count 762 transition count 758
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 3237 place count 762 transition count 757
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 3239 place count 761 transition count 757
Applied a total of 3239 rules in 348 ms. Remains 761 /2361 variables (removed 1600) and now considering 757/2161 (removed 1404) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 349 ms. Remains : 761/2361 places, 757/2161 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 275 ms. (steps per millisecond=36 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 116228 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 116228 steps, saw 74378 distinct states, run finished after 3001 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 757 rows 761 cols
[2023-03-20 00:47:14] [INFO ] Computed 359 place invariants in 2 ms
[2023-03-20 00:47:14] [INFO ] After 156ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 00:47:14] [INFO ] [Nat]Absence check using 359 positive place invariants in 56 ms returned sat
[2023-03-20 00:47:15] [INFO ] After 403ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 00:47:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 00:47:15] [INFO ] After 188ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-20 00:47:15] [INFO ] After 461ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 186 ms.
[2023-03-20 00:47:16] [INFO ] After 1329ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 105 ms.
Support contains 4 out of 761 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 761/761 places, 757/757 transitions.
Applied a total of 0 rules in 14 ms. Remains 761 /761 variables (removed 0) and now considering 757/757 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 761/761 places, 757/757 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 761/761 places, 757/757 transitions.
Applied a total of 0 rules in 16 ms. Remains 761 /761 variables (removed 0) and now considering 757/757 (removed 0) transitions.
[2023-03-20 00:47:16] [INFO ] Invariant cache hit.
[2023-03-20 00:47:16] [INFO ] Implicit Places using invariants in 475 ms returned [750]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 476 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 760/761 places, 757/757 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 759 transition count 756
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 759 transition count 756
Applied a total of 2 rules in 24 ms. Remains 759 /760 variables (removed 1) and now considering 756/757 (removed 1) transitions.
// Phase 1: matrix 756 rows 759 cols
[2023-03-20 00:47:16] [INFO ] Computed 358 place invariants in 5 ms
[2023-03-20 00:47:17] [INFO ] Implicit Places using invariants in 447 ms returned []
[2023-03-20 00:47:17] [INFO ] Invariant cache hit.
[2023-03-20 00:47:18] [INFO ] Implicit Places using invariants and state equation in 986 ms returned []
Implicit Place search using SMT with State Equation took 1446 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 759/761 places, 756/757 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1962 ms. Remains : 759/761 places, 756/757 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 109813 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 109813 steps, saw 70177 distinct states, run finished after 3001 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-20 00:47:21] [INFO ] Invariant cache hit.
[2023-03-20 00:47:21] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 00:47:21] [INFO ] [Nat]Absence check using 358 positive place invariants in 45 ms returned sat
[2023-03-20 00:47:22] [INFO ] After 433ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 00:47:22] [INFO ] After 719ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 176 ms.
[2023-03-20 00:47:22] [INFO ] After 1119ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 134 ms.
Support contains 4 out of 759 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 756/756 transitions.
Applied a total of 0 rules in 15 ms. Remains 759 /759 variables (removed 0) and now considering 756/756 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 759/759 places, 756/756 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 756/756 transitions.
Applied a total of 0 rules in 15 ms. Remains 759 /759 variables (removed 0) and now considering 756/756 (removed 0) transitions.
[2023-03-20 00:47:23] [INFO ] Invariant cache hit.
[2023-03-20 00:47:23] [INFO ] Implicit Places using invariants in 481 ms returned []
[2023-03-20 00:47:23] [INFO ] Invariant cache hit.
[2023-03-20 00:47:25] [INFO ] Implicit Places using invariants and state equation in 1526 ms returned []
Implicit Place search using SMT with State Equation took 2010 ms to find 0 implicit places.
[2023-03-20 00:47:25] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-20 00:47:25] [INFO ] Invariant cache hit.
[2023-03-20 00:47:25] [INFO ] Dead Transitions using invariants and state equation in 462 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2502 ms. Remains : 759/759 places, 756/756 transitions.
Partial Free-agglomeration rule applied 78 times.
Drop transitions removed 78 transitions
Iterating global reduction 0 with 78 rules applied. Total rules applied 78 place count 759 transition count 756
Applied a total of 78 rules in 23 ms. Remains 759 /759 variables (removed 0) and now considering 756/756 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 756 rows 759 cols
[2023-03-20 00:47:25] [INFO ] Computed 358 place invariants in 4 ms
[2023-03-20 00:47:25] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 00:47:25] [INFO ] [Nat]Absence check using 358 positive place invariants in 65 ms returned sat
[2023-03-20 00:47:26] [INFO ] After 430ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 00:47:26] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-03-20 00:47:26] [INFO ] After 170ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-20 00:47:26] [INFO ] After 387ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 237 ms.
[2023-03-20 00:47:27] [INFO ] After 1471ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 302 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 311 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 2361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2361/2361 places, 2161/2161 transitions.
Applied a total of 0 rules in 154 ms. Remains 2361 /2361 variables (removed 0) and now considering 2161/2161 (removed 0) transitions.
// Phase 1: matrix 2161 rows 2361 cols
[2023-03-20 00:47:28] [INFO ] Computed 361 place invariants in 14 ms
[2023-03-20 00:47:29] [INFO ] Implicit Places using invariants in 1451 ms returned []
[2023-03-20 00:47:29] [INFO ] Invariant cache hit.
[2023-03-20 00:47:32] [INFO ] Implicit Places using invariants and state equation in 2351 ms returned []
Implicit Place search using SMT with State Equation took 3830 ms to find 0 implicit places.
[2023-03-20 00:47:32] [INFO ] Invariant cache hit.
[2023-03-20 00:47:33] [INFO ] Dead Transitions using invariants and state equation in 1550 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5535 ms. Remains : 2361/2361 places, 2161/2161 transitions.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 152 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 285 ms. (steps per millisecond=35 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 95126 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 95126 steps, saw 61720 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-20 00:47:37] [INFO ] Invariant cache hit.
[2023-03-20 00:47:37] [INFO ] After 449ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 00:47:38] [INFO ] [Nat]Absence check using 361 positive place invariants in 462 ms returned sat
[2023-03-20 00:47:40] [INFO ] After 1724ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 00:47:41] [INFO ] Deduced a trap composed of 17 places in 589 ms of which 3 ms to minimize.
[2023-03-20 00:47:41] [INFO ] Deduced a trap composed of 23 places in 495 ms of which 1 ms to minimize.
[2023-03-20 00:47:42] [INFO ] Deduced a trap composed of 30 places in 593 ms of which 2 ms to minimize.
[2023-03-20 00:47:43] [INFO ] Deduced a trap composed of 30 places in 623 ms of which 1 ms to minimize.
[2023-03-20 00:47:44] [INFO ] Deduced a trap composed of 28 places in 773 ms of which 2 ms to minimize.
[2023-03-20 00:47:45] [INFO ] Deduced a trap composed of 33 places in 658 ms of which 1 ms to minimize.
[2023-03-20 00:47:45] [INFO ] Deduced a trap composed of 34 places in 555 ms of which 1 ms to minimize.
[2023-03-20 00:47:46] [INFO ] Deduced a trap composed of 34 places in 518 ms of which 1 ms to minimize.
[2023-03-20 00:47:47] [INFO ] Deduced a trap composed of 16 places in 674 ms of which 1 ms to minimize.
[2023-03-20 00:47:47] [INFO ] Deduced a trap composed of 32 places in 559 ms of which 1 ms to minimize.
[2023-03-20 00:47:48] [INFO ] Deduced a trap composed of 19 places in 663 ms of which 2 ms to minimize.
[2023-03-20 00:47:49] [INFO ] Deduced a trap composed of 32 places in 449 ms of which 1 ms to minimize.
[2023-03-20 00:47:49] [INFO ] Deduced a trap composed of 20 places in 504 ms of which 1 ms to minimize.
[2023-03-20 00:47:50] [INFO ] Deduced a trap composed of 35 places in 456 ms of which 2 ms to minimize.
[2023-03-20 00:47:50] [INFO ] Deduced a trap composed of 26 places in 450 ms of which 1 ms to minimize.
[2023-03-20 00:47:51] [INFO ] Deduced a trap composed of 18 places in 746 ms of which 1 ms to minimize.
[2023-03-20 00:47:52] [INFO ] Deduced a trap composed of 25 places in 662 ms of which 1 ms to minimize.
[2023-03-20 00:47:52] [INFO ] Deduced a trap composed of 30 places in 424 ms of which 1 ms to minimize.
[2023-03-20 00:47:53] [INFO ] Deduced a trap composed of 22 places in 439 ms of which 1 ms to minimize.
[2023-03-20 00:47:53] [INFO ] Deduced a trap composed of 22 places in 541 ms of which 2 ms to minimize.
[2023-03-20 00:47:54] [INFO ] Deduced a trap composed of 27 places in 583 ms of which 1 ms to minimize.
[2023-03-20 00:47:55] [INFO ] Deduced a trap composed of 19 places in 438 ms of which 1 ms to minimize.
[2023-03-20 00:47:55] [INFO ] Deduced a trap composed of 35 places in 471 ms of which 1 ms to minimize.
[2023-03-20 00:47:56] [INFO ] Deduced a trap composed of 23 places in 402 ms of which 1 ms to minimize.
[2023-03-20 00:47:56] [INFO ] Deduced a trap composed of 28 places in 411 ms of which 1 ms to minimize.
[2023-03-20 00:47:57] [INFO ] Deduced a trap composed of 27 places in 478 ms of which 1 ms to minimize.
[2023-03-20 00:47:57] [INFO ] Deduced a trap composed of 29 places in 400 ms of which 1 ms to minimize.
[2023-03-20 00:47:58] [INFO ] Deduced a trap composed of 26 places in 347 ms of which 1 ms to minimize.
[2023-03-20 00:47:58] [INFO ] Deduced a trap composed of 36 places in 383 ms of which 1 ms to minimize.
[2023-03-20 00:47:59] [INFO ] Deduced a trap composed of 31 places in 370 ms of which 1 ms to minimize.
[2023-03-20 00:47:59] [INFO ] Deduced a trap composed of 27 places in 427 ms of which 0 ms to minimize.
[2023-03-20 00:48:00] [INFO ] Deduced a trap composed of 23 places in 351 ms of which 1 ms to minimize.
[2023-03-20 00:48:00] [INFO ] Deduced a trap composed of 25 places in 404 ms of which 0 ms to minimize.
[2023-03-20 00:48:00] [INFO ] Deduced a trap composed of 31 places in 312 ms of which 1 ms to minimize.
[2023-03-20 00:48:01] [INFO ] Deduced a trap composed of 32 places in 301 ms of which 0 ms to minimize.
[2023-03-20 00:48:01] [INFO ] Deduced a trap composed of 19 places in 400 ms of which 1 ms to minimize.
[2023-03-20 00:48:02] [INFO ] Deduced a trap composed of 34 places in 555 ms of which 3 ms to minimize.
[2023-03-20 00:48:02] [INFO ] Deduced a trap composed of 38 places in 344 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.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-20 00:48:02] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 00:48:02] [INFO ] After 25039ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 333 ms.
Support contains 4 out of 2361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2361/2361 places, 2161/2161 transitions.
Drop transitions removed 477 transitions
Trivial Post-agglo rules discarded 477 transitions
Performed 477 trivial Post agglomeration. Transition count delta: 477
Iterating post reduction 0 with 477 rules applied. Total rules applied 477 place count 2361 transition count 1684
Reduce places removed 477 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 478 rules applied. Total rules applied 955 place count 1884 transition count 1683
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 956 place count 1883 transition count 1683
Performed 319 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 319 Pre rules applied. Total rules applied 956 place count 1883 transition count 1364
Deduced a syphon composed of 319 places in 2 ms
Reduce places removed 319 places and 0 transitions.
Iterating global reduction 3 with 638 rules applied. Total rules applied 1594 place count 1564 transition count 1364
Performed 680 Post agglomeration using F-continuation condition.Transition count delta: 680
Deduced a syphon composed of 680 places in 1 ms
Reduce places removed 680 places and 0 transitions.
Iterating global reduction 3 with 1360 rules applied. Total rules applied 2954 place count 884 transition count 684
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2955 place count 884 transition count 683
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 2957 place count 883 transition count 682
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -67
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3159 place count 782 transition count 749
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 3193 place count 765 transition count 760
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3194 place count 765 transition count 759
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 5 with 40 rules applied. Total rules applied 3234 place count 765 transition count 759
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3235 place count 764 transition count 758
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 3237 place count 762 transition count 758
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 3237 place count 762 transition count 757
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 3239 place count 761 transition count 757
Applied a total of 3239 rules in 316 ms. Remains 761 /2361 variables (removed 1600) and now considering 757/2161 (removed 1404) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 316 ms. Remains : 761/2361 places, 757/2161 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 263 ms. (steps per millisecond=38 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 109209 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 109209 steps, saw 69763 distinct states, run finished after 3001 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 757 rows 761 cols
[2023-03-20 00:48:07] [INFO ] Computed 359 place invariants in 2 ms
[2023-03-20 00:48:07] [INFO ] After 218ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 00:48:07] [INFO ] [Nat]Absence check using 359 positive place invariants in 77 ms returned sat
[2023-03-20 00:48:08] [INFO ] After 538ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 00:48:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 00:48:08] [INFO ] After 251ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-20 00:48:08] [INFO ] After 598ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 213 ms.
[2023-03-20 00:48:09] [INFO ] After 1800ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 114 ms.
Support contains 4 out of 761 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 761/761 places, 757/757 transitions.
Applied a total of 0 rules in 15 ms. Remains 761 /761 variables (removed 0) and now considering 757/757 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 761/761 places, 757/757 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 761/761 places, 757/757 transitions.
Applied a total of 0 rules in 15 ms. Remains 761 /761 variables (removed 0) and now considering 757/757 (removed 0) transitions.
[2023-03-20 00:48:09] [INFO ] Invariant cache hit.
[2023-03-20 00:48:09] [INFO ] Implicit Places using invariants in 497 ms returned [750]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 511 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 760/761 places, 757/757 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 759 transition count 756
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 759 transition count 756
Applied a total of 2 rules in 23 ms. Remains 759 /760 variables (removed 1) and now considering 756/757 (removed 1) transitions.
// Phase 1: matrix 756 rows 759 cols
[2023-03-20 00:48:09] [INFO ] Computed 358 place invariants in 3 ms
[2023-03-20 00:48:10] [INFO ] Implicit Places using invariants in 484 ms returned []
[2023-03-20 00:48:10] [INFO ] Invariant cache hit.
[2023-03-20 00:48:11] [INFO ] Implicit Places using invariants and state equation in 1029 ms returned []
Implicit Place search using SMT with State Equation took 1528 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 759/761 places, 756/757 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2077 ms. Remains : 759/761 places, 756/757 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 121426 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 121426 steps, saw 77685 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-20 00:48:14] [INFO ] Invariant cache hit.
[2023-03-20 00:48:14] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 00:48:15] [INFO ] [Nat]Absence check using 358 positive place invariants in 63 ms returned sat
[2023-03-20 00:48:15] [INFO ] After 468ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 00:48:16] [INFO ] After 787ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 256 ms.
[2023-03-20 00:48:16] [INFO ] After 1383ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 61 ms.
Support contains 4 out of 759 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 756/756 transitions.
Applied a total of 0 rules in 17 ms. Remains 759 /759 variables (removed 0) and now considering 756/756 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 759/759 places, 756/756 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 756/756 transitions.
Applied a total of 0 rules in 15 ms. Remains 759 /759 variables (removed 0) and now considering 756/756 (removed 0) transitions.
[2023-03-20 00:48:16] [INFO ] Invariant cache hit.
[2023-03-20 00:48:16] [INFO ] Implicit Places using invariants in 465 ms returned []
[2023-03-20 00:48:16] [INFO ] Invariant cache hit.
[2023-03-20 00:48:17] [INFO ] Implicit Places using invariants and state equation in 965 ms returned []
Implicit Place search using SMT with State Equation took 1434 ms to find 0 implicit places.
[2023-03-20 00:48:17] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-20 00:48:17] [INFO ] Invariant cache hit.
[2023-03-20 00:48:18] [INFO ] Dead Transitions using invariants and state equation in 379 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1844 ms. Remains : 759/759 places, 756/756 transitions.
Partial Free-agglomeration rule applied 78 times.
Drop transitions removed 78 transitions
Iterating global reduction 0 with 78 rules applied. Total rules applied 78 place count 759 transition count 756
Applied a total of 78 rules in 28 ms. Remains 759 /759 variables (removed 0) and now considering 756/756 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 756 rows 759 cols
[2023-03-20 00:48:18] [INFO ] Computed 358 place invariants in 2 ms
[2023-03-20 00:48:18] [INFO ] After 165ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 00:48:18] [INFO ] [Nat]Absence check using 358 positive place invariants in 76 ms returned sat
[2023-03-20 00:48:19] [INFO ] After 559ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 00:48:19] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-03-20 00:48:19] [INFO ] After 173ms SMT Verify possible using 76 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-20 00:48:19] [INFO ] After 465ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 133 ms.
[2023-03-20 00:48:19] [INFO ] After 1388ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 202 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 220 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 753 ms.
Product exploration explored 100000 steps with 0 reset in 956 ms.
Applying partial POR strategy [true, true, true, false, false]
Stuttering acceptance computed with spot in 221 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 2361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2361/2361 places, 2161/2161 transitions.
Performed 478 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 478 rules applied. Total rules applied 478 place count 2361 transition count 2161
Performed 161 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 161 Pre rules applied. Total rules applied 478 place count 2361 transition count 2281
Deduced a syphon composed of 639 places in 3 ms
Iterating global reduction 1 with 161 rules applied. Total rules applied 639 place count 2361 transition count 2281
Performed 798 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1437 places in 3 ms
Iterating global reduction 1 with 798 rules applied. Total rules applied 1437 place count 2361 transition count 2281
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1438 place count 2361 transition count 2280
Renaming transitions due to excessive name length > 1024 char.
Discarding 318 places :
Symmetric choice reduction at 2 with 318 rule applications. Total rules 1756 place count 2043 transition count 1962
Deduced a syphon composed of 1119 places in 3 ms
Iterating global reduction 2 with 318 rules applied. Total rules applied 2074 place count 2043 transition count 1962
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1120 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2075 place count 2043 transition count 1962
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2077 place count 2041 transition count 1960
Deduced a syphon composed of 1118 places in 2 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2079 place count 2041 transition count 1960
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -521
Deduced a syphon composed of 1219 places in 3 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2180 place count 2041 transition count 2481
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 2281 place count 1940 transition count 2279
Deduced a syphon composed of 1118 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2382 place count 1940 transition count 2279
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: -307
Deduced a syphon composed of 1175 places in 3 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 2439 place count 1940 transition count 2586
Discarding 57 places :
Symmetric choice reduction at 2 with 57 rule applications. Total rules 2496 place count 1883 transition count 2472
Deduced a syphon composed of 1118 places in 3 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 2553 place count 1883 transition count 2472
Deduced a syphon composed of 1118 places in 3 ms
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 2562 place count 1883 transition count 2463
Deduced a syphon composed of 1118 places in 3 ms
Applied a total of 2562 rules in 1668 ms. Remains 1883 /2361 variables (removed 478) and now considering 2463/2161 (removed -302) transitions.
[2023-03-20 00:48:24] [INFO ] Redundant transitions in 57 ms returned []
// Phase 1: matrix 2463 rows 1883 cols
[2023-03-20 00:48:24] [INFO ] Computed 361 place invariants in 39 ms
[2023-03-20 00:48:26] [INFO ] Dead Transitions using invariants and state equation in 1578 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1883/2361 places, 2463/2161 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3319 ms. Remains : 1883/2361 places, 2463/2161 transitions.
Support contains 4 out of 2361 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2361/2361 places, 2161/2161 transitions.
Applied a total of 0 rules in 117 ms. Remains 2361 /2361 variables (removed 0) and now considering 2161/2161 (removed 0) transitions.
// Phase 1: matrix 2161 rows 2361 cols
[2023-03-20 00:48:26] [INFO ] Computed 361 place invariants in 6 ms
[2023-03-20 00:48:26] [INFO ] Implicit Places using invariants in 722 ms returned []
[2023-03-20 00:48:26] [INFO ] Invariant cache hit.
[2023-03-20 00:48:29] [INFO ] Implicit Places using invariants and state equation in 2967 ms returned []
Implicit Place search using SMT with State Equation took 3704 ms to find 0 implicit places.
[2023-03-20 00:48:29] [INFO ] Invariant cache hit.
[2023-03-20 00:48:31] [INFO ] Dead Transitions using invariants and state equation in 1561 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5396 ms. Remains : 2361/2361 places, 2161/2161 transitions.
Treatment of property ShieldIIPt-PT-040B-LTLFireability-00 finished in 118961 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&&G(p2))))))'
Support contains 3 out of 2372 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2372/2372 places, 2172/2172 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 2363 transition count 2163
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 2363 transition count 2163
Applied a total of 18 rules in 287 ms. Remains 2363 /2372 variables (removed 9) and now considering 2163/2172 (removed 9) transitions.
// Phase 1: matrix 2163 rows 2363 cols
[2023-03-20 00:48:32] [INFO ] Computed 361 place invariants in 15 ms
[2023-03-20 00:48:33] [INFO ] Implicit Places using invariants in 1020 ms returned []
[2023-03-20 00:48:33] [INFO ] Invariant cache hit.
[2023-03-20 00:48:36] [INFO ] Implicit Places using invariants and state equation in 2986 ms returned []
Implicit Place search using SMT with State Equation took 4011 ms to find 0 implicit places.
[2023-03-20 00:48:36] [INFO ] Invariant cache hit.
[2023-03-20 00:48:37] [INFO ] Dead Transitions using invariants and state equation in 1614 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2363/2372 places, 2163/2172 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5925 ms. Remains : 2363/2372 places, 2163/2172 transitions.
Stuttering acceptance computed with spot in 279 ms :[true, (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-01 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: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p1 p2), acceptance={} source=4 dest: 3}]], initial=1, aps=[p0:(EQ s503 0), p2:(EQ s216 0), p1:(EQ s1478 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-040B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-LTLFireability-01 finished in 6241 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 2372 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2372/2372 places, 2172/2172 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 479 transitions
Trivial Post-agglo rules discarded 479 transitions
Performed 479 trivial Post agglomeration. Transition count delta: 479
Iterating post reduction 0 with 479 rules applied. Total rules applied 479 place count 2371 transition count 1692
Reduce places removed 479 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 480 rules applied. Total rules applied 959 place count 1892 transition count 1691
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 960 place count 1891 transition count 1691
Performed 313 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 313 Pre rules applied. Total rules applied 960 place count 1891 transition count 1378
Deduced a syphon composed of 313 places in 2 ms
Reduce places removed 313 places and 0 transitions.
Iterating global reduction 3 with 626 rules applied. Total rules applied 1586 place count 1578 transition count 1378
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1592 place count 1572 transition count 1372
Iterating global reduction 3 with 6 rules applied. Total rules applied 1598 place count 1572 transition count 1372
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 1598 place count 1572 transition count 1366
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 1610 place count 1566 transition count 1366
Performed 681 Post agglomeration using F-continuation condition.Transition count delta: 681
Deduced a syphon composed of 681 places in 1 ms
Reduce places removed 681 places and 0 transitions.
Iterating global reduction 3 with 1362 rules applied. Total rules applied 2972 place count 885 transition count 685
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2973 place count 885 transition count 684
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 2975 place count 884 transition count 683
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3177 place count 783 transition count 748
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 3213 place count 765 transition count 761
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3215 place count 763 transition count 759
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 3217 place count 761 transition count 759
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 3217 place count 761 transition count 758
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3219 place count 760 transition count 758
Applied a total of 3219 rules in 449 ms. Remains 760 /2372 variables (removed 1612) and now considering 758/2172 (removed 1414) transitions.
// Phase 1: matrix 758 rows 760 cols
[2023-03-20 00:48:38] [INFO ] Computed 359 place invariants in 2 ms
[2023-03-20 00:48:38] [INFO ] Implicit Places using invariants in 430 ms returned [749]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 431 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 759/2372 places, 758/2172 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 758 transition count 757
Applied a total of 2 rules in 25 ms. Remains 758 /759 variables (removed 1) and now considering 757/758 (removed 1) transitions.
// Phase 1: matrix 757 rows 758 cols
[2023-03-20 00:48:38] [INFO ] Computed 358 place invariants in 2 ms
[2023-03-20 00:48:39] [INFO ] Implicit Places using invariants in 469 ms returned []
[2023-03-20 00:48:39] [INFO ] Invariant cache hit.
[2023-03-20 00:48:40] [INFO ] Implicit Places using invariants and state equation in 831 ms returned []
Implicit Place search using SMT with State Equation took 1319 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 758/2372 places, 757/2172 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2225 ms. Remains : 758/2372 places, 757/2172 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s150 1) (EQ s403 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-040B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-LTLFireability-02 finished in 2271 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&&F(p1)))))'
Support contains 2 out of 2372 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2372/2372 places, 2172/2172 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 2362 transition count 2162
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 2362 transition count 2162
Applied a total of 20 rules in 265 ms. Remains 2362 /2372 variables (removed 10) and now considering 2162/2172 (removed 10) transitions.
// Phase 1: matrix 2162 rows 2362 cols
[2023-03-20 00:48:40] [INFO ] Computed 361 place invariants in 7 ms
[2023-03-20 00:48:41] [INFO ] Implicit Places using invariants in 745 ms returned []
[2023-03-20 00:48:41] [INFO ] Invariant cache hit.
[2023-03-20 00:48:43] [INFO ] Implicit Places using invariants and state equation in 2267 ms returned []
Implicit Place search using SMT with State Equation took 3061 ms to find 0 implicit places.
[2023-03-20 00:48:43] [INFO ] Invariant cache hit.
[2023-03-20 00:48:45] [INFO ] Dead Transitions using invariants and state equation in 1431 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2362/2372 places, 2162/2172 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4760 ms. Remains : 2362/2372 places, 2162/2172 transitions.
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s2233 1), p1:(NEQ s726 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-040B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-LTLFireability-03 finished in 4936 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 1 out of 2372 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2372/2372 places, 2172/2172 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 479 transitions
Trivial Post-agglo rules discarded 479 transitions
Performed 479 trivial Post agglomeration. Transition count delta: 479
Iterating post reduction 0 with 479 rules applied. Total rules applied 479 place count 2371 transition count 1692
Reduce places removed 479 places and 0 transitions.
Iterating post reduction 1 with 479 rules applied. Total rules applied 958 place count 1892 transition count 1692
Performed 313 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 313 Pre rules applied. Total rules applied 958 place count 1892 transition count 1379
Deduced a syphon composed of 313 places in 2 ms
Reduce places removed 313 places and 0 transitions.
Iterating global reduction 2 with 626 rules applied. Total rules applied 1584 place count 1579 transition count 1379
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1591 place count 1572 transition count 1372
Iterating global reduction 2 with 7 rules applied. Total rules applied 1598 place count 1572 transition count 1372
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 1598 place count 1572 transition count 1365
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 1612 place count 1565 transition count 1365
Performed 682 Post agglomeration using F-continuation condition.Transition count delta: 682
Deduced a syphon composed of 682 places in 0 ms
Reduce places removed 682 places and 0 transitions.
Iterating global reduction 2 with 1364 rules applied. Total rules applied 2976 place count 883 transition count 683
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2977 place count 883 transition count 682
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 2979 place count 882 transition count 681
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -67
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3181 place count 781 transition count 748
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 3215 place count 764 transition count 759
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3217 place count 762 transition count 757
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 3219 place count 760 transition count 757
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 3219 place count 760 transition count 756
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 3221 place count 759 transition count 756
Applied a total of 3221 rules in 503 ms. Remains 759 /2372 variables (removed 1613) and now considering 756/2172 (removed 1416) transitions.
// Phase 1: matrix 756 rows 759 cols
[2023-03-20 00:48:45] [INFO ] Computed 359 place invariants in 1 ms
[2023-03-20 00:48:46] [INFO ] Implicit Places using invariants in 421 ms returned [748]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 423 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 758/2372 places, 756/2172 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 757 transition count 755
Applied a total of 2 rules in 20 ms. Remains 757 /758 variables (removed 1) and now considering 755/756 (removed 1) transitions.
// Phase 1: matrix 755 rows 757 cols
[2023-03-20 00:48:46] [INFO ] Computed 358 place invariants in 1 ms
[2023-03-20 00:48:46] [INFO ] Implicit Places using invariants in 440 ms returned []
[2023-03-20 00:48:46] [INFO ] Invariant cache hit.
[2023-03-20 00:48:47] [INFO ] Implicit Places using invariants and state equation in 1010 ms returned []
Implicit Place search using SMT with State Equation took 1459 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 757/2372 places, 755/2172 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2417 ms. Remains : 757/2372 places, 755/2172 transitions.
Stuttering acceptance computed with spot in 43 ms :[true, (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-04 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:(NEQ s92 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 717 ms.
Product exploration explored 100000 steps with 0 reset in 942 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 303 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 276328 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :{}
Probabilistic random walk after 276328 steps, saw 174169 distinct states, run finished after 3001 ms. (steps per millisecond=92 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 00:48:52] [INFO ] Invariant cache hit.
[2023-03-20 00:48:53] [INFO ] [Real]Absence check using 358 positive place invariants in 374 ms returned sat
[2023-03-20 00:48:53] [INFO ] After 253ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 00:48:53] [INFO ] After 324ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-20 00:48:53] [INFO ] After 935ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 757 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 757/757 places, 755/755 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 757 transition count 754
Applied a total of 1 rules in 20 ms. Remains 757 /757 variables (removed 0) and now considering 754/755 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 757/757 places, 754/755 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 260175 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :{}
Probabilistic random walk after 260175 steps, saw 165409 distinct states, run finished after 3001 ms. (steps per millisecond=86 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 754 rows 757 cols
[2023-03-20 00:48:56] [INFO ] Computed 358 place invariants in 3 ms
[2023-03-20 00:48:57] [INFO ] [Real]Absence check using 358 positive place invariants in 56 ms returned sat
[2023-03-20 00:48:57] [INFO ] After 525ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:48:57] [INFO ] [Nat]Absence check using 358 positive place invariants in 80 ms returned sat
[2023-03-20 00:48:58] [INFO ] After 283ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:48:58] [INFO ] After 356ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2023-03-20 00:48:58] [INFO ] After 703ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 757 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 757/757 places, 754/754 transitions.
Applied a total of 0 rules in 28 ms. Remains 757 /757 variables (removed 0) and now considering 754/754 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 757/757 places, 754/754 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 757/757 places, 754/754 transitions.
Applied a total of 0 rules in 19 ms. Remains 757 /757 variables (removed 0) and now considering 754/754 (removed 0) transitions.
[2023-03-20 00:48:58] [INFO ] Invariant cache hit.
[2023-03-20 00:48:58] [INFO ] Implicit Places using invariants in 544 ms returned []
[2023-03-20 00:48:58] [INFO ] Invariant cache hit.
[2023-03-20 00:48:59] [INFO ] Implicit Places using invariants and state equation in 887 ms returned []
Implicit Place search using SMT with State Equation took 1459 ms to find 0 implicit places.
[2023-03-20 00:48:59] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-20 00:48:59] [INFO ] Invariant cache hit.
[2023-03-20 00:49:00] [INFO ] Dead Transitions using invariants and state equation in 417 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1935 ms. Remains : 757/757 places, 754/754 transitions.
Partial Free-agglomeration rule applied 79 times.
Drop transitions removed 79 transitions
Iterating global reduction 0 with 79 rules applied. Total rules applied 79 place count 757 transition count 754
Applied a total of 79 rules in 26 ms. Remains 757 /757 variables (removed 0) and now considering 754/754 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 754 rows 757 cols
[2023-03-20 00:49:00] [INFO ] Computed 358 place invariants in 4 ms
[2023-03-20 00:49:00] [INFO ] [Real]Absence check using 358 positive place invariants in 40 ms returned sat
[2023-03-20 00:49:00] [INFO ] After 306ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 00:49:00] [INFO ] After 388ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-03-20 00:49:00] [INFO ] After 584ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 252 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0)]
Support contains 1 out of 757 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 757/757 places, 755/755 transitions.
Applied a total of 0 rules in 44 ms. Remains 757 /757 variables (removed 0) and now considering 755/755 (removed 0) transitions.
// Phase 1: matrix 755 rows 757 cols
[2023-03-20 00:49:01] [INFO ] Computed 358 place invariants in 3 ms
[2023-03-20 00:49:01] [INFO ] Implicit Places using invariants in 521 ms returned []
[2023-03-20 00:49:01] [INFO ] Invariant cache hit.
[2023-03-20 00:49:02] [INFO ] Implicit Places using invariants and state equation in 956 ms returned []
Implicit Place search using SMT with State Equation took 1491 ms to find 0 implicit places.
[2023-03-20 00:49:02] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-20 00:49:02] [INFO ] Invariant cache hit.
[2023-03-20 00:49:03] [INFO ] Dead Transitions using invariants and state equation in 453 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2002 ms. Remains : 757/757 places, 755/755 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 141 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 280742 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :{}
Probabilistic random walk after 280742 steps, saw 177048 distinct states, run finished after 3001 ms. (steps per millisecond=93 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 00:49:06] [INFO ] Invariant cache hit.
[2023-03-20 00:49:06] [INFO ] [Real]Absence check using 358 positive place invariants in 50 ms returned sat
[2023-03-20 00:49:07] [INFO ] After 402ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 00:49:07] [INFO ] After 455ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 56 ms.
[2023-03-20 00:49:07] [INFO ] After 779ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 757 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 757/757 places, 755/755 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 757 transition count 754
Applied a total of 1 rules in 18 ms. Remains 757 /757 variables (removed 0) and now considering 754/755 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 757/757 places, 754/755 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 285084 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :{}
Probabilistic random walk after 285084 steps, saw 180040 distinct states, run finished after 3014 ms. (steps per millisecond=94 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 754 rows 757 cols
[2023-03-20 00:49:10] [INFO ] Computed 358 place invariants in 3 ms
[2023-03-20 00:49:10] [INFO ] [Real]Absence check using 358 positive place invariants in 72 ms returned sat
[2023-03-20 00:49:11] [INFO ] After 543ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:49:11] [INFO ] [Nat]Absence check using 358 positive place invariants in 165 ms returned sat
[2023-03-20 00:49:11] [INFO ] After 272ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:49:11] [INFO ] After 362ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-20 00:49:11] [INFO ] After 811ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 757 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 757/757 places, 754/754 transitions.
Applied a total of 0 rules in 26 ms. Remains 757 /757 variables (removed 0) and now considering 754/754 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 757/757 places, 754/754 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 757/757 places, 754/754 transitions.
Applied a total of 0 rules in 18 ms. Remains 757 /757 variables (removed 0) and now considering 754/754 (removed 0) transitions.
[2023-03-20 00:49:12] [INFO ] Invariant cache hit.
[2023-03-20 00:49:12] [INFO ] Implicit Places using invariants in 540 ms returned []
[2023-03-20 00:49:12] [INFO ] Invariant cache hit.
[2023-03-20 00:49:13] [INFO ] Implicit Places using invariants and state equation in 959 ms returned []
Implicit Place search using SMT with State Equation took 1522 ms to find 0 implicit places.
[2023-03-20 00:49:13] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-20 00:49:13] [INFO ] Invariant cache hit.
[2023-03-20 00:49:13] [INFO ] Dead Transitions using invariants and state equation in 413 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1969 ms. Remains : 757/757 places, 754/754 transitions.
Partial Free-agglomeration rule applied 79 times.
Drop transitions removed 79 transitions
Iterating global reduction 0 with 79 rules applied. Total rules applied 79 place count 757 transition count 754
Applied a total of 79 rules in 21 ms. Remains 757 /757 variables (removed 0) and now considering 754/754 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 754 rows 757 cols
[2023-03-20 00:49:14] [INFO ] Computed 358 place invariants in 2 ms
[2023-03-20 00:49:14] [INFO ] [Real]Absence check using 358 positive place invariants in 36 ms returned sat
[2023-03-20 00:49:14] [INFO ] After 321ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 00:49:14] [INFO ] After 409ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 74 ms.
[2023-03-20 00:49:14] [INFO ] After 664ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 309 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 766 ms.
Product exploration explored 100000 steps with 0 reset in 922 ms.
Support contains 1 out of 757 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 757/757 places, 755/755 transitions.
Applied a total of 0 rules in 26 ms. Remains 757 /757 variables (removed 0) and now considering 755/755 (removed 0) transitions.
// Phase 1: matrix 755 rows 757 cols
[2023-03-20 00:49:17] [INFO ] Computed 358 place invariants in 3 ms
[2023-03-20 00:49:17] [INFO ] Implicit Places using invariants in 628 ms returned []
[2023-03-20 00:49:17] [INFO ] Invariant cache hit.
[2023-03-20 00:49:18] [INFO ] Implicit Places using invariants and state equation in 1180 ms returned []
Implicit Place search using SMT with State Equation took 1816 ms to find 0 implicit places.
[2023-03-20 00:49:18] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-20 00:49:18] [INFO ] Invariant cache hit.
[2023-03-20 00:49:19] [INFO ] Dead Transitions using invariants and state equation in 481 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2372 ms. Remains : 757/757 places, 755/755 transitions.
Treatment of property ShieldIIPt-PT-040B-LTLFireability-04 finished in 34206 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((G((X(p0) U p1))||(p0 U p2)))||F(G(p0)))))'
Support contains 4 out of 2372 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2372/2372 places, 2172/2172 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 2361 transition count 2161
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 2361 transition count 2161
Applied a total of 22 rules in 313 ms. Remains 2361 /2372 variables (removed 11) and now considering 2161/2172 (removed 11) transitions.
// Phase 1: matrix 2161 rows 2361 cols
[2023-03-20 00:49:19] [INFO ] Computed 361 place invariants in 17 ms
[2023-03-20 00:49:20] [INFO ] Implicit Places using invariants in 1019 ms returned []
[2023-03-20 00:49:20] [INFO ] Invariant cache hit.
[2023-03-20 00:49:23] [INFO ] Implicit Places using invariants and state equation in 2530 ms returned []
Implicit Place search using SMT with State Equation took 3585 ms to find 0 implicit places.
[2023-03-20 00:49:23] [INFO ] Invariant cache hit.
[2023-03-20 00:49:24] [INFO ] Dead Transitions using invariants and state equation in 1437 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2361/2372 places, 2161/2172 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5348 ms. Remains : 2361/2372 places, 2161/2172 transitions.
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={1} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p2:(AND (EQ s2158 1) (EQ s2207 1)), p0:(EQ s1844 1), p1:(EQ s784 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 40 reset in 832 ms.
Stack based approach found an accepted trace after 2912 steps with 1 reset with depth 985 and stack size 985 in 40 ms.
FORMULA ShieldIIPt-PT-040B-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-040B-LTLFireability-05 finished in 6442 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 2372 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2372/2372 places, 2172/2172 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 479 transitions
Trivial Post-agglo rules discarded 479 transitions
Performed 479 trivial Post agglomeration. Transition count delta: 479
Iterating post reduction 0 with 479 rules applied. Total rules applied 479 place count 2371 transition count 1692
Reduce places removed 479 places and 0 transitions.
Iterating post reduction 1 with 479 rules applied. Total rules applied 958 place count 1892 transition count 1692
Performed 314 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 314 Pre rules applied. Total rules applied 958 place count 1892 transition count 1378
Deduced a syphon composed of 314 places in 2 ms
Reduce places removed 314 places and 0 transitions.
Iterating global reduction 2 with 628 rules applied. Total rules applied 1586 place count 1578 transition count 1378
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1593 place count 1571 transition count 1371
Iterating global reduction 2 with 7 rules applied. Total rules applied 1600 place count 1571 transition count 1371
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 1600 place count 1571 transition count 1364
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 1614 place count 1564 transition count 1364
Performed 680 Post agglomeration using F-continuation condition.Transition count delta: 680
Deduced a syphon composed of 680 places in 0 ms
Reduce places removed 680 places and 0 transitions.
Iterating global reduction 2 with 1360 rules applied. Total rules applied 2974 place count 884 transition count 684
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2975 place count 884 transition count 683
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 2977 place count 883 transition count 682
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3179 place count 782 transition count 748
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 3215 place count 764 transition count 761
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3217 place count 762 transition count 759
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 3219 place count 760 transition count 759
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 3219 place count 760 transition count 758
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 3221 place count 759 transition count 758
Applied a total of 3221 rules in 317 ms. Remains 759 /2372 variables (removed 1613) and now considering 758/2172 (removed 1414) transitions.
// Phase 1: matrix 758 rows 759 cols
[2023-03-20 00:49:26] [INFO ] Computed 359 place invariants in 14 ms
[2023-03-20 00:49:26] [INFO ] Implicit Places using invariants in 595 ms returned [748]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 596 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 758/2372 places, 758/2172 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 757 transition count 757
Applied a total of 2 rules in 31 ms. Remains 757 /758 variables (removed 1) and now considering 757/758 (removed 1) transitions.
// Phase 1: matrix 757 rows 757 cols
[2023-03-20 00:49:26] [INFO ] Computed 358 place invariants in 1 ms
[2023-03-20 00:49:27] [INFO ] Implicit Places using invariants in 422 ms returned []
[2023-03-20 00:49:27] [INFO ] Invariant cache hit.
[2023-03-20 00:49:27] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-20 00:49:28] [INFO ] Implicit Places using invariants and state equation in 775 ms returned []
Implicit Place search using SMT with State Equation took 1201 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 757/2372 places, 757/2172 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2146 ms. Remains : 757/2372 places, 757/2172 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s383 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-040B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-LTLFireability-06 finished in 2236 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(F((p0&&X(F(p1))))))))'
Support contains 1 out of 2372 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 : 2372/2372 places, 2172/2172 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 477 transitions
Trivial Post-agglo rules discarded 477 transitions
Performed 477 trivial Post agglomeration. Transition count delta: 477
Iterating post reduction 0 with 477 rules applied. Total rules applied 477 place count 2371 transition count 1694
Reduce places removed 477 places and 0 transitions.
Iterating post reduction 1 with 477 rules applied. Total rules applied 954 place count 1894 transition count 1694
Performed 315 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 315 Pre rules applied. Total rules applied 954 place count 1894 transition count 1379
Deduced a syphon composed of 315 places in 2 ms
Reduce places removed 315 places and 0 transitions.
Iterating global reduction 2 with 630 rules applied. Total rules applied 1584 place count 1579 transition count 1379
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1590 place count 1573 transition count 1373
Iterating global reduction 2 with 6 rules applied. Total rules applied 1596 place count 1573 transition count 1373
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 1596 place count 1573 transition count 1367
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 1608 place count 1567 transition count 1367
Performed 681 Post agglomeration using F-continuation condition.Transition count delta: 681
Deduced a syphon composed of 681 places in 1 ms
Reduce places removed 681 places and 0 transitions.
Iterating global reduction 2 with 1362 rules applied. Total rules applied 2970 place count 886 transition count 686
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2971 place count 886 transition count 685
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 2973 place count 885 transition count 684
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3175 place count 784 transition count 750
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 3211 place count 766 transition count 763
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3213 place count 764 transition count 761
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 3215 place count 762 transition count 761
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 3215 place count 762 transition count 760
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 3217 place count 761 transition count 760
Applied a total of 3217 rules in 477 ms. Remains 761 /2372 variables (removed 1611) and now considering 760/2172 (removed 1412) transitions.
// Phase 1: matrix 760 rows 761 cols
[2023-03-20 00:49:28] [INFO ] Computed 359 place invariants in 2 ms
[2023-03-20 00:49:29] [INFO ] Implicit Places using invariants in 500 ms returned [750]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 504 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 760/2372 places, 760/2172 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 759 transition count 759
Applied a total of 2 rules in 26 ms. Remains 759 /760 variables (removed 1) and now considering 759/760 (removed 1) transitions.
// Phase 1: matrix 759 rows 759 cols
[2023-03-20 00:49:29] [INFO ] Computed 358 place invariants in 1 ms
[2023-03-20 00:49:29] [INFO ] Implicit Places using invariants in 500 ms returned []
[2023-03-20 00:49:29] [INFO ] Invariant cache hit.
[2023-03-20 00:49:30] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-20 00:49:30] [INFO ] Implicit Places using invariants and state equation in 987 ms returned []
Implicit Place search using SMT with State Equation took 1491 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 759/2372 places, 759/2172 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2498 ms. Remains : 759/2372 places, 759/2172 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s398 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-040B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-LTLFireability-07 finished in 2586 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)&&(p1||G(p2)))))'
Support contains 5 out of 2372 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2372/2372 places, 2172/2172 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 479 transitions
Trivial Post-agglo rules discarded 479 transitions
Performed 479 trivial Post agglomeration. Transition count delta: 479
Iterating post reduction 0 with 479 rules applied. Total rules applied 479 place count 2371 transition count 1692
Reduce places removed 479 places and 0 transitions.
Iterating post reduction 1 with 479 rules applied. Total rules applied 958 place count 1892 transition count 1692
Performed 312 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 312 Pre rules applied. Total rules applied 958 place count 1892 transition count 1380
Deduced a syphon composed of 312 places in 2 ms
Reduce places removed 312 places and 0 transitions.
Iterating global reduction 2 with 624 rules applied. Total rules applied 1582 place count 1580 transition count 1380
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1589 place count 1573 transition count 1373
Iterating global reduction 2 with 7 rules applied. Total rules applied 1596 place count 1573 transition count 1373
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 1596 place count 1573 transition count 1366
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 1610 place count 1566 transition count 1366
Performed 680 Post agglomeration using F-continuation condition.Transition count delta: 680
Deduced a syphon composed of 680 places in 0 ms
Reduce places removed 680 places and 0 transitions.
Iterating global reduction 2 with 1360 rules applied. Total rules applied 2970 place count 886 transition count 686
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2971 place count 886 transition count 685
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 2973 place count 885 transition count 684
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -67
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3175 place count 784 transition count 751
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 3209 place count 767 transition count 762
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3211 place count 765 transition count 760
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 3213 place count 763 transition count 760
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 3213 place count 763 transition count 759
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 3215 place count 762 transition count 759
Applied a total of 3215 rules in 347 ms. Remains 762 /2372 variables (removed 1610) and now considering 759/2172 (removed 1413) transitions.
// Phase 1: matrix 759 rows 762 cols
[2023-03-20 00:49:31] [INFO ] Computed 359 place invariants in 2 ms
[2023-03-20 00:49:31] [INFO ] Implicit Places using invariants in 602 ms returned [751]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 616 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 761/2372 places, 759/2172 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 760 transition count 758
Applied a total of 2 rules in 42 ms. Remains 760 /761 variables (removed 1) and now considering 758/759 (removed 1) transitions.
// Phase 1: matrix 758 rows 760 cols
[2023-03-20 00:49:31] [INFO ] Computed 358 place invariants in 2 ms
[2023-03-20 00:49:32] [INFO ] Implicit Places using invariants in 484 ms returned []
[2023-03-20 00:49:32] [INFO ] Invariant cache hit.
[2023-03-20 00:49:33] [INFO ] Implicit Places using invariants and state equation in 1350 ms returned []
Implicit Place search using SMT with State Equation took 1835 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 760/2372 places, 758/2172 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2840 ms. Remains : 760/2372 places, 758/2172 transitions.
Stuttering acceptance computed with spot in 242 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=0 dest: 0}, { cond=(OR (AND p0 p1) (AND p0 p2)), acceptance={1} source=0 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 0}, { cond=p0, acceptance={1} source=1 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={1} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 2}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s240 1) (EQ s247 1) (EQ s250 1)), p1:(EQ s646 1), p2:(EQ s563 0)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], 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-040B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-LTLFireability-08 finished in 3115 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)&&F((X(G(p1))&&(G(p0)||G(p2)))))))'
Support contains 3 out of 2372 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2372/2372 places, 2172/2172 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 2363 transition count 2163
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 2363 transition count 2163
Applied a total of 18 rules in 308 ms. Remains 2363 /2372 variables (removed 9) and now considering 2163/2172 (removed 9) transitions.
// Phase 1: matrix 2163 rows 2363 cols
[2023-03-20 00:49:34] [INFO ] Computed 361 place invariants in 6 ms
[2023-03-20 00:49:34] [INFO ] Implicit Places using invariants in 871 ms returned []
[2023-03-20 00:49:34] [INFO ] Invariant cache hit.
[2023-03-20 00:49:37] [INFO ] Implicit Places using invariants and state equation in 2720 ms returned []
Implicit Place search using SMT with State Equation took 3601 ms to find 0 implicit places.
[2023-03-20 00:49:37] [INFO ] Invariant cache hit.
[2023-03-20 00:49:39] [INFO ] Dead Transitions using invariants and state equation in 1397 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2363/2372 places, 2163/2172 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5314 ms. Remains : 2363/2372 places, 2163/2172 transitions.
Stuttering acceptance computed with spot in 583 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND p0 p2), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0, 1, 2} source=2 dest: 2}], [{ cond=p1, acceptance={0, 1} source=3 dest: 3}, { cond=(OR (AND p0 (NOT p1)) (AND p2 (NOT p1))), acceptance={0, 1, 2} source=3 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1, 2} source=3 dest: 4}, { cond=(AND p0 p2 (NOT p1)), acceptance={2} source=3 dest: 5}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1, 2} source=3 dest: 6}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0, 2} source=3 dest: 7}], [{ cond=(AND (NOT p0) p2), acceptance={0, 1, 2} source=4 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={1, 2} source=4 dest: 4}, { cond=(AND p0 p2), acceptance={2} source=4 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=4 dest: 6}, { cond=(AND (NOT p0) p2), acceptance={0, 2} source=4 dest: 7}, { cond=(AND p0 p2), acceptance={1, 2} source=4 dest: 8}], [{ cond=(AND p0 (NOT p2)), acceptance={1, 2} source=5 dest: 4}, { cond=(AND p0 p2), acceptance={2} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=5 dest: 6}, { cond=(AND (NOT p0) p2), acceptance={0, 2} source=5 dest: 7}], [{ cond=(OR p0 p2), acceptance={0, 1, 2} source=6 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={1, 2} source=6 dest: 4}, { cond=(AND p0 p2), acceptance={2} source=6 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=6 dest: 6}, { cond=(AND (NOT p0) p2), acceptance={0, 2} source=6 dest: 7}], [{ cond=(AND p0 (NOT p2)), acceptance={0, 1, 2} source=7 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={1, 2} source=7 dest: 4}, { cond=(AND p0 p2), acceptance={2} source=7 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=7 dest: 6}, { cond=(AND (NOT p0) p2), acceptance={0, 2} source=7 dest: 7}, { cond=(AND p0 p2), acceptance={0, 2} source=7 dest: 9}], [{ cond=(AND (NOT p0) p1), acceptance={0, 1} source=8 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0, 1, 2} source=8 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1, 2} source=8 dest: 4}, { cond=(AND p0 p2 (NOT p1)), acceptance={2} source=8 dest: 5}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1, 2} source=8 dest: 6}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0, 2} source=8 dest: 7}, { cond=(AND p0 p1), acceptance={1} source=8 dest: 8}, { cond=(AND p0 p2 (NOT p1)), acceptance={1, 2} source=8 dest: 8}], [{ cond=(AND (NOT p2) p1), acceptance={0, 1} source=9 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1, 2} source=9 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1, 2} source=9 dest: 4}, { cond=(AND p0 p2 (NOT p1)), acceptance={2} source=9 dest: 5}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1, 2} source=9 dest: 6}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0, 2} source=9 dest: 7}, { cond=(AND p2 p1), acceptance={0} source=9 dest: 9}, { cond=(AND p0 p2 (NOT p1)), acceptance={0, 2} source=9 dest: 9}]], initial=0, aps=[p0:(EQ s1296 1), p2:(EQ s1247 1), p1:(EQ s665 1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-040B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-LTLFireability-09 finished in 5930 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(X(G((p0||X((X(p1) U (p0&&X(p1)))))))))'
Support contains 2 out of 2372 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2372/2372 places, 2172/2172 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 2362 transition count 2162
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 2362 transition count 2162
Applied a total of 20 rules in 232 ms. Remains 2362 /2372 variables (removed 10) and now considering 2162/2172 (removed 10) transitions.
// Phase 1: matrix 2162 rows 2362 cols
[2023-03-20 00:49:40] [INFO ] Computed 361 place invariants in 5 ms
[2023-03-20 00:49:40] [INFO ] Implicit Places using invariants in 802 ms returned []
[2023-03-20 00:49:40] [INFO ] Invariant cache hit.
[2023-03-20 00:49:43] [INFO ] Implicit Places using invariants and state equation in 2883 ms returned []
Implicit Place search using SMT with State Equation took 3689 ms to find 0 implicit places.
[2023-03-20 00:49:43] [INFO ] Invariant cache hit.
[2023-03-20 00:49:45] [INFO ] Dead Transitions using invariants and state equation in 1366 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2362/2372 places, 2162/2172 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5287 ms. Remains : 2362/2372 places, 2162/2172 transitions.
Stuttering acceptance computed with spot in 270 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1), true]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}, { cond=true, acceptance={0} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s1179 1), p1:(OR (EQ s1179 1) (NEQ s1532 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 14267 reset in 451 ms.
Product exploration explored 100000 steps with 14324 reset in 553 ms.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 155 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1), true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 141059 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :{}
Probabilistic random walk after 141059 steps, saw 89169 distinct states, run finished after 3001 ms. (steps per millisecond=47 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-20 00:49:49] [INFO ] Invariant cache hit.
[2023-03-20 00:49:50] [INFO ] [Real]Absence check using 361 positive place invariants in 121 ms returned sat
[2023-03-20 00:49:51] [INFO ] After 2003ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 00:49:52] [INFO ] [Nat]Absence check using 361 positive place invariants in 167 ms returned sat
[2023-03-20 00:49:53] [INFO ] After 1085ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 00:49:54] [INFO ] Deduced a trap composed of 19 places in 459 ms of which 1 ms to minimize.
[2023-03-20 00:49:54] [INFO ] Deduced a trap composed of 25 places in 446 ms of which 2 ms to minimize.
[2023-03-20 00:49:55] [INFO ] Deduced a trap composed of 16 places in 434 ms of which 1 ms to minimize.
[2023-03-20 00:49:55] [INFO ] Deduced a trap composed of 27 places in 433 ms of which 2 ms to minimize.
[2023-03-20 00:49:56] [INFO ] Deduced a trap composed of 27 places in 530 ms of which 1 ms to minimize.
[2023-03-20 00:49:56] [INFO ] Deduced a trap composed of 20 places in 467 ms of which 1 ms to minimize.
[2023-03-20 00:49:57] [INFO ] Deduced a trap composed of 20 places in 482 ms of which 1 ms to minimize.
[2023-03-20 00:49:58] [INFO ] Deduced a trap composed of 21 places in 455 ms of which 1 ms to minimize.
[2023-03-20 00:49:58] [INFO ] Deduced a trap composed of 28 places in 459 ms of which 2 ms to minimize.
[2023-03-20 00:49:59] [INFO ] Deduced a trap composed of 29 places in 395 ms of which 1 ms to minimize.
[2023-03-20 00:49:59] [INFO ] Deduced a trap composed of 31 places in 400 ms of which 2 ms to minimize.
[2023-03-20 00:50:00] [INFO ] Deduced a trap composed of 23 places in 516 ms of which 2 ms to minimize.
[2023-03-20 00:50:00] [INFO ] Deduced a trap composed of 35 places in 409 ms of which 1 ms to minimize.
[2023-03-20 00:50:01] [INFO ] Deduced a trap composed of 23 places in 394 ms of which 1 ms to minimize.
[2023-03-20 00:50:01] [INFO ] Deduced a trap composed of 30 places in 420 ms of which 1 ms to minimize.
[2023-03-20 00:50:02] [INFO ] Deduced a trap composed of 22 places in 461 ms of which 1 ms to minimize.
[2023-03-20 00:50:02] [INFO ] Deduced a trap composed of 24 places in 444 ms of which 1 ms to minimize.
[2023-03-20 00:50:03] [INFO ] Deduced a trap composed of 31 places in 412 ms of which 1 ms to minimize.
[2023-03-20 00:50:03] [INFO ] Deduced a trap composed of 18 places in 359 ms of which 2 ms to minimize.
[2023-03-20 00:50:03] [INFO ] Deduced a trap composed of 32 places in 399 ms of which 1 ms to minimize.
[2023-03-20 00:50:04] [INFO ] Deduced a trap composed of 26 places in 348 ms of which 1 ms to minimize.
[2023-03-20 00:50:04] [INFO ] Deduced a trap composed of 29 places in 425 ms of which 1 ms to minimize.
[2023-03-20 00:50:05] [INFO ] Deduced a trap composed of 27 places in 407 ms of which 1 ms to minimize.
[2023-03-20 00:50:05] [INFO ] Deduced a trap composed of 35 places in 357 ms of which 1 ms to minimize.
[2023-03-20 00:50:06] [INFO ] Deduced a trap composed of 17 places in 396 ms of which 1 ms to minimize.
[2023-03-20 00:50:06] [INFO ] Deduced a trap composed of 28 places in 426 ms of which 1 ms to minimize.
[2023-03-20 00:50:07] [INFO ] Deduced a trap composed of 36 places in 347 ms of which 2 ms to minimize.
[2023-03-20 00:50:07] [INFO ] Deduced a trap composed of 34 places in 307 ms of which 1 ms to minimize.
[2023-03-20 00:50:07] [INFO ] Deduced a trap composed of 44 places in 284 ms of which 1 ms to minimize.
[2023-03-20 00:50:08] [INFO ] Deduced a trap composed of 37 places in 337 ms of which 1 ms to minimize.
[2023-03-20 00:50:08] [INFO ] Deduced a trap composed of 39 places in 256 ms of which 1 ms to minimize.
[2023-03-20 00:50:08] [INFO ] Deduced a trap composed of 37 places in 293 ms of which 0 ms to minimize.
[2023-03-20 00:50:09] [INFO ] Deduced a trap composed of 38 places in 302 ms of which 1 ms to minimize.
[2023-03-20 00:50:09] [INFO ] Deduced a trap composed of 39 places in 297 ms of which 1 ms to minimize.
[2023-03-20 00:50:10] [INFO ] Deduced a trap composed of 39 places in 340 ms of which 2 ms to minimize.
[2023-03-20 00:50:10] [INFO ] Deduced a trap composed of 39 places in 352 ms of which 1 ms to minimize.
[2023-03-20 00:50:10] [INFO ] Deduced a trap composed of 40 places in 302 ms of which 1 ms to minimize.
[2023-03-20 00:50:11] [INFO ] Deduced a trap composed of 43 places in 297 ms of which 1 ms to minimize.
[2023-03-20 00:50:11] [INFO ] Deduced a trap composed of 40 places in 298 ms of which 0 ms to minimize.
[2023-03-20 00:50:12] [INFO ] Deduced a trap composed of 37 places in 350 ms of which 1 ms to minimize.
[2023-03-20 00:50:12] [INFO ] Deduced a trap composed of 36 places in 370 ms of which 1 ms to minimize.
[2023-03-20 00:50:12] [INFO ] Deduced a trap composed of 50 places in 333 ms of which 1 ms to minimize.
[2023-03-20 00:50:13] [INFO ] Deduced a trap composed of 53 places in 205 ms of which 1 ms to minimize.
[2023-03-20 00:50:13] [INFO ] Deduced a trap composed of 53 places in 397 ms of which 0 ms to minimize.
[2023-03-20 00:50:13] [INFO ] Deduced a trap composed of 49 places in 273 ms of which 1 ms to minimize.
[2023-03-20 00:50:14] [INFO ] Deduced a trap composed of 50 places in 361 ms of which 1 ms to minimize.
[2023-03-20 00:50:14] [INFO ] Deduced a trap composed of 42 places in 298 ms of which 1 ms to minimize.
[2023-03-20 00:50:15] [INFO ] Deduced a trap composed of 44 places in 268 ms of which 1 ms to minimize.
[2023-03-20 00:50:15] [INFO ] Deduced a trap composed of 42 places in 320 ms of which 1 ms to minimize.
[2023-03-20 00:50:15] [INFO ] Deduced a trap composed of 42 places in 287 ms of which 0 ms to minimize.
[2023-03-20 00:50:16] [INFO ] Deduced a trap composed of 45 places in 265 ms of which 2 ms to minimize.
[2023-03-20 00:50:16] [INFO ] Deduced a trap composed of 44 places in 314 ms of which 1 ms to minimize.
[2023-03-20 00:50:17] [INFO ] Deduced a trap composed of 46 places in 334 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.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
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:50:17] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-20 00:50:17] [INFO ] After 25033ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 130 ms.
Support contains 2 out of 2362 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2362/2362 places, 2162/2162 transitions.
Drop transitions removed 479 transitions
Trivial Post-agglo rules discarded 479 transitions
Performed 479 trivial Post agglomeration. Transition count delta: 479
Iterating post reduction 0 with 479 rules applied. Total rules applied 479 place count 2362 transition count 1683
Reduce places removed 479 places and 0 transitions.
Iterating post reduction 1 with 479 rules applied. Total rules applied 958 place count 1883 transition count 1683
Performed 319 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 319 Pre rules applied. Total rules applied 958 place count 1883 transition count 1364
Deduced a syphon composed of 319 places in 3 ms
Reduce places removed 319 places and 0 transitions.
Iterating global reduction 2 with 638 rules applied. Total rules applied 1596 place count 1564 transition count 1364
Performed 680 Post agglomeration using F-continuation condition.Transition count delta: 680
Deduced a syphon composed of 680 places in 1 ms
Reduce places removed 680 places and 0 transitions.
Iterating global reduction 2 with 1360 rules applied. Total rules applied 2956 place count 884 transition count 684
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2957 place count 884 transition count 683
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 2959 place count 883 transition count 682
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 3161 place count 782 transition count 748
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 3197 place count 764 transition count 761
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3198 place count 764 transition count 760
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3199 place count 764 transition count 759
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3200 place count 763 transition count 759
Partial Free-agglomeration rule applied 40 times.
Drop transitions removed 40 transitions
Iterating global reduction 5 with 40 rules applied. Total rules applied 3240 place count 763 transition count 759
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3241 place count 762 transition count 758
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 3243 place count 760 transition count 758
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 3243 place count 760 transition count 757
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 3245 place count 759 transition count 757
Applied a total of 3245 rules in 362 ms. Remains 759 /2362 variables (removed 1603) and now considering 757/2162 (removed 1405) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 363 ms. Remains : 759/2362 places, 757/2162 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 757 rows 759 cols
[2023-03-20 00:50:17] [INFO ] Computed 359 place invariants in 3 ms
[2023-03-20 00:50:17] [INFO ] [Real]Absence check using 359 positive place invariants in 58 ms returned sat
[2023-03-20 00:50:18] [INFO ] After 316ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 00:50:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 00:50:18] [INFO ] After 45ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-20 00:50:18] [INFO ] After 155ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-20 00:50:18] [INFO ] After 741ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 1 out of 759 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 757/757 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 758 transition count 756
Applied a total of 2 rules in 21 ms. Remains 758 /759 variables (removed 1) and now considering 756/757 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 758/759 places, 756/757 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 266954 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :{}
Probabilistic random walk after 266954 steps, saw 170479 distinct states, run finished after 3001 ms. (steps per millisecond=88 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 756 rows 758 cols
[2023-03-20 00:50:21] [INFO ] Computed 359 place invariants in 1 ms
[2023-03-20 00:50:21] [INFO ] [Real]Absence check using 359 positive place invariants in 143 ms returned sat
[2023-03-20 00:50:22] [INFO ] After 564ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 00:50:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-20 00:50:22] [INFO ] After 47ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-20 00:50:22] [INFO ] After 78ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-20 00:50:22] [INFO ] After 933ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 758 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 758/758 places, 756/756 transitions.
Applied a total of 0 rules in 13 ms. Remains 758 /758 variables (removed 0) and now considering 756/756 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 758/758 places, 756/756 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 758/758 places, 756/756 transitions.
Applied a total of 0 rules in 11 ms. Remains 758 /758 variables (removed 0) and now considering 756/756 (removed 0) transitions.
[2023-03-20 00:50:22] [INFO ] Invariant cache hit.
[2023-03-20 00:50:23] [INFO ] Implicit Places using invariants in 514 ms returned [747]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 530 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 757/758 places, 756/756 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 756 transition count 755
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 756 transition count 755
Applied a total of 2 rules in 22 ms. Remains 756 /757 variables (removed 1) and now considering 755/756 (removed 1) transitions.
// Phase 1: matrix 755 rows 756 cols
[2023-03-20 00:50:23] [INFO ] Computed 358 place invariants in 1 ms
[2023-03-20 00:50:23] [INFO ] Implicit Places using invariants in 525 ms returned []
[2023-03-20 00:50:23] [INFO ] Invariant cache hit.
[2023-03-20 00:50:24] [INFO ] Implicit Places using invariants and state equation in 830 ms returned []
Implicit Place search using SMT with State Equation took 1381 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 756/758 places, 755/756 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1944 ms. Remains : 756/758 places, 755/756 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 264389 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :{}
Probabilistic random walk after 264389 steps, saw 169073 distinct states, run finished after 3001 ms. (steps per millisecond=88 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 00:50:27] [INFO ] Invariant cache hit.
[2023-03-20 00:50:27] [INFO ] [Real]Absence check using 358 positive place invariants in 39 ms returned sat
[2023-03-20 00:50:28] [INFO ] After 287ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 00:50:28] [INFO ] After 321ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-20 00:50:28] [INFO ] After 524ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 756 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 756/756 places, 755/755 transitions.
Applied a total of 0 rules in 12 ms. Remains 756 /756 variables (removed 0) and now considering 755/755 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 756/756 places, 755/755 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 756/756 places, 755/755 transitions.
Applied a total of 0 rules in 11 ms. Remains 756 /756 variables (removed 0) and now considering 755/755 (removed 0) transitions.
[2023-03-20 00:50:28] [INFO ] Invariant cache hit.
[2023-03-20 00:50:28] [INFO ] Implicit Places using invariants in 398 ms returned []
[2023-03-20 00:50:28] [INFO ] Invariant cache hit.
[2023-03-20 00:50:29] [INFO ] Implicit Places using invariants and state equation in 1069 ms returned []
Implicit Place search using SMT with State Equation took 1475 ms to find 0 implicit places.
[2023-03-20 00:50:29] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-20 00:50:29] [INFO ] Invariant cache hit.
[2023-03-20 00:50:30] [INFO ] Dead Transitions using invariants and state equation in 386 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1903 ms. Remains : 756/756 places, 755/755 transitions.
Partial Free-agglomeration rule applied 80 times.
Drop transitions removed 80 transitions
Iterating global reduction 0 with 80 rules applied. Total rules applied 80 place count 756 transition count 755
Applied a total of 80 rules in 23 ms. Remains 756 /756 variables (removed 0) and now considering 755/755 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 755 rows 756 cols
[2023-03-20 00:50:30] [INFO ] Computed 358 place invariants in 2 ms
[2023-03-20 00:50:30] [INFO ] [Real]Absence check using 358 positive place invariants in 141 ms returned sat
[2023-03-20 00:50:30] [INFO ] After 297ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 00:50:30] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-20 00:50:30] [INFO ] After 34ms SMT Verify possible using 78 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:50:30] [INFO ] After 596ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 00:50:30] [INFO ] [Nat]Absence check using 358 positive place invariants in 49 ms returned sat
[2023-03-20 00:50:31] [INFO ] After 302ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 00:50:31] [INFO ] After 96ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 00:50:31] [INFO ] After 163ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-03-20 00:50:31] [INFO ] After 680ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) p1), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 208 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 315 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1), true]
Stuttering acceptance computed with spot in 257 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1), true]
// Phase 1: matrix 2162 rows 2362 cols
[2023-03-20 00:50:32] [INFO ] Computed 361 place invariants in 6 ms
[2023-03-20 00:50:33] [INFO ] [Real]Absence check using 361 positive place invariants in 386 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p0) p1), true, (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1)), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-040B-LTLFireability-10 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-040B-LTLFireability-10 finished in 54276 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 U (p1||G(p0))))))'
Support contains 3 out of 2372 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2372/2372 places, 2172/2172 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 477 transitions
Trivial Post-agglo rules discarded 477 transitions
Performed 477 trivial Post agglomeration. Transition count delta: 477
Iterating post reduction 0 with 477 rules applied. Total rules applied 477 place count 2371 transition count 1694
Reduce places removed 477 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 478 rules applied. Total rules applied 955 place count 1894 transition count 1693
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 956 place count 1893 transition count 1693
Performed 314 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 314 Pre rules applied. Total rules applied 956 place count 1893 transition count 1379
Deduced a syphon composed of 314 places in 3 ms
Reduce places removed 314 places and 0 transitions.
Iterating global reduction 3 with 628 rules applied. Total rules applied 1584 place count 1579 transition count 1379
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1591 place count 1572 transition count 1372
Iterating global reduction 3 with 7 rules applied. Total rules applied 1598 place count 1572 transition count 1372
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 1598 place count 1572 transition count 1365
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 1612 place count 1565 transition count 1365
Performed 679 Post agglomeration using F-continuation condition.Transition count delta: 679
Deduced a syphon composed of 679 places in 1 ms
Reduce places removed 679 places and 0 transitions.
Iterating global reduction 3 with 1358 rules applied. Total rules applied 2970 place count 886 transition count 686
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2971 place count 886 transition count 685
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 2973 place count 885 transition count 684
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3175 place count 784 transition count 750
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 3209 place count 767 transition count 761
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3211 place count 765 transition count 759
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 3213 place count 763 transition count 759
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 3213 place count 763 transition count 758
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3215 place count 762 transition count 758
Applied a total of 3215 rules in 520 ms. Remains 762 /2372 variables (removed 1610) and now considering 758/2172 (removed 1414) transitions.
// Phase 1: matrix 758 rows 762 cols
[2023-03-20 00:50:34] [INFO ] Computed 359 place invariants in 1 ms
[2023-03-20 00:50:34] [INFO ] Implicit Places using invariants in 423 ms returned [750]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 437 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 761/2372 places, 758/2172 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 760 transition count 757
Applied a total of 2 rules in 20 ms. Remains 760 /761 variables (removed 1) and now considering 757/758 (removed 1) transitions.
// Phase 1: matrix 757 rows 760 cols
[2023-03-20 00:50:34] [INFO ] Computed 358 place invariants in 2 ms
[2023-03-20 00:50:35] [INFO ] Implicit Places using invariants in 638 ms returned []
[2023-03-20 00:50:35] [INFO ] Invariant cache hit.
[2023-03-20 00:50:36] [INFO ] Implicit Places using invariants and state equation in 1018 ms returned []
Implicit Place search using SMT with State Equation took 1658 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 760/2372 places, 757/2172 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2635 ms. Remains : 760/2372 places, 757/2172 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), 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 (NOT (AND (EQ s734 1) (EQ s756 1))) (NEQ s746 1)), p0:(NEQ s746 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 53 steps with 0 reset in 2 ms.
FORMULA ShieldIIPt-PT-040B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-LTLFireability-11 finished in 2742 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) U p1)))'
Support contains 2 out of 2372 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2372/2372 places, 2172/2172 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 2361 transition count 2161
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 2361 transition count 2161
Applied a total of 22 rules in 240 ms. Remains 2361 /2372 variables (removed 11) and now considering 2161/2172 (removed 11) transitions.
// Phase 1: matrix 2161 rows 2361 cols
[2023-03-20 00:50:36] [INFO ] Computed 361 place invariants in 6 ms
[2023-03-20 00:50:37] [INFO ] Implicit Places using invariants in 816 ms returned []
[2023-03-20 00:50:37] [INFO ] Invariant cache hit.
[2023-03-20 00:50:40] [INFO ] Implicit Places using invariants and state equation in 2765 ms returned []
Implicit Place search using SMT with State Equation took 3585 ms to find 0 implicit places.
[2023-03-20 00:50:40] [INFO ] Invariant cache hit.
[2023-03-20 00:50:41] [INFO ] Dead Transitions using invariants and state equation in 1372 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2361/2372 places, 2161/2172 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5211 ms. Remains : 2361/2372 places, 2161/2172 transitions.
Stuttering acceptance computed with spot in 164 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s287 1), p0:(EQ s35 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-040B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-040B-LTLFireability-12 finished in 5400 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((G(p0)&&F(!p1))||(p2 U (p2&&(p1||G(p2))))))))'
Support contains 3 out of 2372 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2372/2372 places, 2172/2172 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 2361 transition count 2161
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 2361 transition count 2161
Applied a total of 22 rules in 278 ms. Remains 2361 /2372 variables (removed 11) and now considering 2161/2172 (removed 11) transitions.
[2023-03-20 00:50:42] [INFO ] Invariant cache hit.
[2023-03-20 00:50:43] [INFO ] Implicit Places using invariants in 764 ms returned []
[2023-03-20 00:50:43] [INFO ] Invariant cache hit.
[2023-03-20 00:50:45] [INFO ] Implicit Places using invariants and state equation in 2266 ms returned []
Implicit Place search using SMT with State Equation took 3032 ms to find 0 implicit places.
[2023-03-20 00:50:45] [INFO ] Invariant cache hit.
[2023-03-20 00:50:46] [INFO ] Dead Transitions using invariants and state equation in 1287 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2361/2372 places, 2161/2172 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4598 ms. Remains : 2361/2372 places, 2161/2172 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (AND (NOT p0) (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={1} source=1 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={1} source=2 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s1142 1), p1:(NEQ s1538 1), p2:(NEQ s2061 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1266 ms.
Product exploration explored 100000 steps with 50000 reset in 1239 ms.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) p1 p2)
Knowledge based reduction with 12 factoid took 522 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-040B-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-040B-LTLFireability-13 finished in 7854 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X((F(p1)||G(p2)))))'
Support contains 3 out of 2372 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2372/2372 places, 2172/2172 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 2363 transition count 2163
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 2363 transition count 2163
Applied a total of 18 rules in 241 ms. Remains 2363 /2372 variables (removed 9) and now considering 2163/2172 (removed 9) transitions.
// Phase 1: matrix 2163 rows 2363 cols
[2023-03-20 00:50:50] [INFO ] Computed 361 place invariants in 14 ms
[2023-03-20 00:50:51] [INFO ] Implicit Places using invariants in 769 ms returned []
[2023-03-20 00:50:51] [INFO ] Invariant cache hit.
[2023-03-20 00:50:53] [INFO ] Implicit Places using invariants and state equation in 2545 ms returned []
Implicit Place search using SMT with State Equation took 3332 ms to find 0 implicit places.
[2023-03-20 00:50:53] [INFO ] Invariant cache hit.
[2023-03-20 00:50:55] [INFO ] Dead Transitions using invariants and state equation in 1886 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2363/2372 places, 2163/2172 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5460 ms. Remains : 2363/2372 places, 2163/2172 transitions.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s1760 1), p1:(EQ s2073 1), p2:(EQ s1724 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 68 reset in 566 ms.
Stack based approach found an accepted trace after 2922 steps with 1 reset with depth 1491 and stack size 1491 in 20 ms.
FORMULA ShieldIIPt-PT-040B-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-040B-LTLFireability-14 finished in 6172 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((X((G(p1)&&p0))||F(p2))))'
Support contains 4 out of 2372 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2372/2372 places, 2172/2172 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 2362 transition count 2162
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 2362 transition count 2162
Applied a total of 20 rules in 333 ms. Remains 2362 /2372 variables (removed 10) and now considering 2162/2172 (removed 10) transitions.
// Phase 1: matrix 2162 rows 2362 cols
[2023-03-20 00:50:56] [INFO ] Computed 361 place invariants in 13 ms
[2023-03-20 00:50:57] [INFO ] Implicit Places using invariants in 961 ms returned []
[2023-03-20 00:50:57] [INFO ] Invariant cache hit.
[2023-03-20 00:51:00] [INFO ] Implicit Places using invariants and state equation in 2660 ms returned []
Implicit Place search using SMT with State Equation took 3623 ms to find 0 implicit places.
[2023-03-20 00:51:00] [INFO ] Invariant cache hit.
[2023-03-20 00:51:01] [INFO ] Dead Transitions using invariants and state equation in 1346 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2362/2372 places, 2162/2172 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5316 ms. Remains : 2362/2372 places, 2162/2172 transitions.
Stuttering acceptance computed with spot in 204 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}]], initial=1, aps=[p2:(EQ s209 0), p0:(AND (EQ s31 1) (EQ s1139 1)), p1:(EQ s2303 0)], 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1255 ms.
Product exploration explored 100000 steps with 50000 reset in 1219 ms.
Computed a total of 638 stabilizing places and 638 stable transitions
Computed a total of 638 stabilizing places and 638 stable transitions
Detected a total of 638/2362 stabilizing places and 638/2162 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p0) p1), (X p2), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1)))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p2)
Knowledge based reduction with 5 factoid took 168 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-040B-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-040B-LTLFireability-15 finished in 8225 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(X(G((G(p1)||p0)))))'
Found a Lengthening insensitive property : ShieldIIPt-PT-040B-LTLFireability-00
Stuttering acceptance computed with spot in 185 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 2372 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2372/2372 places, 2172/2172 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 478 transitions
Trivial Post-agglo rules discarded 478 transitions
Performed 478 trivial Post agglomeration. Transition count delta: 478
Iterating post reduction 0 with 478 rules applied. Total rules applied 478 place count 2371 transition count 1693
Reduce places removed 478 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 479 rules applied. Total rules applied 957 place count 1893 transition count 1692
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 958 place count 1892 transition count 1692
Performed 312 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 312 Pre rules applied. Total rules applied 958 place count 1892 transition count 1380
Deduced a syphon composed of 312 places in 1 ms
Reduce places removed 312 places and 0 transitions.
Iterating global reduction 3 with 624 rules applied. Total rules applied 1582 place count 1580 transition count 1380
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1589 place count 1573 transition count 1373
Iterating global reduction 3 with 7 rules applied. Total rules applied 1596 place count 1573 transition count 1373
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 1596 place count 1573 transition count 1366
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 1610 place count 1566 transition count 1366
Performed 681 Post agglomeration using F-continuation condition.Transition count delta: 681
Deduced a syphon composed of 681 places in 1 ms
Reduce places removed 681 places and 0 transitions.
Iterating global reduction 3 with 1362 rules applied. Total rules applied 2972 place count 885 transition count 685
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2973 place count 885 transition count 684
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 2975 place count 884 transition count 683
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -67
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 3177 place count 783 transition count 750
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 3211 place count 766 transition count 761
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3213 place count 764 transition count 759
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 3215 place count 762 transition count 759
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 3215 place count 762 transition count 758
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 3217 place count 761 transition count 758
Applied a total of 3217 rules in 496 ms. Remains 761 /2372 variables (removed 1611) and now considering 758/2172 (removed 1414) transitions.
// Phase 1: matrix 758 rows 761 cols
[2023-03-20 00:51:05] [INFO ] Computed 359 place invariants in 2 ms
[2023-03-20 00:51:05] [INFO ] Implicit Places using invariants in 482 ms returned [750]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 502 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 760/2372 places, 758/2172 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 759 transition count 757
Applied a total of 2 rules in 36 ms. Remains 759 /760 variables (removed 1) and now considering 757/758 (removed 1) transitions.
// Phase 1: matrix 757 rows 759 cols
[2023-03-20 00:51:05] [INFO ] Computed 358 place invariants in 2 ms
[2023-03-20 00:51:06] [INFO ] Implicit Places using invariants in 439 ms returned []
[2023-03-20 00:51:06] [INFO ] Invariant cache hit.
[2023-03-20 00:51:07] [INFO ] Implicit Places using invariants and state equation in 1072 ms returned []
Implicit Place search using SMT with State Equation took 1512 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 759/2372 places, 757/2172 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 2546 ms. Remains : 759/2372 places, 757/2172 transitions.
Running random walk in product with property : ShieldIIPt-PT-040B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(EQ s96 0), p0:(OR (EQ s318 0) (EQ s325 0) (EQ s328 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 659 ms.
Product exploration explored 100000 steps with 0 reset in 839 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 138 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 242 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 129105 steps, run timeout after 3036 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 129105 steps, saw 78411 distinct states, run finished after 3036 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-20 00:51:12] [INFO ] Invariant cache hit.
[2023-03-20 00:51:12] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 00:51:13] [INFO ] [Nat]Absence check using 358 positive place invariants in 113 ms returned sat
[2023-03-20 00:51:13] [INFO ] After 560ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 00:51:14] [INFO ] After 880ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 216 ms.
[2023-03-20 00:51:14] [INFO ] After 1506ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 92 ms.
Support contains 4 out of 759 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 757/757 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 759 transition count 756
Applied a total of 1 rules in 14 ms. Remains 759 /759 variables (removed 0) and now considering 756/757 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 759/759 places, 756/757 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 137305 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 137305 steps, saw 86506 distinct states, run finished after 3001 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 756 rows 759 cols
[2023-03-20 00:51:18] [INFO ] Computed 358 place invariants in 1 ms
[2023-03-20 00:51:18] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 00:51:18] [INFO ] [Nat]Absence check using 358 positive place invariants in 171 ms returned sat
[2023-03-20 00:51:18] [INFO ] After 385ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 00:51:19] [INFO ] After 589ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 154 ms.
[2023-03-20 00:51:19] [INFO ] After 1138ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 153 ms.
Support contains 4 out of 759 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 756/756 transitions.
Applied a total of 0 rules in 22 ms. Remains 759 /759 variables (removed 0) and now considering 756/756 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 759/759 places, 756/756 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 756/756 transitions.
Applied a total of 0 rules in 19 ms. Remains 759 /759 variables (removed 0) and now considering 756/756 (removed 0) transitions.
[2023-03-20 00:51:19] [INFO ] Invariant cache hit.
[2023-03-20 00:51:19] [INFO ] Implicit Places using invariants in 470 ms returned []
[2023-03-20 00:51:19] [INFO ] Invariant cache hit.
[2023-03-20 00:51:20] [INFO ] Implicit Places using invariants and state equation in 1017 ms returned []
Implicit Place search using SMT with State Equation took 1501 ms to find 0 implicit places.
[2023-03-20 00:51:20] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-20 00:51:20] [INFO ] Invariant cache hit.
[2023-03-20 00:51:21] [INFO ] Dead Transitions using invariants and state equation in 362 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1907 ms. Remains : 759/759 places, 756/756 transitions.
Partial Free-agglomeration rule applied 78 times.
Drop transitions removed 78 transitions
Iterating global reduction 0 with 78 rules applied. Total rules applied 78 place count 759 transition count 756
Applied a total of 78 rules in 21 ms. Remains 759 /759 variables (removed 0) and now considering 756/756 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 756 rows 759 cols
[2023-03-20 00:51:21] [INFO ] Computed 358 place invariants in 2 ms
[2023-03-20 00:51:21] [INFO ] After 163ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 00:51:21] [INFO ] [Nat]Absence check using 358 positive place invariants in 62 ms returned sat
[2023-03-20 00:51:22] [INFO ] After 541ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 00:51:22] [INFO ] After 770ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 180 ms.
[2023-03-20 00:51:22] [INFO ] After 1247ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 245 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 233 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 759 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 759/759 places, 757/757 transitions.
Applied a total of 0 rules in 9 ms. Remains 759 /759 variables (removed 0) and now considering 757/757 (removed 0) transitions.
// Phase 1: matrix 757 rows 759 cols
[2023-03-20 00:51:23] [INFO ] Computed 358 place invariants in 1 ms
[2023-03-20 00:51:23] [INFO ] Implicit Places using invariants in 454 ms returned []
[2023-03-20 00:51:23] [INFO ] Invariant cache hit.
[2023-03-20 00:51:25] [INFO ] Implicit Places using invariants and state equation in 1068 ms returned []
Implicit Place search using SMT with State Equation took 1526 ms to find 0 implicit places.
[2023-03-20 00:51:25] [INFO ] Invariant cache hit.
[2023-03-20 00:51:25] [INFO ] Dead Transitions using invariants and state equation in 614 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2156 ms. Remains : 759/759 places, 757/757 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 156 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 263 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 246 ms. (steps per millisecond=40 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 133456 steps, run timeout after 3002 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 133456 steps, saw 81015 distinct states, run finished after 3002 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-20 00:51:29] [INFO ] Invariant cache hit.
[2023-03-20 00:51:29] [INFO ] After 172ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 00:51:30] [INFO ] [Nat]Absence check using 358 positive place invariants in 144 ms returned sat
[2023-03-20 00:51:30] [INFO ] After 347ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 00:51:30] [INFO ] After 491ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 110 ms.
[2023-03-20 00:51:30] [INFO ] After 994ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 44 ms.
Support contains 4 out of 759 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 757/757 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 759 transition count 756
Applied a total of 1 rules in 23 ms. Remains 759 /759 variables (removed 0) and now considering 756/757 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 759/759 places, 756/757 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 365 ms. (steps per millisecond=27 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 113228 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 113228 steps, saw 72179 distinct states, run finished after 3001 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 756 rows 759 cols
[2023-03-20 00:51:34] [INFO ] Computed 358 place invariants in 6 ms
[2023-03-20 00:51:34] [INFO ] After 159ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 00:51:34] [INFO ] [Nat]Absence check using 358 positive place invariants in 68 ms returned sat
[2023-03-20 00:51:35] [INFO ] After 421ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 00:51:35] [INFO ] After 730ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 207 ms.
[2023-03-20 00:51:35] [INFO ] After 1269ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 120 ms.
Support contains 4 out of 759 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 756/756 transitions.
Applied a total of 0 rules in 16 ms. Remains 759 /759 variables (removed 0) and now considering 756/756 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 759/759 places, 756/756 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 756/756 transitions.
Applied a total of 0 rules in 14 ms. Remains 759 /759 variables (removed 0) and now considering 756/756 (removed 0) transitions.
[2023-03-20 00:51:36] [INFO ] Invariant cache hit.
[2023-03-20 00:51:36] [INFO ] Implicit Places using invariants in 572 ms returned []
[2023-03-20 00:51:36] [INFO ] Invariant cache hit.
[2023-03-20 00:51:37] [INFO ] Implicit Places using invariants and state equation in 898 ms returned []
Implicit Place search using SMT with State Equation took 1481 ms to find 0 implicit places.
[2023-03-20 00:51:37] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-20 00:51:37] [INFO ] Invariant cache hit.
[2023-03-20 00:51:38] [INFO ] Dead Transitions using invariants and state equation in 349 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1878 ms. Remains : 759/759 places, 756/756 transitions.
Partial Free-agglomeration rule applied 78 times.
Drop transitions removed 78 transitions
Iterating global reduction 0 with 78 rules applied. Total rules applied 78 place count 759 transition count 756
Applied a total of 78 rules in 22 ms. Remains 759 /759 variables (removed 0) and now considering 756/756 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 756 rows 759 cols
[2023-03-20 00:51:38] [INFO ] Computed 358 place invariants in 1 ms
[2023-03-20 00:51:38] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-20 00:51:38] [INFO ] [Nat]Absence check using 358 positive place invariants in 86 ms returned sat
[2023-03-20 00:51:38] [INFO ] After 436ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-20 00:51:39] [INFO ] After 732ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 163 ms.
[2023-03-20 00:51:39] [INFO ] After 1154ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 314 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 327 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 295 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 169 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 707 ms.
Product exploration explored 100000 steps with 0 reset in 875 ms.
Applying partial POR strategy [true, true, true, false, false]
Stuttering acceptance computed with spot in 378 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 759 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 759/759 places, 757/757 transitions.
Applied a total of 0 rules in 26 ms. Remains 759 /759 variables (removed 0) and now considering 757/757 (removed 0) transitions.
[2023-03-20 00:51:42] [INFO ] Redundant transitions in 25 ms returned []
// Phase 1: matrix 757 rows 759 cols
[2023-03-20 00:51:42] [INFO ] Computed 358 place invariants in 2 ms
[2023-03-20 00:51:43] [INFO ] Dead Transitions using invariants and state equation in 584 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 656 ms. Remains : 759/759 places, 757/757 transitions.
Support contains 4 out of 759 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 759/759 places, 757/757 transitions.
Applied a total of 0 rules in 7 ms. Remains 759 /759 variables (removed 0) and now considering 757/757 (removed 0) transitions.
[2023-03-20 00:51:43] [INFO ] Invariant cache hit.
[2023-03-20 00:51:43] [INFO ] Implicit Places using invariants in 448 ms returned []
[2023-03-20 00:51:43] [INFO ] Invariant cache hit.
[2023-03-20 00:51:44] [INFO ] Implicit Places using invariants and state equation in 853 ms returned []
Implicit Place search using SMT with State Equation took 1320 ms to find 0 implicit places.
[2023-03-20 00:51:44] [INFO ] Invariant cache hit.
[2023-03-20 00:51:44] [INFO ] Dead Transitions using invariants and state equation in 353 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1694 ms. Remains : 759/759 places, 757/757 transitions.
Treatment of property ShieldIIPt-PT-040B-LTLFireability-00 finished in 40536 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))'
[2023-03-20 00:51:45] [INFO ] Flatten gal took : 71 ms
[2023-03-20 00:51:45] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-20 00:51:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2372 places, 2172 transitions and 5624 arcs took 25 ms.
Total runtime 393487 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldIIPt-PT-040B
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/371
LTLFireability

FORMULA ShieldIIPt-PT-040B-LTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679273560879

--------------------
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/371/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/371/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/371/LTLFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 1.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 9 (type EXCL) for 3 ShieldIIPt-PT-040B-LTLFireability-04
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 7 (type FNDP) for 3 ShieldIIPt-PT-040B-LTLFireability-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 8 (type EQUN) for 3 ShieldIIPt-PT-040B-LTLFireability-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 10 (type SRCH) for 3 ShieldIIPt-PT-040B-LTLFireability-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 10 (type SRCH) for ShieldIIPt-PT-040B-LTLFireability-04
lola: result : unknown
lola: time used : 0.000000
lola: memory pages used : 1
lola: FINISHED task # 7 (type FNDP) for ShieldIIPt-PT-040B-LTLFireability-04
lola: result : true
lola: fired transitions : 7588
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 8 (type EQUN) for ShieldIIPt-PT-040B-LTLFireability-04 (obsolete)
lola: CANCELED task # 9 (type EXCL) for ShieldIIPt-PT-040B-LTLFireability-04 (obsolete)
lola: FINISHED task # 8 (type EQUN) for ShieldIIPt-PT-040B-LTLFireability-04
lola: result : unknown
lola: LAUNCH task # 1 (type EXCL) for 0 ShieldIIPt-PT-040B-LTLFireability-00
lola: time limit : 3599 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-040B-LTLFireability-04: AG false findpath

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 4/3599 4/32 ShieldIIPt-PT-040B-LTLFireability-00 107044 m, 21408 m/sec, 349200 t fired, .

Time elapsed: 5 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-040B-LTLFireability-04: AG false findpath

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 9/3599 7/32 ShieldIIPt-PT-040B-LTLFireability-00 198428 m, 18276 m/sec, 755910 t fired, .

Time elapsed: 10 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-040B-LTLFireability-04: AG false findpath

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 14/3599 10/32 ShieldIIPt-PT-040B-LTLFireability-00 283439 m, 17002 m/sec, 1161006 t fired, .

Time elapsed: 15 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-040B-LTLFireability-04: AG false findpath

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 19/3599 14/32 ShieldIIPt-PT-040B-LTLFireability-00 384845 m, 20281 m/sec, 1564790 t fired, .

Time elapsed: 20 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-040B-LTLFireability-04: AG false findpath

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 24/3599 17/32 ShieldIIPt-PT-040B-LTLFireability-00 482174 m, 19465 m/sec, 1967357 t fired, .

Time elapsed: 25 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-040B-LTLFireability-04: AG false findpath

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 29/3599 20/32 ShieldIIPt-PT-040B-LTLFireability-00 565773 m, 16719 m/sec, 2374569 t fired, .

Time elapsed: 30 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-040B-LTLFireability-04: AG false findpath

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 34/3599 23/32 ShieldIIPt-PT-040B-LTLFireability-00 641978 m, 15241 m/sec, 2784479 t fired, .

Time elapsed: 35 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-040B-LTLFireability-04: AG false findpath

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 39/3599 26/32 ShieldIIPt-PT-040B-LTLFireability-00 711893 m, 13983 m/sec, 3192489 t fired, .

Time elapsed: 40 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-040B-LTLFireability-04: AG false findpath

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 44/3599 29/32 ShieldIIPt-PT-040B-LTLFireability-00 803054 m, 18232 m/sec, 3597410 t fired, .

Time elapsed: 45 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-040B-LTLFireability-04: AG false findpath

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 49/3599 32/32 ShieldIIPt-PT-040B-LTLFireability-00 885095 m, 16408 m/sec, 4003606 t fired, .

Time elapsed: 50 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 1 (type EXCL) for ShieldIIPt-PT-040B-LTLFireability-00 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPt-PT-040B-LTLFireability-04: AG false findpath

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

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

Time elapsed: 55 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-040B-LTLFireability-00: LTL unknown AGGR
ShieldIIPt-PT-040B-LTLFireability-04: AG false findpath


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

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